adaptive algorithm

ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits AISTATS 2023 An Adaptive Algorithm for Learning with Unknown Distribution Drift NeurIPS 2023 Balancing Risk and Reward: A Batched-Bandit Strategy for Automated Phased Release NeurIPS 2023 Characterization of Overfitting in Robust Multiclass Classification NeurIPS 2023 Combinatorial Group Testing with Selfish Agents NeurIPS 2023 Faster Adaptive Federated Learning AAAI 2023 Minimizing Dynamic Regret on Geodesic Metric Spaces COLT 2023 Online Adaptive Policy Selection in Time-Varying Systems: No-Regret via Contractive Perturbations NeurIPS 2023 Representation with Incomplete Votes AAAI 2023 Sorting with Predictions NeurIPS 2023 When Can We Track Significant Preference Shifts in Dueling Bandits? NeurIPS 2023 Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence AAAI 2022 Adaptively Exploiting d-Separators with Causal Bandits NeurIPS 2022 Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory AISTATS 2022 Asymptotic Study of Stochastic Adaptive Algorithms in Non-convex Landscape JMLR 2022 Faster Rates, Adaptive Algorithms, and Finite-Time Bounds for Linear Composition Optimization and Gradient TD Learning AISTATS 2022 Learning Low Degree Hypergraphs COLT 2022 Learning Rates as a Function of Batch Size: A Random Matrix Theory Approach to Neural Network Training JMLR 2022 Multi-Objective Deep Learning with Adaptive Reference Vectors NeurIPS 2022 Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization NeurIPS 2022 Online Control of the False Discovery Rate under "Decision Deadlines" AISTATS 2022 Optimistic Tree Searches for Combinatorial Black-Box Optimization NeurIPS 2022 Adapting to function difficulty and growth conditions in private optimization NeurIPS 2021 Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback AAAI 2021 Bandit Phase Retrieval NeurIPS 2021