conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Learning Theory

5,334 papers

Papers per year

17
66
123
466
307
'05
'10
'15
'20
'25

Papers

Provably Efficient Model-Free Algorithms for Non-stationary CMDPs AISTATS 2023
On Model Selection Consistency of Lasso for High-Dimensional Ising Models AISTATS 2023
Strong Lottery Ticket Hypothesis with $\varepsilon$–perturbation AISTATS 2023
Flexible and Efficient Contextual Bandits with Heterogeneous Treatment Effect Oracles AISTATS 2023
Identification of Blackwell Optimal Policies for Deterministic MDPs AISTATS 2023
Optimal Algorithms for Latent Bandits with Cluster Structure AISTATS 2023
Improved Bound on Generalization Error of Compressed KNN Estimator AISTATS 2023
One Arrow, Two Kills: A Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits AISTATS 2023
On the Consistency Rate of Decision Tree Learning Algorithms AISTATS 2023
On the Complexity of Representation Learning in Contextual Linear Bandits AISTATS 2023
Revisiting Weighted Strategy for Non-stationary Parametric Bandits AISTATS 2023
Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits AISTATS 2023
PAC-Bayesian Learning of Optimization Algorithms AISTATS 2023
Tighter PAC-Bayes Generalisation Bounds by Leveraging Example Difficulty AISTATS 2023
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference AISTATS 2023
How Does Pseudo-Labeling Affect the Generalization Error of the Semi-Supervised Gibbs Algorithm? AISTATS 2023
Tight Regret and Complexity Bounds for Thompson Sampling via Langevin Monte Carlo AISTATS 2023
Nonstochastic Contextual Combinatorial Bandits AISTATS 2023
Second Order Path Variationals in Non-Stationary Online Learning AISTATS 2023
Pricing against a Budget and ROI Constrained Buyer AISTATS 2023
Incentive-aware Contextual Pricing with Non-parametric Market Noise AISTATS 2023
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games AISTATS 2023
Improved Sample Complexity Bounds for Distributionally Robust Reinforcement Learning AISTATS 2023
Learning to Generalize Provably in Learning to Optimize AISTATS 2023
Theory and Algorithm for Batch Distribution Drift Problems AISTATS 2023