Neural Information Processing Systems Foundation, Inc. (NeurIPS)

  • Near-Optimal Randomized Exploration for Tabular Markov Decision Processes

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Randomized Exploration for Tabular Markov Decision Processes

    Zhihan Xiong, Ruoqi Shen, Qiwen Cui, Maryam Fazel, Simon Du p6358-6371 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Near-Optimal Regret Bounds for Multi-Batch Reinforcement Learning

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Regret Bounds for Multi-Batch Reinforcement Learning

    Zihan Zhang, Yuhang Jiang, Yuan Zhou, Xiangyang Ji p24586-24596 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback

    Tiancheng Jin, Tal Lancewicki, Haipeng Luo, Yishay Mansour, Aviv Rosenberg p33469-33481 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Regret-Queue Length Tradeoff in Online Learning for Two-Sided Markets

    Zixian Yang, Sushil Varma, Lei Ying p161770-161806 from Advances in Neural Information Processing Systems 38
    Our Price: $0.00
  • Near-Optimal Sample Complexity Bounds for Constrained MDPs

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Sample Complexity Bounds for Constrained MDPs

    Sharan Vaswani, Lin Yang, Csaba Szepesvari p3110-3122 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Near-Optimal Sample Complexity for Online Constrained MDPs

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Sample Complexity for Online Constrained MDPs

    Chang Liu, Yunfan Li, Lin Yang p53224-53254 from Advances in Neural Information Processing Systems 38
    Our Price: $0.00
  • Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimal Streaming Heavy-Tailed Statistical Estimation with Clipped SGD

    Aniket Das, Dheeraj Nagaraj, Soumyabrata Pal, Arun Suggala, Prateek Varshney p8834-8900 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Near-Optimality of Contrastive Divergence Algorithms

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Near-Optimality of Contrastive Divergence Algorithms

    Pierre Glaser, Kevin Han Huang, Arthur Gretton p91036-91090 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Nearest Neighbor Speculative Decoding for LLM Generation and Attribution

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearest Neighbor Speculative Decoding for LLM Generation and Attribution

    Minghan Li, Xilun Chen, Ari Holtzman, Beidi Chen, Jimmy Lin, Wen-Tau Yih, Xi Lin p80987-81015 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Nearest Neighbour with Bandit Feedback

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearest Neighbour with Bandit Feedback

    Stephen Pasteris, Chris Hicks, Vasilios Mavroudis p20320-20351 from Advances in Neural Information Processing Systems 36
    Our Price: $0.00
  • Nearly Dimension-Independent Convergence of Mean-Field Black-Box Variational Inference

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Dimension-Independent Convergence of Mean-Field Black-Box Variational Inference

    Kyurae Kim, Yian Ma, Trevor Campbell, Jacob Gardner p130415-130460 from Advances in Neural Information Processing Systems 38
    Our Price: $0.00
  • Nearly Minimax Optimal Regret for Multinomial Logistic Bandit

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Minimax Optimal Regret for Multinomial Logistic Bandit

    Joongkyu Lee, Min-Hwan Oh p109003-109065 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Nearly Minimax Optimal Submodular Maximization with Bandit Feedback

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Minimax Optimal Submodular Maximization with Bandit Feedback

    Artin Tajdini, Lalit Jain, Kevin Jamieson p96254-96281 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions

    Jiafan He, Dongruo Zhou, Tong Zhang, Quanquan Gu p34614-34625 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Nearly Optimal Approximation of Matrix Functions by the Lanczos Method

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Optimal Approximation of Matrix Functions by the Lanczos Method

    Noah Amsel, Tyler Chen, Anne Greenbaum, Cameron Musco, Christopher Musco p139823-139853 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Nearly Optimal Best-Of-Both-Worlds Algorithms for Online Learning with Feedback Graphs

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Optimal Best-Of-Both-Worlds Algorithms for Online Learning with Feedback Graphs

    Shinji Ito, Taira Tsuchiya, Junya Honda p28631-28643 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Nearly Optimal Bounds for Cyclic Forgetting

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Optimal Bounds for Cyclic Forgetting

    William Swartworth, Deanna Needell, Rachel Ward, Mark Kong, Halyun Jeong p68197-68206 from Advances in Neural Information Processing Systems 36
    Our Price: $0.00
  • Nearly Optimal VC-Dimension and Pseudo-Dimension Bounds for Deep Neural Network Derivatives

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Optimal VC-Dimension and Pseudo-Dimension Bounds for Deep Neural Network Derivatives

    Yahong Yang, Haizhao Yang, Yang Xiang p21721-21756 from Advances in Neural Information Processing Systems 36
    Our Price: $0.00
  • Nearly Tight Black-Box Auditing of Differentially Private Machine Learning

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Tight Black-Box Auditing of Differentially Private Machine Learning

    Meenatchi Sundaram Muthu Selva Annamalai, Emiliano De Cristofaro p131482-131502 from Advances in Neural Information Processing Systems 37
    Our Price: $0.00
  • Nearly Tight Bounds For Differentially Private Multiway Cut

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly Tight Bounds For Differentially Private Multiway Cut

    Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka p24947-24965 from Advances in Neural Information Processing Systems 36
    Our Price: $0.00
  • Nearly-Linear Time and Massively Parallel Algorithms for $k$-anonymity

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly-Linear Time and Massively Parallel Algorithms for $k$-anonymity

    Kevin Aydin, Honghao Lin, David Woodruff, Peilin Zhong p157386-157407 from Advances in Neural Information Processing Systems 38
    Our Price: $0.00
  • Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor

    Maryam Aliakbarpour, Zhan Shi, Ria Stevens, Vincent Wang p77534-77570 from Advances in Neural Information Processing Systems 38
    Our Price: $0.00
  • Nearly-Optimal Bounds for Testing Histogram Distributions

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Nearly-Optimal Bounds for Testing Histogram Distributions

    Clément L Canonne, Ilias Diakonikolas, Daniel Kane, Sihan Liu p31599-31611 from Advances in Neural Information Processing Systems 35
    Our Price: $0.00
  • Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming

    Neural Information Processing Systems Foundation, Inc. (NeurIPS)

    Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming

    Jacobus Van Der Linden, Mathijs De Weerdt, Emir Demirovic p9173-9212 from Advances in Neural Information Processing Systems 36
    Our Price: $0.00