Akshay Krishnamurthy

Orcid: 0000-0002-5738-2383

According to our database1, Akshay Krishnamurthy authored at least 109 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Model-Free Representation Learning and Exploration in Low-Rank MDPs.
J. Mach. Learn. Res., 2024

Robust Dynamic Assortment Optimization in the Presence of Outlier Customers.
Oper. Res., 2024

Reinforcement Learning under Latent Dynamics: Toward Statistical and Algorithmic Modularity.
CoRR, 2024

Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization.
CoRR, 2024

Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics.
CoRR, 2024

Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHF.
CoRR, 2024

Can large language models explore in-context?
CoRR, 2024

Scalable Online Exploration via Coverability.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Rich-Observation Reinforcement Learning with Continuous Latent Dynamics.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Mitigating Covariate Shift in Misspecified Regression with Applications to Reinforcement Learning.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

Oracle-Efficient Pessimism: Offline Policy Optimization In Contextual Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Contextual Search in the Presence of Adversarial Corruptions.
Oper. Res., July, 2023

Guaranteed Discovery of Control-Endogenous Latent States with Multi-Step Inverse Models.
Trans. Mach. Learn. Res., 2023

A Complete Characterization of Linear Estimators for Offline Policy Evaluation.
J. Mach. Learn. Res., 2023

Exposing Attention Glitches with Flip-Flop Language Modeling.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Statistical Learning under Heterogenous Distribution Shift.
Proceedings of the International Conference on Machine Learning, 2023

Streaming Active Learning with Deep Neural Networks.
Proceedings of the International Conference on Machine Learning, 2023

Transformers Learn Shortcuts to Automata.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Hybrid RL: Using both offline and online data can make RL efficient.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Learning Hidden Markov Models Using Conditional Samples.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Guaranteed Discovery of Controllable Latent States with Multi-Step Inverse Models.
CoRR, 2022

A Sharp Characterization of Linear Estimators for Offline Policy Evaluation.
CoRR, 2022

On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Understanding Contrastive Learning Requires Incorporating Inductive Biases.
Proceedings of the International Conference on Machine Learning, 2022

Universal and data-adaptive algorithms for model selection in linear contextual bandits.
Proceedings of the International Conference on Machine Learning, 2022

Sparsity in Partially Controllable Linear Systems.
Proceedings of the International Conference on Machine Learning, 2022

Provable Reinforcement Learning with a Short-Term Memory.
Proceedings of the International Conference on Machine Learning, 2022

Provably Filtering Exogenous Distractors using Multistep Inverse Dynamics.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Anti-Concentrated Confidence Bonuses For Scalable Exploration.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximation.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Sample-Efficient Reinforcement Learning in the Presence of Exogenous Information.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Investigating the Role of Negatives in Contrastive Representation Learning.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Trace Reconstruction: Generalized and Parameterized.
IEEE Trans. Inf. Theory, 2021

Contrastive Estimation Reveals Topic Posterior Information to Linear Models.
J. Mach. Learn. Res., 2021

Provable RL with Exogenous Distractors via Multistep Inverse Dynamics.
CoRR, 2021

Contextual search in the presence of irrational agents.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Bayesian decision-making under misspecified priors with applications to meta-learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Gone Fishing: Neural Active Learning with Fisher Embeddings.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Optimism in Reinforcement Learning with Generalized Linear Function Approximation.
Proceedings of the 9th International Conference on Learning Representations, 2021

Contrastive learning, multi-view redundancy, and linear models.
Proceedings of the Algorithmic Learning Theory, 2021

2020
Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting.
J. Mach. Learn. Res., 2020

Corrupted Multidimensional Binary Search: Learning in the Presence of Irrational Agents.
CoRR, 2020

Learning the Linear Quadratic Regulator from Nonlinear Observations.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Efficient Contextual Bandits with Continuous Actions.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Information Theoretic Regret Bounds for Online Nonlinear Control.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Sample-Efficient Reinforcement Learning of Undercomplete POMDPs.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Provably adaptive reinforcement learning in metric spaces.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Private Reinforcement Learning with PAC and Regret Guarantees.
Proceedings of the 37th International Conference on Machine Learning, 2020

Adaptive Estimator Selection for Off-Policy Evaluation.
Proceedings of the 37th International Conference on Machine Learning, 2020

Doubly robust off-policy evaluation with shrinkage.
Proceedings of the 37th International Conference on Machine Learning, 2020

Kinematic State Abstraction and Provably Efficient Rich-Observation Reinforcement Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Reward-Free Exploration for Reinforcement Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Deep Batch Active Learning by Diverse, Uncertain Gradient Lower Bounds.
Proceedings of the 8th International Conference on Learning Representations, 2020

Open Problem: Model Selection for Contextual Bandits.
Proceedings of the Conference on Learning Theory, 2020

