[edit]
Volume 237: International Conference on Algorithmic Learning Theory, 25-28 February 2024, La Jolla, California, USA
[edit]
Editors: Claire Vernade, Daniel Hsu
Algorithmic Learning Theory 2024: Preface
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1-2
[abs][Download PDF]
A Mechanism for Sample-Efficient In-Context Learning for Sparse Retrieval Tasks
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:3-46
[abs][Download PDF]
Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:47-73
[abs][Download PDF]
CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:74-124
[abs][Download PDF]
Semi-supervised Group DRO: Combating Sparsity with Unlabeled Data
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:125-160
[abs][Download PDF]
The Attractor of the Replicator Dynamic in Zero-Sum Games
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:161-178
[abs][Download PDF]
Tight Bounds for Local Glivenko-Cantelli
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:179-220
[abs][Download PDF]
Dueling Optimization with a Monotone Adversary
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:221-243
[abs][Download PDF]
Online Recommendations for Agents with Discounted Adaptive Preferences
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:244-281
[abs][Download PDF]
Distances for Markov Chains, and Their Differentiation
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:282-336
[abs][Download PDF]
Concentration of empirical barycenters in metric spaces
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:337-361
[abs][Download PDF]
Private PAC Learning May be Harder than Online Learning
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:362-389
[abs][Download PDF]
Not All Learnable Distribution Classes are Privately Learnable
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:390-401
[abs][Download PDF]
Learning bounded-degree polytrees with known skeleton
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:402-443
[abs][Download PDF]
Near-continuous time Reinforcement Learning for continuous state-action spaces
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:444-498
[abs][Download PDF]
Computation with Sequences of Assemblies in a Model of the Brain
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:499-504
[abs][Download PDF]
On the Sample Complexity of Two-Layer Networks: Lipschitz Vs. Element-Wise Lipschitz Activation
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:505-517
[abs][Download PDF]
RedEx: Beyond Fixed Representation Methods via Convex Optimization
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:518-543
[abs][Download PDF]
The Dimension of Self-Directed Learning
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:544-573
[abs][Download PDF]
Learning Hypertrees From Shortest Path Queries
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:574-589
[abs][Download PDF]
Partially Interpretable Models with Guarantees on Coverage and Accuracy
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:590-613
[abs][Download PDF]
Importance-Weighted Offline Learning Done Right
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:614-634
[abs][Download PDF]
The Impossibility of Parallelizing Boosting
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:635-653
[abs][Download PDF]
Agnostic Membership Query Learning with Nontrivial Savings: New Results and Techniques
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:654-682
[abs][Download PDF]
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:683-718
[abs][Download PDF]
Efficient Agnostic Learning with Average Smoothness
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:719-731
[abs][Download PDF]
Provable Accelerated Convergence of Nesterov’s Momentum for Deep ReLU Neural Networks
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:732-784
[abs][Download PDF]
Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:785-807
[abs][Download PDF]
Alternating minimization for generalized rank one matrix sensing: Sharp predictions from a random initialization
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:808-809
[abs][Download PDF]
On the Computational Benefit of Multimodal Learning
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:810-821
[abs][Download PDF]
Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithms
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:822-867
[abs][Download PDF]
Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:868-906
[abs][Download PDF]
Adversarial Contextual Bandits Go Kernelized
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:907-929
[abs][Download PDF]
Multiclass Learnability Does Not Imply Sample Compression
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:930-944
[abs][Download PDF]
Adversarial Online Collaborative Filtering
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:945-971
[abs][Download PDF]
The complexity of non-stationary reinforcement learning
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:972-996
[abs][Download PDF]
Multiclass Online Learnability under Bandit Feedback
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:997-1012
[abs][Download PDF]
Optimal Regret Bounds for Collaborative Learning in Bandits
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1013-1029
[abs][Download PDF]
A Polynomial Time, Pure Differentially Private Estimator for Binary Product Distributions
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1030-1054
[abs][Download PDF]
Tight bounds for maximum $\ell_1$-margin classifiers
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1055-1112
[abs][Download PDF]
Online Infinite-Dimensional Regression: Learning Linear Operators
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1113-1133
[abs][Download PDF]
Universal Representation of Permutation-Invariant Functions on Vectors and Tensors
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1134-1187
[abs][Download PDF]
Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1188-1207
[abs][Download PDF]
Improving Adaptive Online Learning Using Refined Discretization
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1208-1233
[abs][Download PDF]
Corruption-Robust Lipschitz Contextual Search
; Proceedings of The 35th International Conference on Algorithmic Learning Theory, PMLR 237:1234-1254
[abs][Download PDF]
subscribe via RSS