Saved in:
| Main Authors: | Barik, Adarsh, Krishna, Anand, Tan, Vincent Y. F. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.04733 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization
by: Barik, Adarsh, et al.
Published: (2024)
by: Barik, Adarsh, et al.
Published: (2024)
p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024)
by: Krishna, Anand, et al.
Published: (2024)
Parameter-free Algorithms for the Stochastically Extended Adversarial Model
by: Wang, Shuche, et al.
Published: (2025)
by: Wang, Shuche, et al.
Published: (2025)
Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)
by: Wang, Shuche, et al.
Published: (2026)
A Novel Plug-and-Play Approach for Adversarially Robust Generalization
by: Maurya, Deepak, et al.
Published: (2022)
by: Maurya, Deepak, et al.
Published: (2022)
Best Arm Identification with Minimal Regret
by: Yang, Junwen, et al.
Published: (2024)
by: Yang, Junwen, et al.
Published: (2024)
Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)
by: Bian, Jie, et al.
Published: (2024)
A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent
by: Wang, Shuche, et al.
Published: (2024)
by: Wang, Shuche, et al.
Published: (2024)
On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)
by: Hou, Yunlong, et al.
Published: (2026)
Global Resolution: Optimal Multi-Draft Speculative Sampling via Convex Minimization
by: Thomas, Rahul Krishna, et al.
Published: (2025)
by: Thomas, Rahul Krishna, et al.
Published: (2025)
Quantum-Enhanced Neural Contextual Bandit Algorithms
by: Huang, Yuqi, et al.
Published: (2026)
by: Huang, Yuqi, et al.
Published: (2026)
Robust Gradient Descent for Phase Retrieval
by: Buna, Alex, et al.
Published: (2024)
by: Buna, Alex, et al.
Published: (2024)
An Efficient Alternating Algorithm for ReLU-based Symmetric Matrix Decomposition
by: Wang, Qingsong
Published: (2025)
by: Wang, Qingsong
Published: (2025)
Adversarial Combinatorial Bandits with Switching Costs
by: Dong, Yanyan, et al.
Published: (2024)
by: Dong, Yanyan, et al.
Published: (2024)
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation
by: Song, Zhao, et al.
Published: (2023)
by: Song, Zhao, et al.
Published: (2023)
Sample Efficient Demonstration Selection for In-Context Learning
by: Purohit, Kiran, et al.
Published: (2025)
by: Purohit, Kiran, et al.
Published: (2025)
Simple Alternating Minimization Provably Solves Complete Dictionary Learning
by: Liang, Geyu, et al.
Published: (2022)
by: Liang, Geyu, et al.
Published: (2022)
Smoothed Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2024)
by: Zheng, Zhong, et al.
Published: (2024)
A Geometry-Aware Efficient Algorithm for Compositional Entropic Risk Minimization
by: Wei, Xiyuan, et al.
Published: (2026)
by: Wei, Xiyuan, et al.
Published: (2026)
A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval
by: Zheng, Zhong, et al.
Published: (2023)
by: Zheng, Zhong, et al.
Published: (2023)
Robust Federated Finetuning of Foundation Models via Alternating Minimization of LoRA
by: Chen, Shuangyi, et al.
Published: (2024)
by: Chen, Shuangyi, et al.
Published: (2024)
A Simpler Alternative to Variational Regularized Counterfactual Risk Minimization
by: Bakker, Hua Chang, et al.
Published: (2024)
by: Bakker, Hua Chang, et al.
Published: (2024)
Stochastic Bandits for Egalitarian Assignment
by: Lim, Eugene, et al.
Published: (2024)
by: Lim, Eugene, et al.
Published: (2024)
A Comprehensive Benchmarking Platform for Deep Generative Models in Molecular Design
by: Singh, Adarsh
Published: (2025)
by: Singh, Adarsh
Published: (2025)
Robust Phase Retrieval by Alternating Minimization
by: Kim, Seonho, et al.
Published: (2024)
by: Kim, Seonho, et al.
Published: (2024)
Latent Algorithmic Structure Precedes Grokking: A Mechanistic Study of ReLU MLPs on Modular Arithmetic
by: Swaroop, Anand
Published: (2026)
by: Swaroop, Anand
Published: (2026)
Efficient and Adaptive Posterior Sampling Algorithms for Bandits
by: Hu, Bingshan, et al.
Published: (2024)
by: Hu, Bingshan, et al.
Published: (2024)
On the Convergence of (Stochastic) Gradient Descent for Kolmogorov--Arnold Networks
by: Gao, Yihang, et al.
Published: (2024)
by: Gao, Yihang, et al.
Published: (2024)
Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget
by: Bian, Jie, et al.
Published: (2025)
by: Bian, Jie, et al.
Published: (2025)
A Finite-Sample Analysis of an Actor-Critic Algorithm for Mean-Variance Optimization in a Discounted MDP
by: Sangadi, Tejaram, et al.
Published: (2024)
by: Sangadi, Tejaram, et al.
Published: (2024)
EXPLORA: Efficient Exemplar Subset Selection for Complex Reasoning
by: Purohit, Kiran, et al.
Published: (2024)
by: Purohit, Kiran, et al.
Published: (2024)
PreLoRA: Hybrid Pre-training of Vision Transformers with Full Training and Low-Rank Adapters
by: Thapa, Krishu K, et al.
Published: (2025)
by: Thapa, Krishu K, et al.
Published: (2025)
Quantum Temporal Fusion Transformer
by: Barik, Krishnakanta, et al.
Published: (2025)
by: Barik, Krishnakanta, et al.
Published: (2025)
Retrieval-Guided Reinforcement Learning for Boolean Circuit Minimization
by: Chowdhury, Animesh Basak, et al.
Published: (2024)
by: Chowdhury, Animesh Basak, et al.
Published: (2024)
Pruning Minimal Reasoning Graphs for Efficient Retrieval-Augmented Generation
by: Wang, Ning, et al.
Published: (2026)
by: Wang, Ning, et al.
Published: (2026)
Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks
by: Xu, Yinglun, et al.
Published: (2024)
by: Xu, Yinglun, et al.
Published: (2024)
From Search To Sampling: Generative Models For Robust Algorithmic Recourse
by: Garg, Prateek, et al.
Published: (2025)
by: Garg, Prateek, et al.
Published: (2025)
COLA: Continual Learning via Autoencoder Retrieval of Adapters
by: Mandivarapu, Jaya Krishna
Published: (2025)
by: Mandivarapu, Jaya Krishna
Published: (2025)
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
by: Gu, Yuzhou, et al.
Published: (2023)
by: Gu, Yuzhou, et al.
Published: (2023)
An Accelerated Alternating Partial Bregman Algorithm for ReLU-based Matrix Decomposition
by: Wang, Qingsong, et al.
Published: (2025)
by: Wang, Qingsong, et al.
Published: (2025)
Similar Items
-
LEARN: An Invex Loss for Outlier Oblivious Robust Online Optimization
by: Barik, Adarsh, et al.
Published: (2024) -
p-Mean Regret for Stochastic Bandits
by: Krishna, Anand, et al.
Published: (2024) -
Parameter-free Algorithms for the Stochastically Extended Adversarial Model
by: Wang, Shuche, et al.
Published: (2025) -
Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026) -
A Novel Plug-and-Play Approach for Adversarially Robust Generalization
by: Maurya, Deepak, et al.
Published: (2022)