Nadav Merlis - RankMe

39 papers A* 16A 2Journal 21

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Online Linear Regression with Paid Stochastic Features. AAAI Nadav Merlis, Kyoungseok Jang, Nicolò Cesa-Bianchi
2026	J	`jnl`	Reinforcement Learning with Multi-Step Lookahead Information Via Adaptive Batching. CoRR Nadav Merlis
2025	A*	`conf`	On Bits and Bandits: Quantifying the Regret-Information Trade-off. ICLR Itai Shufaro, Nadav Merlis, Nir Weinberger, Shie Mannor
2025	J	`jnl`	On the hardness of RL with Lookahead. CoRR Corentin Pla, Hugo Richard, Marc Abeille, Nadav Merlis, Vianney Perchet
2025	J	`jnl`	Online Linear Regression with Paid Stochastic Features. CoRR Nadav Merlis, Kyoungseok Jang, Nicolò Cesa-Bianchi
2024	A*	`conf`	Improved Algorithms for Contextual Dynamic Pricing. NeurIPS Matilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney Perchet
2024	J	`jnl`	Improved Algorithms for Contextual Dynamic Pricing. CoRR Matilde Tullii, Solenne Gaucher, Nadav Merlis, Vianney Perchet
2024	A	`conf`	Multi-armed bandits with guaranteed revenue per arm. AISTATS Dorian Baudry, Nadav Merlis, Mathieu Benjamin Molina, Hugo Richard, Vianney Perchet
2024	J	`jnl`	On Bits and Bandits: Quantifying the Regret-Information Trade-off. CoRR Itai Shufaro, Nadav Merlis, Nir Weinberger, Shie Mannor
2024	A*	`conf`	Reinforcement Learning with Lookahead Information. NeurIPS Nadav Merlis
2024	J	`jnl`	Reinforcement Learning with Lookahead Information. CoRR Nadav Merlis
2024	J	`jnl`	Stable Matching with Ties: Approximation Ratios and Learning. CoRR Shiyun Lin, Simon Mauras, Nadav Merlis, Vianney Perchet
2024	A*	`conf`	The Value of Reward Lookahead in Reinforcement Learning. NeurIPS Nadav Merlis, Dorian Baudry, Vianney Perchet
2024	J	`jnl`	The Value of Reward Lookahead in Reinforcement Learning. CoRR Nadav Merlis, Dorian Baudry, Vianney Perchet
2023	A	`conf`	Never Worse, Mostly Better: Stable Policy Improvement in Deep Reinforcement Learning. AAMAS Pranav Khanna, Guy Tennenholtz, Nadav Merlis, Shie Mannor, Chen Tessler
2023	A*	`conf`	On Preemption and Learning in Stochastic Scheduling. ICML Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet
2023	J	`jnl`	Ranking with Popularity Bias: User Welfare under Self-Amplification Dynamics. CoRR Guy Tennenholtz, Martin Mladenov, Nadav Merlis, Craig Boutilier
2023	A*	`conf`	Reinforcement Learning with History Dependent Dynamic Contexts. ICML Guy Tennenholtz, Nadav Merlis, Lior Shani, Martin Mladenov, Craig Boutilier
2023	J	`jnl`	Reinforcement Learning with History-Dependent Dynamic Contexts. CoRR Guy Tennenholtz, Nadav Merlis, Lior Shani, Martin Mladenov, Craig Boutilier
2022	A*	`conf`	Reinforcement Learning with a Terminator. NeurIPS Guy Tennenholtz, Nadav Merlis, Lior Shani, Shie Mannor, Uri Shalit, Gal Chechik, Assaf Hallak, Gal Dalal
2022	J	`jnl`	Reinforcement Learning with a Terminator. CoRR Guy Tennenholtz, Nadav Merlis, Lior Shani, Shie Mannor, Uri Shalit, Gal Chechik, Assaf Hallak, Gal Dalal
2021	A*	`conf`	Confidence-Budget Matching for Sequential Budgeted Learning. ICML Yonathan Efroni, Nadav Merlis, Aadirupa Saha, Shie Mannor
2021	J	`jnl`	Confidence-Budget Matching for Sequential Budgeted Learning. CoRR Yonathan Efroni, Nadav Merlis, Aadirupa Saha, Shie Mannor
2021	J	`jnl`	Dare not to Ask: Problem-Dependent Guarantees for Budgeted Bandits. CoRR Nadav Merlis, Yonathan Efroni, Shie Mannor
2021	A*	`conf`	Ensemble Bootstrapping for Q-Learning. ICML Oren Peer, Chen Tessler, Nadav Merlis, Ron Meir
2021	J	`jnl`	Ensemble Bootstrapping for Q-Learning. CoRR Oren Peer, Chen Tessler, Nadav Merlis, Ron Meir
2021	A*	`conf`	Lenient Regret for Multi-Armed Bandits. AAAI Nadav Merlis, Shie Mannor
2021	A*	`conf`	Reinforcement Learning with Trajectory Feedback. AAAI Yonathan Efroni, Nadav Merlis, Shie Mannor
2020	J	`jnl`	Lenient Regret for Multi-Armed Bandits. CoRR Nadav Merlis, Shie Mannor
2020	J	`jnl`	Reinforcement Learning with Trajectory Feedback. CoRR Yonathan Efroni, Nadav Merlis, Shie Mannor
2020	A*	`conf`	Tight Lower Bounds for Combinatorial Multi-Armed Bandits. COLT Nadav Merlis, Shie Mannor
2020	J	`jnl`	Tight Lower Bounds for Combinatorial Multi-Armed Bandits. CoRR Nadav Merlis, Shie Mannor
2019	A*	`conf`	Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem. COLT Nadav Merlis, Shie Mannor
2019	J	`jnl`	Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem. CoRR Nadav Merlis, Shie Mannor
2019	J	`jnl`	Stabilizing Off-Policy Reinforcement Learning with Conservative Policy Gradients. CoRR Chen Tessler, Nadav Merlis, Shie Mannor
2019	A*	`conf`	Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies. NeurIPS Yonathan Efroni, Nadav Merlis, Mohammad Ghavamzadeh, Shie Mannor
2019	J	`jnl`	Tight Regret Bounds for Model-Based Reinforcement Learning with Greedy Policies. CoRR Yonathan Efroni, Nadav Merlis, Mohammad Ghavamzadeh, Shie Mannor
2018	A*	`conf`	Learn What Not to Learn: Action Elimination with Deep Reinforcement Learning. NeurIPS Tom Zahavy, Matan Haroush, Nadav Merlis, Daniel J. Mankowitz, Shie Mannor
2018	J	`jnl`	Learn What Not to Learn: Action Elimination with Deep Reinforcement Learning. CoRR Tom Zahavy, Matan Haroush, Nadav Merlis, Daniel J. Mankowitz, Shie Mannor