default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Valko
Person information
- affiliation: DeepMind
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c109]Mohammad Gheshlaghi Azar, Zhaohan Daniel Guo, Bilal Piot, Rémi Munos, Mark Rowland, Michal Valko, Daniele Calandriello:
A General Theoretical Paradigm to Understand Learning from Human Preferences. AISTATS 2024: 4447-4455- [c108]Alaa Saade, Steven Kapturowski, Daniele Calandriello, Charles Blundell, Pablo Sprechmann, Leopoldo Sarra, Oliver Groth, Michal Valko, Bilal Piot:
Unlocking the Power of Representations in Long-term Novelty-based Exploration. ICLR 2024 - [c107]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Alexey Naumov, Pierre Perrault, Michal Valko, Pierre Ménard:
Demonstration-Regularized RL. ICLR 2024 - [c106]Daniele Calandriello, Zhaohan Daniel Guo, Rémi Munos, Mark Rowland, Yunhao Tang, Bernardo Ávila Pires, Pierre Harvey Richemond, Charline Le Lan, Michal Valko, Tianqi Liu, Rishabh Joshi, Zeyu Zheng, Bilal Piot:
Human Alignment of Large Language Models through Online Preference Optimisation. ICML 2024 - [c105]Tianlin Liu, Shangmin Guo, Leonardo Bianco, Daniele Calandriello, Quentin Berthet, Felipe Llinares-López, Jessica Hoffmann, Lucas Dixon, Michal Valko, Mathieu Blondel:
Decoding-time Realignment of Language Models. ICML 2024 - [c104]Rémi Munos, Michal Valko, Daniele Calandriello, Mohammad Gheshlaghi Azar, Mark Rowland, Zhaohan Daniel Guo, Yunhao Tang, Matthieu Geist, Thomas Mesnard, Côme Fiegel, Andrea Michi, Marco Selvi, Sertan Girgin, Nikola Momchev, Olivier Bachem, Daniel J. Mankowitz, Doina Precup, Bilal Piot:
Nash Learning from Human Feedback. ICML 2024 - [c103]Yunhao Tang, Zhaohan Daniel Guo, Zeyu Zheng, Daniele Calandriello, Rémi Munos, Mark Rowland, Pierre Harvey Richemond, Michal Valko, Bernardo Ávila Pires, Bilal Piot:
Generalized Preference Optimization: A Unified Approach to Offline Alignment. ICML 2024 - [i83]Tianlin Liu, Shangmin Guo, Leonardo Bianco, Daniele Calandriello, Quentin Berthet, Felipe Llinares, Jessica Hoffmann, Lucas Dixon, Michal Valko, Mathieu Blondel:
Decoding-time Realignment of Language Models. CoRR abs/2402.02992 (2024) - [i82]Yunhao Tang, Zhaohan Daniel Guo, Zeyu Zheng, Daniele Calandriello, Rémi Munos, Mark Rowland, Pierre Harvey Richemond, Michal Valko, Bernardo Ávila Pires, Bilal Piot:
Generalized Preference Optimization: A Unified Approach to Offline Alignment. CoRR abs/2402.05749 (2024) - [i81]Daniele Calandriello, Daniel Guo, Rémi Munos, Mark Rowland, Yunhao Tang, Bernardo Ávila Pires, Pierre Harvey Richemond, Charline Le Lan, Michal Valko, Tianqi Liu, Rishabh Joshi, Zeyu Zheng, Bilal Piot:
Human Alignment of Large Language Models through Online Preference Optimisation. CoRR abs/2403.08635 (2024) - [i80]Yunhao Tang, Zhaohan Daniel Guo, Zeyu Zheng, Daniele Calandriello, Yuan Cao, Eugene Tarassov, Rémi Munos, Bernardo Ávila Pires, Michal Valko, Yong Cheng, Will Dabney:
Understanding the performance gap between online and offline alignment algorithms. CoRR abs/2405.08448 (2024) - [i79]Aniket Didolkar, Anirudh Goyal, Nan Rosemary Ke, Siyuan Guo, Michal Valko, Timothy P. Lillicrap, Danilo J. Rezende, Yoshua Bengio, Michael Mozer, Sanjeev Arora:
Metacognitive Capabilities of LLMs: An Exploration in Mathematical Problem Solving. CoRR abs/2405.12205 (2024) - [i78]Pierre Perrault, Denis Belomestny, Pierre Ménard, Éric Moulines, Alexey Naumov, Daniil Tiapkin, Michal Valko:
A New Bound on the Cumulant Generating Function of Dirichlet Processes. CoRR abs/2409.18621 (2024) - 2023
- [c102]Mehdi Azabou, Venkataramana Ganesh, Shantanu Thakoor, Chi-Heng Lin, Lakshmi Sathidevi, Ran Liu, Michal Valko, Petar Velickovic, Eva L. Dyer:
Half-Hop: A graph upsampling approach for slowing down message passing. ICML 2023: 1341-1360 - [c101]Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko:
Adapting to game trees in zero-sum imperfect information games. ICML 2023: 10093-10135 - [c100]Daniel Jarrett, Corentin Tallec, Florent Altché, Thomas Mesnard, Rémi Munos, Michal Valko:
Curiosity in Hindsight: Intrinsic Exploration in Stochastic Environments. ICML 2023: 14780-14816 - [c99]Toshinori Kitamura, Tadashi Kozuno, Yunhao Tang, Nino Vieillard, Michal Valko, Wenhao Yang, Jincheng Mei, Pierre Ménard, Mohammad Gheshlaghi Azar, Rémi Munos, Olivier Pietquin, Matthieu Geist, Csaba Szepesvári, Wataru Kumagai, Yutaka Matsuo:
Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice. ICML 2023: 17135-17175 - [c98]Thomas Mesnard, Wenqi Chen, Alaa Saade, Yunhao Tang, Mark Rowland, Theophane Weber, Clare Lyle, Audrunas Gruslys, Michal Valko, Will Dabney, Georg Ostrovski, Eric Moulines, Rémi Munos:
Quantile Credit Assignment. ICML 2023: 24517-24531 - [c97]Yunhao Tang, Zhaohan Daniel Guo, Pierre Harvey Richemond, Bernardo Ávila Pires, Yash Chandak, Rémi Munos, Mark Rowland, Mohammad Gheshlaghi Azar, Charline Le Lan, Clare Lyle, András György, Shantanu Thakoor, Will Dabney, Bilal Piot, Daniele Calandriello, Michal Valko:
Understanding Self-Predictive Learning for Reinforcement Learning. ICML 2023: 33632-33656 - [c96]Yunhao Tang, Tadashi Kozuno, Mark Rowland, Anna Harutyunyan, Rémi Munos, Bernardo Ávila Pires, Michal Valko:
DoMo-AC: Doubly Multi-step Off-policy Actor-Critic Algorithm. ICML 2023: 33657-33673 - [c95]Yunhao Tang, Rémi Munos, Mark Rowland, Michal Valko:
VA-learning as a more efficient alternative to Q-learning. ICML 2023: 33739-33757 - [c94]Daniil Tiapkin
, Denis Belomestny, Daniele Calandriello, Eric Moulines, Rémi Munos, Alexey Naumov, Pierre Perrault, Yunhao Tang, Michal Valko, Pierre Ménard:
Fast Rates for Maximum Entropy Exploration. ICML 2023: 34161-34221 - [c93]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Rémi Munos, Alexey Naumov, Pierre Perrault, Michal Valko, Pierre Ménard:
Model-free Posterior Sampling via Learning Rate Randomization. NeurIPS 2023 - [i77]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Rémi Munos, Alexey Naumov, Pierre Perrault, Yunhao Tang, Michal Valko, Pierre Ménard:
Fast Rates for Maximum Entropy Exploration. CoRR abs/2303.08059 (2023) - [i76]Alaa Saade, Steven Kapturowski, Daniele Calandriello, Charles Blundell, Pablo Sprechmann, Leopoldo Sarra, Oliver Groth, Michal Valko, Bilal Piot:
Unlocking the Power of Representations in Long-term Novelty-based Exploration. CoRR abs/2305.01521 (2023) - [i75]Toshinori Kitamura, Tadashi Kozuno, Yunhao Tang, Nino Vieillard, Michal Valko, Wenhao Yang, Jincheng Mei, Pierre Ménard, Mohammad Gheshlaghi Azar, Rémi Munos, Olivier Pietquin, Matthieu Geist, Csaba Szepesvári, Wataru Kumagai, Yutaka Matsuo:
Regularization and Variance-Weighted Regression Achieves Minimax Optimality in Linear MDPs: Theory and Practice. CoRR abs/2305.13185 (2023) - [i74]Yunhao Tang, Rémi Munos, Mark Rowland, Michal Valko:
VA-learning as a more efficient alternative to Q-learning. CoRR abs/2305.18161 (2023) - [i73]Yunhao Tang, Tadashi Kozuno, Mark Rowland, Anna Harutyunyan, Rémi Munos, Bernardo Ávila Pires, Michal Valko:
DoMo-AC: Doubly Multi-step Off-policy Actor-Critic Algorithm. CoRR abs/2305.18501 (2023) - [i72]Mehdi Azabou, Venkataramana Ganesh, Shantanu Thakoor, Chi-Heng Lin, Lakshmi Sathidevi, Ran Liu, Michal Valko, Petar Velickovic, Eva L. Dyer:
Half-Hop: A graph upsampling approach for slowing down message passing. CoRR abs/2308.09198 (2023) - [i71]Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko:
Local and adaptive mirror descents in extensive-form games. CoRR abs/2309.00656 (2023) - [i70]Mohammad Gheshlaghi Azar, Mark Rowland, Bilal Piot, Daniel Guo, Daniele Calandriello, Michal Valko, Rémi Munos:
A General Theoretical Paradigm to Understand Learning from Human Preferences. CoRR abs/2310.12036 (2023) - [i69]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Alexey Naumov, Pierre Perrault, Michal Valko, Pierre Ménard:
Demonstration-Regularized RL. CoRR abs/2310.17303 (2023) - [i68]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Rémi Munos, Alexey Naumov, Pierre Perrault, Michal Valko, Pierre Ménard:
Model-free Posterior Sampling via Learning Rate Randomization. CoRR abs/2310.18186 (2023) - [i67]Rémi Munos, Michal Valko, Daniele Calandriello, Mohammad Gheshlaghi Azar, Mark Rowland, Zhaohan Daniel Guo, Yunhao Tang, Matthieu Geist, Thomas Mesnard, Andrea Michi, Marco Selvi, Sertan Girgin, Nikola Momchev, Olivier Bachem, Daniel J. Mankowitz, Doina Precup, Bilal Piot:
Nash Learning from Human Feedback. CoRR abs/2312.00886 (2023) - 2022
- [c92]Yunhao Tang, Mark Rowland, Rémi Munos, Michal Valko:
Marginalized Operators for Off-policy Reinforcement Learning. AISTATS 2022: 655-679 - [c91]Jean Tarbouriech, Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Adaptive Multi-Goal Exploration. AISTATS 2022: 7349-7383 - [c90]Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Mehdi Azabou, Eva L. Dyer, Rémi Munos, Petar Velickovic, Michal Valko:
Large-Scale Representation Learning on Graphs via Bootstrapping. ICLR 2022 - [c89]Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times. ICML 2022: 2523-2541 - [c88]Anirudh Goyal, Abram L. Friesen, Andrea Banino, Theophane Weber, Nan Rosemary Ke, Adrià Puigdomènech Badia, Arthur Guez, Mehdi Mirza, Peter Conway Humphreys, Ksenia Konyushkova, Michal Valko, Simon Osindero, Timothy P. Lillicrap, Nicolas Heess, Charles Blundell:
Retrieval-Augmented Reinforcement Learning. ICML 2022: 7740-7765 - [c87]Daniil Tiapkin, Denis Belomestny, Eric Moulines, Alexey Naumov, Sergey Samsonov, Yunhao Tang, Michal Valko, Pierre Ménard:
From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses. ICML 2022: 21380-21431 - [c86]Zhaohan Guo, Shantanu Thakoor, Miruna Pislar, Bernardo Ávila Pires, Florent Altché, Corentin Tallec, Alaa Saade, Daniele Calandriello, Jean-Bastien Grill, Yunhao Tang, Michal Valko, Rémi Munos, Mohammad Gheshlaghi Azar, Bilal Piot:
BYOL-Explore: Exploration by Bootstrapped Prediction. NeurIPS 2022 - [c85]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Rémi Munos, Alexey Naumov, Mark Rowland, Michal Valko, Pierre Ménard:
Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees. NeurIPS 2022 - [i66]Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times. CoRR abs/2201.12909 (2022) - [i65]Anirudh Goyal, Abram L. Friesen, Andrea Banino, Theophane Weber, Nan Rosemary Ke, Adrià Puigdomènech Badia, Arthur Guez, Mehdi Mirza, Ksenia Konyushkova, Michal Valko, Simon Osindero, Timothy P. Lillicrap, Nicolas Heess, Charles Blundell:
Retrieval-Augmented Reinforcement Learning. CoRR abs/2202.08417 (2022) - [i64]Yunhao Tang, Mark Rowland, Rémi Munos, Michal Valko:
Marginalized Operators for Off-policy Reinforcement Learning. CoRR abs/2203.16177 (2022) - [i63]Daniil Tiapkin, Denis Belomestny, Eric Moulines, Alexey Naumov, Sergey Samsonov, Yunhao Tang, Michal Valko, Pierre Ménard:
From Dirichlet to Rubin: Optimistic Exploration in RL without Bonuses. CoRR abs/2205.07704 (2022) - [i62]Tadashi Kozuno, Wenhao Yang, Nino Vieillard, Toshinori Kitamura, Yunhao Tang, Jincheng Mei, Pierre Ménard, Mohammad Gheshlaghi Azar, Michal Valko, Rémi Munos, Olivier Pietquin, Matthieu Geist, Csaba Szepesvári:
KL-Entropy-Regularized RL with a Generative Model is Minimax Optimal. CoRR abs/2205.14211 (2022) - [i61]Zhaohan Daniel Guo, Shantanu Thakoor, Miruna Pislar, Bernardo Ávila Pires, Florent Altché, Corentin Tallec, Alaa Saade, Daniele Calandriello, Jean-Bastien Grill, Yunhao Tang, Michal Valko, Rémi Munos, Mohammad Gheshlaghi Azar, Bilal Piot:
BYOL-Explore: Exploration by Bootstrapped Prediction. CoRR abs/2206.08332 (2022) - [i60]Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines, Rémi Munos, Alexey Naumov, Mark Rowland, Michal Valko, Pierre Ménard:
Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees. CoRR abs/2209.14414 (2022) - [i59]Daniel Jarrett, Corentin Tallec, Florent Altché, Thomas Mesnard, Rémi Munos, Michal Valko:
Curiosity in hindsight. CoRR abs/2211.10515 (2022) - [i58]Yunhao Tang, Zhaohan Daniel Guo, Pierre Harvey Richemond, Bernardo Ávila Pires, Yash Chandak, Rémi Munos, Mark Rowland, Mohammad Gheshlaghi Azar, Charline Le Lan, Clare Lyle, András György, Shantanu Thakoor, Will Dabney, Bilal Piot, Daniele Calandriello, Michal Valko:
Understanding Self-Predictive Learning for Reinforcement Learning. CoRR abs/2212.03319 (2022) - [i57]Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko:
Adapting to game trees in zero-sum imperfect information games. CoRR abs/2212.12567 (2022) - 2021
- [j5]Karl Tuyls, Shayegan Omidshafiei, Paul Muller, Zhe Wang, Jerome T. Connor, Daniel Hennes, Ian Graham, William Spearman, Tim Waskett, Dafydd Steele, Pauline Luc, Adrià Recasens, Alexandre Galashov, Gregory Thornton, Romuald Elie, Pablo Sprechmann, Pol Moreno, Kris Cao, Marta Garnelo, Praneet Dutta, Michal Valko, Nicolas Heess, Alex Bridgland, Julien Pérolat, Bart De Vylder, S. M. Ali Eslami, Mark Rowland, Andrew Jaegle, Rémi Munos, Trevor Back, Razia Ahamed, Simon Bouton, Nathalie Beauguerlange, Jackson Broshear, Thore Graepel, Demis Hassabis:
Game Plan: What AI can do for Football, and What Football can do for AI. J. Artif. Intell. Res. 71: 41-88 (2021) - [j4]Guillaume Gautier, Rémi Bardenet, Michal Valko:
Fast sampling from β-ensembles. Stat. Comput. 31(1): 7 (2021) - [c84]Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko:
A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces. AISTATS 2021: 3538-3546 - [c83]Omar Darwiche Domingues, Pierre Ménard, Emilie Kaufmann, Michal Valko:
Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited. ALT 2021: 578-598 - [c82]Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, Michal Valko:
Adaptive Reward-Free Exploration. ALT 2021: 865-891 - [c81]Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model. ALT 2021: 1157-1178 - [c80]Adrià Recasens, Pauline Luc, Jean-Baptiste Alayrac, Luyu Wang, Florian Strub, Corentin Tallec, Mateusz Malinowski, Viorica Patraucean, Florent Altché, Michal Valko, Jean-Bastien Grill, Aäron van den Oord, Andrew Zisserman:
Broaden Your Views for Self-Supervised Video Learning. ICCV 2021: 1235-1245 - [c79]Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko:
Kernel-Based Reinforcement Learning: A Finite-Time Analysis. ICML 2021: 2783-2792 - [c78]Xavier Fontaine, Pierre Perrault, Michal Valko, Vianney Perchet:
Online A-Optimal Design and Active Linear Regression. ICML 2021: 3374-3383 - [c77]Tadashi Kozuno, Yunhao Tang, Mark Rowland, Rémi Munos, Steven Kapturowski, Will Dabney, Michal Valko, David Abel:
Revisiting Peng's Q(λ) for Modern Reinforcement Learning. ICML 2021: 5794-5804 - [c76]Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann, Edouard Leurent, Michal Valko:
Fast active learning for pure exploration in reinforcement learning. ICML 2021: 7599-7608 - [c75]Pierre Ménard, Omar Darwiche Domingues, Xuedong Shang, Michal Valko:
UCB Momentum Q-learning: Correcting the bias without forgetting. ICML 2021: 7609-7618 - [c74]Yunhao Tang, Mark Rowland, Rémi Munos, Michal Valko:
Taylor Expansion of Discount Factors. ICML 2021: 10130-10140 - [c73]Yunhao Tang, Tadashi Kozuno, Mark Rowland, Rémi Munos, Michal Valko:
Unifying Gradient Estimators for Meta-Reinforcement Learning via Off-Policy Evaluation. NeurIPS 2021: 5303-5315 - [c72]Jean Tarbouriech, Runlong Zhou, Simon S. Du, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret. NeurIPS 2021: 6843-6855 - [c71]Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
A Provably Efficient Sample Collection Strategy for Reinforcement Learning. NeurIPS 2021: 7611-7624 - [c70]Ran Liu, Mehdi Azabou, Max Dabagia, Chi-Heng Lin, Mohammad Gheshlaghi Azar, Keith B. Hengen, Michal Valko, Eva L. Dyer:
Drop, Swap, and Generate: A Self-Supervised Approach for Generating Neural Activity. NeurIPS 2021: 10587-10599 - [c69]Tadashi Kozuno, Pierre Ménard, Rémi Munos, Michal Valko:
Learning in two-player zero-sum partially observable Markov games with perfect recall. NeurIPS 2021: 11987-11998 - [i56]Pierre Perrault, Jennifer Healey, Zheng Wen, Michal Valko:
On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions. CoRR abs/2101.01631 (2021) - [i55]Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar, Alaa Saade, Shantanu Thakoor, Bilal Piot, Bernardo Ávila Pires, Michal Valko, Thomas Mesnard, Tor Lattimore, Rémi Munos:
Geometric Entropic Exploration. CoRR abs/2101.02055 (2021) - [i54]Shantanu Thakoor, Corentin Tallec, Mohammad Gheshlaghi Azar, Rémi Munos, Petar Velickovic, Michal Valko:
Bootstrapped Representation Learning on Graphs. CoRR abs/2102.06514 (2021) - [i53]Mehdi Azabou, Mohammad Gheshlaghi Azar, Ran Liu, Chi-Heng Lin, Erik C. Johnson, Kiran Bhaskaran-Nair, Max Dabagia, Keith B. Hengen, William R. Gray Roncal, Michal Valko, Eva L. Dyer:
Mine Your Own vieW: Self-Supervised Learning Through Across-Sample Prediction. CoRR abs/2102.10106 (2021) - [i52]Tadashi Kozuno, Yunhao Tang, Mark Rowland, Rémi Munos, Steven Kapturowski, Will Dabney, Michal Valko, David Abel:
Revisiting Peng's Q(λ) for Modern Reinforcement Learning. CoRR abs/2103.00107 (2021) - [i51]Pierre Ménard, Omar Darwiche Domingues, Xuedong Shang, Michal Valko:
UCB Momentum Q-learning: Correcting the bias without forgetting. CoRR abs/2103.01312 (2021) - [i50]Adrià Recasens, Pauline Luc, Jean-Baptiste Alayrac, Luyu Wang, Florian Strub, Corentin Tallec, Mateusz Malinowski, Viorica Patraucean, Florent Altché, Michal Valko, Jean-Bastien Grill, Aäron van den Oord, Andrew Zisserman:
Broaden Your Views for Self-Supervised Video Learning. CoRR abs/2103.16559 (2021) - [i49]Jean Tarbouriech, Runlong Zhou, Simon S. Du, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret. CoRR abs/2104.11186 (2021) - [i48]Yunhao Tang, Mark Rowland, Rémi Munos, Michal Valko:
Taylor Expansion of Discount Factors. CoRR abs/2106.06170 (2021) - [i47]Tadashi Kozuno, Pierre Ménard, Rémi Munos, Michal Valko:
Model-Free Learning for Two-Player Zero-Sum Partially Observable Markov Games with Perfect Recall. CoRR abs/2106.06279 (2021) - [i46]Yunhao Tang, Tadashi Kozuno, Mark Rowland, Rémi Munos, Michal Valko:
Unifying Gradient Estimators for Meta-Reinforcement Learning via Off-Policy Evaluation. CoRR abs/2106.13125 (2021) - [i45]Ran Liu, Mehdi Azabou, Max Dabagia, Chi-Heng Lin, Mohammad Gheshlaghi Azar, Keith B. Hengen, Michal Valko, Eva L. Dyer:
Drop, Swap, and Generate: A Self-Supervised Approach for Generating Neural Activity. CoRR abs/2111.02338 (2021) - [i44]Jean Tarbouriech, Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Adaptive Multi-Goal Exploration. CoRR abs/2111.12045 (2021) - 2020
- [c68]Xuedong Shang, Rianne de Heide, Pierre Ménard, Emilie Kaufmann, Michal Valko:
Fixed-confidence guarantees for Bayesian best-arm identification. AISTATS 2020: 1823-1832 - [c67]Haitham Ammar, Victor Gabillon, Rasul Tutunov, Michal Valko:
Derivative-Free & Order-Robust Optimisation. AISTATS 2020: 2293-2303 - [c66]Côme Fiegel, Victor Gabillon, Michal Valko:
Adaptive multi-fidelity optimization with fast learning rates. AISTATS 2020: 3493-3502 - [c65]Julien Seznec, Pierre Ménard, Alessandro Lazaric, Michal Valko:
A single algorithm for both restless and rested rotting bandits. AISTATS 2020: 3784-3794 - [c64]Pierre Perrault, Michal Valko, Vianney Perchet:
Covariance-adapting algorithm for semi-bandits with application to sparse outcomes. COLT 2020: 3152-3184 - [c63]Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Near-linear time Gaussian process optimization with adaptive batching and resparsification. ICML 2020: 1295-1305 - [c62]Rémy Degenne, Pierre Ménard, Xuedong Shang, Michal Valko:
Gamification of Pure Exploration for Linear Bandits. ICML 2020: 2432-2442 - [c61]Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko:
Stochastic bandits with arm-dependent delays. ICML 2020: 3348-3356 - [c60]Jean-Bastien Grill, Florent Altché, Yunhao Tang, Thomas Hubert, Michal Valko, Ioannis Antonoglou, Rémi Munos:
Monte-Carlo Tree Search as Regularized Policy Optimization. ICML 2020: 3769-3778 - [c59]Pierre Perrault, Jennifer Healey, Zheng Wen, Michal Valko:
Budgeted Online Influence Maximization. ICML 2020: 7620-7631 - [c58]Aadirupa Saha, Pierre Gaillard, Michal Valko:
Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards. ICML 2020: 8357-8366 - [c57]Yunhao Tang, Michal Valko, Rémi Munos:
Taylor Expansion Policy Optimization. ICML 2020: 9397-9406 - [c56]Jean Tarbouriech, Evrard Garcelon, Michal Valko, Matteo Pirotta, Alessandro Lazaric:
No-Regret Exploration in Goal-Oriented Reinforcement Learning. ICML 2020: 9428-9437 - [c55]Daniele Calandriello, Michal Derezinski, Michal Valko:
Sampling from a k-DPP without looking at all items. NeurIPS 2020 - [c54]Jean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec, Pierre H. Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Ávila Pires, Zhaohan Guo, Mohammad Gheshlaghi Azar, Bilal Piot, Koray Kavukcuoglu, Rémi Munos, Michal Valko:
Bootstrap Your Own Latent - A New Approach to Self-Supervised Learning. NeurIPS 2020 - [c53]Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Edouard Leurent, Michal Valko:
Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. NeurIPS 2020 - [c52]Pierre Perrault, Etienne Boursier, Michal Valko, Vianney Perchet:
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits. NeurIPS 2020 - [c51]Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Improved Sample Complexity for Incremental Autonomous Exploration in MDPs. NeurIPS 2020 - [i43]Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Near-linear Time Gaussian Process Optimization with Adaptive Batching and Resparsification. CoRR abs/2002.09954 (2020) - [i42]Yunhao Tang, Michal Valko, Rémi Munos:
Taylor Expansion Policy Optimization. CoRR abs/2003.06259 (2020) - [i41]Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko:
Regret Bounds for Kernel-Based Reinforcement Learning. CoRR abs/2004.05599 (2020) - [i40]Aadirupa Saha, Pierre Gaillard, Michal Valko:
Improved Sleeping Bandits with Stochastic Actions Sets and Adversarial Rewards. CoRR abs/2004.06248 (2020) - [i39]Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Edouard Leurent, Michal Valko:
Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. CoRR abs/2006.05879 (2020) - [i38]Emilie Kaufmann, Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Edouard Leurent, Michal Valko:
Adaptive Reward-Free Exploration. CoRR abs/2006.06294 (2020) - [i37]Pierre Perrault, Etienne Boursier, Vianney Perchet, Michal Valko:
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits. CoRR abs/2006.06613 (2020) - [i36]Jean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec, Pierre H. Richemond, Elena Buchatskaya, Carl Doersch, Bernardo Ávila Pires, Zhaohan Daniel Guo, Mohammad Gheshlaghi Azar, Bilal Piot, Koray Kavukcuoglu, Rémi Munos, Michal Valko:
Bootstrap Your Own Latent: A New Approach to Self-Supervised Learning. CoRR abs/2006.07733 (2020) - [i35]Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko:
Stochastic bandits with arm-dependent delays. CoRR abs/2006.10459 (2020) - [i34]Daniele Calandriello, Michal Derezinski, Michal Valko:
Sampling from a k-DPP without looking at all items. CoRR abs/2006.16947 (2020) - [i33]Rémy Degenne, Pierre Ménard, Xuedong Shang, Michal Valko:
Gamification of Pure Exploration for Linear Bandits. CoRR abs/2007.00953 (2020) - [i32]Omar Darwiche Domingues, Pierre Ménard, Matteo Pirotta, Emilie Kaufmann, Michal Valko:
A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces. CoRR abs/2007.05078 (2020) - [i31]Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
A Provably Efficient Sample Collection Strategy for Reinforcement Learning. CoRR abs/2007.06437 (2020) - [i30]Jean-Bastien Grill, Florent Altché, Yunhao Tang, Thomas Hubert, Michal Valko, Ioannis Antonoglou, Rémi Munos:
Monte-Carlo Tree Search as Regularized Policy Optimization. CoRR abs/2007.12509 (2020) - [i29]Pierre Ménard, Omar Darwiche Domingues, Anders Jonsson, Emilie Kaufmann, Edouard Leurent, Michal Valko:
Fast active learning for pure exploration in reinforcement learning. CoRR abs/2007.13442 (2020) - [i28]Omar Darwiche Domingues, Pierre Ménard, Emilie Kaufmann, Michal Valko:
Episodic Reinforcement Learning in Finite MDPs: Minimax Lower Bounds Revisited. CoRR abs/2010.03531 (2020) - [i27]Pierre H. Richemond, Jean-Bastien Grill, Florent Altché, Corentin Tallec, Florian Strub, Andrew Brock, Samuel L. Smith, Soham De, Razvan Pascanu, Bilal Piot, Michal Valko:
BYOL works even without batch statistics. CoRR abs/2010.10241 (2020) - [i26]Karl Tuyls, Shayegan Omidshafiei, Paul Muller, Zhe Wang, Jerome T. Connor, Daniel Hennes, Ian Graham, William Spearman, Tim Waskett, Dafydd Steele, Pauline Luc, Adrià Recasens, Alexandre Galashov, Gregory Thornton, Romuald Elie, Pablo Sprechmann, Pol Moreno, Kris Cao, Marta Garnelo, Praneet Dutta, Michal Valko, Nicolas Heess, Alex Bridgland, Julien Pérolat, Bart De Vylder, S. M. Ali Eslami, Mark Rowland, Andrew Jaegle, Rémi Munos, Trevor Back, Razia Ahamed, Simon Bouton, Nathalie Beauguerlange, Jackson Broshear, Thore Graepel, Demis Hassabis:
Game Plan: What AI can do for Football, and What Football can do for AI. CoRR abs/2011.09192 (2020) - [i25]Jean Tarbouriech, Matteo Pirotta, Michal Valko, Alessandro Lazaric:
Improved Sample Complexity for Incremental Autonomous Exploration in MDPs. CoRR abs/2012.14755 (2020)
2010 – 2019
- 2019
- [j3]Guillaume Gautier, Guillermo Polito, Rémi Bardenet, Michal Valko:
DPPy: DPP Sampling with Python. J. Mach. Learn. Res. 20: 180:1-180:7 (2019) - [c50]Pierre Perrault, Vianney Perchet, Michal Valko:
Finding the bandit in a graph: Sequential search-and-stop. AISTATS 2019: 1668-1677 - [c49]Andrea Locatelli, Alexandra Carpentier, Michal Valko:
Active multiple matrix completion with adaptive confidence sets. AISTATS 2019: 1783-1791 - [c48]Julien Seznec, Andrea Locatelli, Alexandra Carpentier, Alessandro Lazaric, Michal Valko:
Rotting bandits are no harder than stochastic ones. AISTATS 2019: 2564-2572 - [c47]Peter L. Bartlett, Victor Gabillon, Michal Valko:
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption. ALT 2019: 184-206 - [c46]Xuedong Shang, Emilie Kaufmann, Michal Valko:
General parallel optimization a without metric. ALT 2019: 762-787 - [c45]Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret. COLT 2019: 533-557 - [c44]Peter L. Bartlett, Victor Gabillon, Jennifer Healey, Michal Valko:
Scale-free adaptive planning for deterministic dynamics & discounted rewards. ICML 2019: 495-504 - [c43]Pierre Perrault, Vianney Perchet, Michal Valko:
Exploiting structure of uncertainty for efficient matroid semi-bandits. ICML 2019: 5123-5132 - [c42]Guillaume Gautier, Rémi Bardenet, Michal Valko:
On two ways to use determinantal point processes for Monte Carlo integration. NeurIPS 2019: 7768-7777 - [c41]Michal Derezinski, Daniele Calandriello, Michal Valko:
Exact sampling of determinantal point processes with sublinear time preprocessing. NeurIPS 2019: 11542-11554 - [c40]Mark Rowland, Shayegan Omidshafiei, Karl Tuyls, Julien Pérolat, Michal Valko, Georgios Piliouras, Rémi Munos:
Multiagent Evaluation under Incomplete Information. NeurIPS 2019: 12270-12282 - [c39]Jean-Bastien Grill, Omar Darwiche Domingues, Pierre Ménard, Rémi Munos, Michal Valko:
Planning in entropy-regularized Markov decision processes and games. NeurIPS 2019: 12383-12392 - [i24]Jean-Bastien Grill, Michal Valko, Rémi Munos:
Optimistic optimization of a Brownian. CoRR abs/1901.04884 (2019) - [i23]Pierre Perrault, Vianney Perchet, Michal Valko:
Exploiting Structure of Uncertainty for Efficient Combinatorial Semi-Bandits. CoRR abs/1902.03794 (2019) - [i22]Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret. CoRR abs/1903.05594 (2019) - [i21]Michal Derezinski, Daniele Calandriello, Michal Valko:
Exact sampling of determinantal point processes with sublinear time preprocessing. CoRR abs/1905.13476 (2019) - [i20]Mark Rowland, Shayegan Omidshafiei, Karl Tuyls, Julien Pérolat, Michal Valko, Georgios Piliouras, Rémi Munos:
Multiagent Evaluation under Incomplete Information. CoRR abs/1909.09849 (2019) - [i19]Victor Gabillon, Rasul Tutunov, Michal Valko, Haitham Bou-Ammar:
Derivative-Free & Order-Robust Optimisation. CoRR abs/1910.04034 (2019) - [i18]Xuedong Shang, Rianne de Heide, Emilie Kaufmann, Pierre Ménard, Michal Valko:
Fixed-Confidence Guarantees for Bayesian Best-Arm Identification. CoRR abs/1910.10945 (2019) - [i17]Jean Tarbouriech, Evrard Garcelon, Michal Valko, Matteo Pirotta, Alessandro Lazaric:
No-Regret Exploration in Goal-Oriented Reinforcement Learning. CoRR abs/1912.03517 (2019) - 2018
- [c38]Yasin Abbasi-Yadkori, Peter L. Bartlett, Victor Gabillon, Alan Malek, Michal Valko:
Best of both worlds: Stochastic & adversarial best-arm identification. COLT 2018: 918-949 - [c37]Edouard Oyallon, Eugene Belilovsky, Sergey Zagoruyko, Michal Valko:
Compressing the Input for CNNs with the First-Order Scattering Transform. ECCV (9) 2018: 305-320 - [c36]Daniele Calandriello, Ioannis Koutis, Alessandro Lazaric, Michal Valko:
Improved Large-Scale Graph Learning through Ridge Spectral Sparsification. ICML 2018: 687-696 - [c35]Fabrice Popineau, Michal Valko, Jill-Jênn Vie:
Preface. ITS Workshops 2018: 141-143 - [c34]Jean-Bastien Grill, Michal Valko, Rémi Munos:
Optimistic optimization of a Brownian. NeurIPS 2018: 3009-3018 - [i16]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Distributed Adaptive Sampling for Kernel Matrix Approximation. CoRR abs/1803.10172 (2018) - [i15]Pierre Perrault, Vianney Perchet, Michal Valko:
Finding the Bandit in a Graph: Sequential Search-and-Stop. CoRR abs/1806.02282 (2018) - [i14]Guillaume Gautier, Rémi Bardenet, Michal Valko:
DPPy: Sampling Determinantal Point Processes with Python. CoRR abs/1809.07258 (2018) - [i13]Edouard Oyallon, Eugene Belilovsky, Sergey Zagoruyko, Michal Valko:
Compressing the Input for CNNs with the First-Order Scattering Transform. CoRR abs/1809.10200 (2018) - [i12]Peter L. Bartlett, Victor Gabillon, Michal Valko:
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption. CoRR abs/1810.00997 (2018) - [i11]Julien Seznec, Andrea Locatelli, Alexandra Carpentier, Alessandro Lazaric, Michal Valko:
Rotting bandits are no harder than stochastic ones. CoRR abs/1811.11043 (2018) - 2017
- [c33]Akram Erraqabi, Alessandro Lazaric, Michal Valko, Emma Brunskill, Yun-En Liu:
Trading off Rewards and Errors in Multi-Armed Bandits. AISTATS 2017: 709-717 - [c32]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Distributed Adaptive Sampling for Kernel Matrix Approximation. AISTATS 2017: 1421-1429 - [c31]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Second-Order Kernel Online Convex Optimization with Adaptive Sketching. ICML 2017: 645-653 - [c30]Guillaume Gautier, Rémi Bardenet, Michal Valko:
Zonotope Hit-and-run for Efficient Sampling from Projection DPPs. ICML 2017: 1223-1232 - [c29]Zheng Wen, Branislav Kveton, Michal Valko, Sharan Vaswani:
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback. NIPS 2017: 3022-3032 - [c28]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Efficient Second-Order Online Kernel Learning with Adaptive Embedding. NIPS 2017: 6140-6150 - [i10]Guillaume Gautier, Rémi Bardenet, Michal Valko:
Zonotope hit-and-run for efficient sampling from projection DPPs. CoRR abs/1705.10498 (2017) - [i9]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Second-Order Kernel Online Convex Optimization with Adaptive Sketching. CoRR abs/1706.04892 (2017) - 2016
- [j2]Mohammad Ghavamzadeh, Yaakov Engel, Michal Valko:
Bayesian Policy Gradient and Actor-Critic Algorithms. J. Mach. Learn. Res. 17: 66:1-66:53 (2016) - [c27]Alexandra Carpentier, Michal Valko:
Revealing Graph Bandits for Maximizing Local Influence. AISTATS 2016: 10-18 - [c26]Tomás Kocák, Gergely Neu, Michal Valko:
Online Learning with Noisy Side Observations. AISTATS 2016: 1186-1194 - [c25]Akram Erraqabi, Michal Valko, Alexandra Carpentier, Odalric-Ambrym Maillard:
Pliable Rejection Sampling. ICML 2016: 2121-2129 - [c24]Jean-Bastien Grill, Michal Valko, Rémi Munos:
Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning. NIPS 2016: 4673-4681 - [c23]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Analysis of Nyström method with sequential ridge leverage scores. UAI 2016 - [c22]Tomás Kocák, Gergely Neu, Michal Valko:
Online learning with Erdos-Renyi side-observation graphs. UAI 2016 - [i8]Daniele Calandriello, Alessandro Lazaric, Michal Valko, Ioannis Koutis:
Incremental Spectral Sparsification for Large-Scale Graph-Based Semi-Supervised Learning. CoRR abs/1601.05675 (2016) - [i7]Zheng Wen, Branislav Kveton, Michal Valko:
Influence Maximization with Semi-Bandit Feedback. CoRR abs/1605.06593 (2016) - [i6]Daniele Calandriello, Alessandro Lazaric, Michal Valko:
Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting. CoRR abs/1609.03769 (2016) - 2015
- [c21]Alexandra Carpentier, Michal Valko:
Simple regret for infinitely many armed bandits. ICML 2015: 1133-1141 - [c20]Manjesh Kumar Hanawal, Venkatesh Saligrama, Michal Valko, Rémi Munos:
Cheap Bandits. ICML 2015: 2133-2142 - [c19]Julien Audiffren, Michal Valko, Alessandro Lazaric, Mohammad Ghavamzadeh:
Maximum Entropy Semi-Supervised Inverse Reinforcement Learning. IJCAI 2015: 3315-3321 - [c18]Jean-Bastien Grill, Michal Valko, Rémi Munos:
Black-box optimization of noisy functions with unknown smoothness. NIPS 2015: 667-675 - [i5]Alexandra Carpentier, Michal Valko:
Simple regret for infinitely many armed bandits. CoRR abs/1505.04627 (2015) - [i4]Manjesh Kumar Hanawal, Venkatesh Saligrama, Michal Valko, Rémi Munos:
Cheap Bandits. CoRR abs/1506.04782 (2015) - 2014
- [c17]Tomás Kocák, Michal Valko, Rémi Munos, Shipra Agrawal:
Spectral Thompson Sampling. AAAI 2014: 1911-1917 - [c16]Philippe Preux, Rémi Munos, Michal Valko:
Bandits attack function optimization. IEEE Congress on Evolutionary Computation 2014: 2245-2252 - [c15]Michal Valko, Rémi Munos, Branislav Kveton, Tomás Kocák:
Spectral Bandits for Smooth Graph Functions. ICML 2014: 46-54 - [c14]Tomás Kocák, Gergely Neu, Michal Valko, Rémi Munos:
Efficient learning by implicit exploration in bandit problems with side observations. NIPS 2014: 613-621 - [c13]Alexandra Carpentier, Michal Valko:
Extreme bandits. NIPS 2014: 1089-1097 - [c12]Gergely Neu, Michal Valko:
Online combinatorial optimization with stochastic decision sets and adversarial losses. NIPS 2014: 2780-2788 - [i3]Branislav Kveton, Zheng Wen, Azin Ashkan, Michal Valko:
Learning to Act Greedily: Polymatroid Semi-Bandits. CoRR abs/1405.7752 (2014) - 2013
- [j1]Milos Hauskrecht, Iyad Batal, Michal Valko, Shyam Visweswaran, Gregory F. Cooper, Gilles Clermont:
Outlier detection for patient monitoring and alerting. J. Biomed. Informatics 46(1): 47-55 (2013) - [c11]Branislav Kveton, Michal Valko:
Learning from a single labeled face and a stream of unlabeled data. FG 2013: 1-8 - [c10]Michal Valko, Alexandra Carpentier, Rémi Munos:
Stochastic Simultaneous Optimistic Optimization. ICML (2) 2013: 19-27 - [c9]Michal Valko, Nathaniel Korda, Rémi Munos, Ilias N. Flaounas, Nello Cristianini:
Finite-Time Analysis of Kernelised Contextual Bandits. UAI 2013 - [i2]Michal Valko, Nathaniel Korda, Rémi Munos, Ilias N. Flaounas, Nello Cristianini:
Finite-Time Analysis of Kernelised Contextual Bandits. CoRR abs/1309.6869 (2013) - 2012
- [c8]Michal Valko, Mohammad Ghavamzadeh, Alessandro Lazaric:
Semi-Supervised Apprenticeship Learning. EWRL 2012: 131-142 - [i1]Michal Valko, Branislav Kveton, Ling Huang, Daniel Ting:
Online Semi-Supervised Learning on Quantized Graphs. CoRR abs/1203.3522 (2012) - 2011
- [c7]Michal Valko, Branislav Kveton, Hamed Valizadegan, Gregory F. Cooper, Milos Hauskrecht:
Conditional Anomaly Detection with Soft Harmonic Functions. ICDM 2011: 735-743 - 2010
- [c6]Branislav Kveton, Matthai Philipose, Michal Valko, Ling Huang:
Online semi-supervised perception: Real-time learning without explicit feedback. CVPR Workshops 2010: 15-21 - [c5]Michal Valko, Milos Hauskrecht:
Feature importance analysis for patient management decisions. MedInfo 2010: 861-865 - [c4]Michal Valko, Branislav Kveton, Ling Huang, Daniel Ting:
Online Semi-Supervised Learning on Quantized Graphs. UAI 2010: 606-614 - [c3]Branislav Kveton, Michal Valko, Ali Rahimi, Ling Huang:
Semi-Supervised Learning with Max-Margin Graph Cuts. AISTATS 2010: 421-428
2000 – 2009
- 2008
- [c2]Michal Valko, Milos Hauskrecht:
Distance Metric Learning for Conditional Anomaly Detection. FLAIRS 2008: 684-689 - 2007
- [c1]Milos Hauskrecht, Michal Valko, Branislav Kveton, Shyam Visweswaran, Gregory F. Cooper:
Evidence-based Anomaly Detection in Clinical Domains. AMIA 2007
Coauthor Index
Zhaohan Guo
aka: Zhaohan Daniel Guo
aka: Zhaohan Daniel Guo
Eric Moulines
aka: Éric Moulines
aka: Éric Moulines
[c109] [c106] [c104] [c103] [i82] [i81] [i80] [c101] [c100] [c99] [c98] [c97] [c96] [c95] [c94] [c93] [i77] [i75] [i74] [i73] [i71] [i70] [i68] [i67] [c92] [c90] [c86] [c85] [i64] [i62] [i61] [i60] [i59] [i58] [i57] [j5] [c77] [c74] [c73] [c69] [i55] [i54] [i52] [i48] [i47] [i46] [c60] [c57] [c54] [i42] [i36] [i30] [i26] [c40] [c39] [i24] [i20] [c34] [c24] [c20] [c18] [i4] [c17] [c16] [c15] [c14] [c10] [c9] [i2]
Pierre H. Richemond
aka: Pierre Harvey Richemond
aka: Pierre Harvey Richemond
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