Algebraic and Analytic Approaches for Parameter Learning in Mixture Models.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Active Learning for Cost-Sensitive Classification.
J. Mach. Learn. Res., 2019

Sample Complexity of Learning Mixtures of Sparse Linear Regressions.
CoRR, 2019

Sample Complexity of Learning Mixture of Sparse Linear Regressions.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Model Selection for Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Scalable Hierarchical Clustering with Tree Grafting.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

Myopic Posterior Sampling for Adaptive Goal Oriented Design of Experiments.
Proceedings of the 36th International Conference on Machine Learning, 2019

Provably efficient RL with Rich Observations via Latent State Decoding.
Proceedings of the 36th International Conference on Machine Learning, 2019

Model-based RL in Contextual Decision Processes: PAC bounds and Exponential Improvements over Model-free Approaches.
Proceedings of the Conference on Learning Theory, 2019

Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm.
Proceedings of the Conference on Learning Theory, 2019

2018
Extreme Compressive Sampling for Covariance Estimation.
IEEE Trans. Inf. Theory, 2018

Model-Based Reinforcement Learning in Contextual Decision Processes.
CoRR, 2018

Myopic Bayesian Design of Experiments via Posterior Sampling and Probabilistic Programming.
CoRR, 2018

On Polynomial Time PAC Reinforcement Learning with Rich Observations.
CoRR, 2018

Contextual bandits with surrogate losses: Margin bounds and efficient algorithms.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

On Oracle-Efficient PAC RL with Rich Observations.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Semiparametric Contextual Bandits.
Proceedings of the 35th International Conference on Machine Learning, 2018

Go for a Walk and Arrive at the Answer: Reasoning Over Paths in Knowledge Bases using Reinforcement Learning.
Proceedings of the 6th International Conference on Learning Representations, 2018

Parallelised Bayesian Optimisation via Thompson Sampling.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Disagreement-based combinatorial pure exploration: Efficient algorithms and an analysis with localization.
CoRR, 2017

An Online Hierarchical Algorithm for Extreme Clustering.
CoRR, 2017

Asynchronous Parallel Bayesian Optimisation via Thompson Sampling.
CoRR, 2017

Off-policy evaluation for slate recommendation.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

A Hierarchical Algorithm for Extreme Clustering.
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017

Contextual Decision Processes with low Bellman rank are PAC-Learnable.
Proceedings of the 34th International Conference on Machine Learning, 2017

Open Problem: First-Order Regret Bounds for Contextual Bandits.
Proceedings of the 30th Conference on Learning Theory, 2017

Go for a Walk and Arrive at the Answer: Reasoning Over Knowledge Bases with Reinforcement Learning.
Proceedings of the 6th Workshop on Automated Knowledge Base Construction, 2017

2016
Contextual-MDPs for PAC-Reinforcement Learning with Rich Observations.
CoRR, 2016

Exploratory Gradient Boosting for Reinforcement Learning in Complex Domains.
CoRR, 2016

Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

PAC Reinforcement Learning with Rich Observations.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Contextual semibandits via supervised learning oracles.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Minimax structured normal means inference.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient Algorithms for Adversarial Contextual Learning.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Efficient Contextual Semi-Bandit Learning.
CoRR, 2015

Minimaxity in Structured Normal Means Inference.
CoRR, 2015

Nonparametric von Mises Estimators for Entropies, Divergences and Mutual Informations.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Learning to Search Better than Your Teacher.
Proceedings of the 32nd International Conference on Machine Learning, 2015

On Estimating L22 Divergence.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
On the Power of Adaptivity in Matrix Completion and Approximation.
CoRR, 2014

Influence Functions for Machine Learning: Nonparametric Estimators for Entropies, Divergences and Mutual Informations.
CoRR, 2014

Nonparametric Estimation of Renyi Divergence and Friends.
Proceedings of the 31th International Conference on Machine Learning, 2014

Subspace learning from extremely compressed measurements.
Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014

2013
Near-optimal Anomaly Detection in Graphs using Lovasz Extended Scan Statistic.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Low-Rank Matrix and Tensor Completion via Adaptive Sampling.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Detecting Activations over Graphs using Spanning Tree Wavelet Bases.
Proceedings of the Sixteenth International Conference on Artificial Intelligence and Statistics, 2013

Recovering graph-structured activations using adaptive compressive measurements.
Proceedings of the 2013 Asilomar Conference on Signals, 2013

2012
Robust multi-source network tomography using selective probes.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

Efficient Active Algorithms for Hierarchical Clustering.
Proceedings of the 29th International Conference on Machine Learning, 2012

2011
Noise Thresholds for Spectral Clustering.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Fine-grained privilege separation for web applications.
Proceedings of the 19th International Conference on World Wide Web, 2010


  Loading...