Adarsh Barik
7 papers · 2019–2026 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Bronze
🏃
Academic Marathon · Sprint
🌉
Interdisciplinary Bridge · Bronze
🗺️
Taxonomy Completionist
(27)
Venues
Top co-authors
Research topics
Keywords
regret bound
(3)
sparse regression
(3)
invex relaxation
(2)
online advertising
(1)
sample complexity
(1)
dynamic regret
(1)
feature selection
(1)
low-rank matrix
(1)
lasso regression
(1)
high-dimensional regression
(1)
sequential decision
(1)
online convex optimization
(1)
conditional probability
(1)
support recovery
(1)
outlier robustness
(1)
algorithm design
(1)
regret minimization
(1)
ucb algorithm
(1)
exact recovery
(1)
structure learning
(1)
Papers
Dynamic Regret in Outlier-Oblivious Online Optimization using Nonconvex Robust Losses
UAI 2026
Provable Guarantees For Robust Feature Selection in Sparse Linear Models in High-Dimensions
UAI 2026
p-Mean Regret for Stochastic Bandits
AAAI 2025
A Simple Unified Framework for High Dimensional Bandit Problems
ICML 2022
Sparse Mixed Linear Regression with Guarantees: Taming an Intractable Problem with Invex Relaxation
ICML 2022
Fair Sparse Regression with Clustering: An Invex Relaxation for a Combinatorial Problem
NeurIPS 2021
Learning Bayesian Networks with Low Rank Conditional Probability Tables
NeurIPS 2019