• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 76 matches

• 2024
• 
  Odalric-Ambrym Maillard, Mohammad Sadegh Talebi:
  How to Shrink Confidence Sets for Many Equivalent Discrete Distributions? CoRR abs/2407.15662 (2024)
• 
  Ahana Deb, Roberto Cipollone, Anders Jonsson, Alessandro Ronca, Mohammad Sadegh Talebi:
  Tractable Offline Learning of Regular Decision Processes. CoRR abs/2409.02747 (2024)
• 2023
• 
  Yunlian Lyu, Aymeric Côme, Yijie Zhang, Mohammad Sadegh Talebi:
  Scaling Up Q-Learning via Exploiting State-Action Equivalence. Entropy 25(4): 584 (2023)
• 
  Yunlian Lyu, Mohammad Sadegh Talebi:
  Double Graph Attention Networks for Visual Semantic Navigation. Neural Process. Lett. 55(7): 9019-9040 (2023)
• 
  Hassan Saber, Fabien Pesquerel, Odalric-Ambrym Maillard, Mohammad Sadegh Talebi:
  Logarithmic regret in communicating MDPs: Leveraging known dynamics with bandits. ACML 2023: 1167-1182
• 
  Hippolyte Bourel, Anders Jonsson, Odalric-Ambrym Maillard, Mohammad Sadegh Talebi:
  Exploration in Reward Machines with Low Regret. AISTATS 2023: 4114-4146
• 
  Roberto Cipollone, Anders Jonsson, Alessandro Ronca, Mohammad Sadegh Talebi:
  Provably Efficient Offline Reinforcement Learning in Regular Decision Processes. NeurIPS 2023
• 2022
• 
  Nikolaos Nomikos, Mohammad Sadegh Talebi, Themistoklis Charalambous, Risto Wichman:
  Bandit-Based Power Control in Full-Duplex Cooperative Relay Networks With Strict-Sense Stationary and Non-Stationary Wireless Communication Channels. IEEE Open J. Commun. Soc. 3: 366-378 (2022)
• 
  Konstantinos Skitsas, Ioannis G. Papageorgiou, Mohammad Sadegh Talebi, Vasiliki Kantere, Michael N. Katehakis, Panagiotis Karras:
  SIFTER: Space-Efficient Value Iteration for Finite-Horizon MDPs. Proc. VLDB Endow. 16(1): 90-98 (2022)
• 2021
• 
  Mohammad Sadegh Talebi, Anders Jonsson, Odalric Maillard:
  Improved Exploration in Factored Average-Reward MDPs. AISTATS 2021: 3988-3996
• 2020
• 
  Hippolyte Bourel, Odalric Maillard, Mohammad Sadegh Talebi:
  Tightening Exploration in Upper Confidence Reinforcement Learning. ICML 2020: 1056-1066
• 
  Nikolaos Nomikos, Sadegh Talebi, Risto Wichman, Themistoklis Charalambous:
  Bandit-Based Relay Selection in Cooperative Networks Over Unknown Stationary Channels. MLSP 2020: 1-6
• 
  Lin Yang, Mohammad Hassan Hajiesmaili, Mohammad Sadegh Talebi, John C. S. Lui, Wing Shing Wong:
  Adversarial Bandits with Corruptions: Regret Lower Bound and No-regret Algorithm. NeurIPS 2020
• 
  Hippolyte Bourel, Odalric-Ambrym Maillard, Mohammad Sadegh Talebi:
  Tightening Exploration in Upper Confidence Reinforcement Learning. CoRR abs/2004.09656 (2020)
• 
  Mohammad Sadegh Talebi, Anders Jonsson, Odalric-Ambrym Maillard:
  Improved Exploration in Factored Average-Reward MDPs. CoRR abs/2009.04575 (2020)
• 2019
• 
  Mahsa Asadi, Mohammad Sadegh Talebi, Hippolyte Bourel, Odalric-Ambrym Maillard:
  Model-Based Reinforcement Learning Exploiting State-Action Equivalence. ACML 2019: 204-219
• 
  Mohammad Sadegh Talebi, Odalric-Ambrym Maillard:
  Learning Multiple Markov Chains via Adaptive Allocation. NeurIPS 2019: 13322-13332
• 
  M. Sadegh Talebi, Odalric-Ambrym Maillard:
  Learning Multiple Markov Chains via Adaptive Allocation. CoRR abs/1905.11128 (2019)
• 
  Mahsa Asadi, Mohammad Sadegh Talebi, Hippolyte Bourel, Odalric-Ambrym Maillard:
  Model-Based Reinforcement Learning Exploiting State-Action Equivalence. CoRR abs/1910.04077 (2019)
• 2018
• 
  Mohammad Sadegh Talebi, Alexandre Proutière:
  Learning Proportionally Fair Allocations with Low Regret. Proc. ACM Meas. Anal. Comput. Syst. 2(2): 36:1-36:31 (2018)
• 
  Mohammad Sadegh Talebi, Zhenhua Zou, Richard Combes, Alexandre Proutière, Mikael Johansson:
  Stochastic Online Shortest Path Routing: The Value of Feedback. IEEE Trans. Autom. Control. 63(4): 915-930 (2018)
• 
  Mohammad Hassan Hajiesmaili, Mohammad Sadegh Talebi, Ahmad Khonsari:
  Multiperiod Network Rate Allocation With End-to-End Delay Constraints. IEEE Trans. Control. Netw. Syst. 5(3): 1087-1097 (2018)
• 
  Mohammad Sadegh Talebi, Odalric-Ambrym Maillard:
  Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs. ALT 2018: 770-805
• 
  Bahram Alinia, Mohammad Sadegh Talebi, Mohammad Hassan Hajiesmaili, Ali Yekkehkhany, Noël Crespi:
  Competitive Online Scheduling Algorithms with Applications in Deadline-Constrained EV Charging. IWQoS 2018: 1-10
• 
  Mohammad Sadegh Talebi, Alexandre Proutière:
  Learning Proportionally Fair Allocations with Low Regret. SIGMETRICS (Abstracts) 2018: 50-52
• 
  Mohammad Sadegh Talebi, Odalric-Ambrym Maillard:
  Variance-Aware Regret Bounds for Undiscounted Reinforcement Learning in MDPs. CoRR abs/1803.01626 (2018)
• 2017
• 
  Mohammad Sadegh Talebi Mazraeh Shahi:
  Minimizing Regret in Combinatorial Bandits and Reinforcement Learning. Royal Institute of Technology, Stockholm, Sweden, 2017
• 
  Gholam Reza Jahanshahloo, Bahram Talebian, F. Hosseinzadeh Lotfi, Jafar Sadeghi:
  Finding a solution for Multi-Objective Linear Fractional Programming problem based on goal programming and Data Envelopment Analysis. RAIRO Oper. Res. 51(1): 199-210 (2017)
• 2016
• 
  Mohammad Sadegh Talebi, Alexandre Proutière:
  An Optimal Algorithm for Stochastic Matroid Bandit Optimization. AAMAS 2016: 548-556
• 2015
• 
  Mohammad Hassan Hajiesmaili, Mohammad Sadegh Talebi, Ahmad Khonsari:
  Utility-optimal dynamic rate allocation under average end-to-end delay requirements. CDC 2015: 4842-4847

skipping 46 more matches