default search action
Ashwin Pananjady
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Guanyi Wang
, Mengqi Lou
Do Algorithms and Barriers for Sparse Principal Component Analysis Extend to Other Structured Settings? IEEE Trans. Signal Process. 72: 3187-3200 (2024) - [c20]Xuanzhou Chen, Austin Xu, Jingyan Wang, Ashwin Pananjady:
Learning the Eye of the Beholder: Statistical Modeling and Estimation for Personalized Color Perception. Allerton 2024: 1-8 - [c19]Kabir Aladin Verchand, Mengqi Lou, Ashwin Pananjady:
Alternating minimization for generalized rank one matrix sensing: Sharp predictions from a random initialization. ALT 2024: 808-809 - [i31]Mengqi Lou, Guy Bresler, Ashwin Pananjady:
Efficient reductions between some statistical models. CoRR abs/2402.07717 (2024) - [i30]Ashwin Pananjady, Vidya Muthukumar, Andrew Thangaraj:
Just Wing It: Optimal Estimation of Missing Mass in a Markovian Sequence. CoRR abs/2404.05819 (2024) - 2023
- [j11]Tianjiao Li
Accelerated and Instance-Optimal Policy Evaluation with Linear Function Approximation. SIAM J. Math. Data Sci. 5(1): 174-200 (2023) - [c18]Abhishek Dhawan, Cheng Mao, Ashwin Pananjady:
Sharp analysis of EM for learning mixtures of pairwise differences. COLT 2023: 4384-4428 - [c17]Austin Xu, Andrew D. McRae, Jingyan Wang, Mark A. Davenport, Ashwin Pananjady:
Perceptual adjustment queries and an inverted measurement paradigm for low-rank metric learning. NeurIPS 2023 - [c16]Jingyan Wang
Modeling and Correcting Bias in Sequential Evaluation. EC 2023: 1153 - [i29]Abhishek Dhawan, Cheng Mao, Ashwin Pananjady:
Sharp analysis of EM for learning mixtures of pairwise differences. CoRR abs/2302.10066 (2023) - [i28]Guanyi Wang, Mengqi Lou, Ashwin Pananjady:
Do algorithms and barriers for sparse principal component analysis extend to other structured settings? CoRR abs/2307.13535 (2023) - [i27]Austin Xu, Andrew D. McRae, Jingyan Wang, Mark A. Davenport, Ashwin Pananjady:
Perceptual adjustment queries and an inverted measurement paradigm for low-rank metric learning. CoRR abs/2309.04626 (2023) - 2022
- [j10]Avishek Ghosh
Max-Affine Regression: Parameter Estimation for Gaussian Designs. IEEE Trans. Inf. Theory 68(3): 1851-1885 (2022) - [c15]Wenshuo Guo, Kumar Krishna Agrawal, Aditya Grover, Vidya K. Muthukumar, Ashwin Pananjady:
Learning from an Exploring Demonstrator: Optimal Reward Estimation for Bandits. AISTATS 2022: 6357-6386 - [c14]Sheng Zhang, Ashwin Pananjady, Justin Romberg:
A Dual Accelerated Method for a Class of Distributed Optimization Problems: From Consensus to Decentralized Policy Evaluation. CDC 2022: 5220-5225 - [c13]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett:
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. COLT 2022: 2060-2061 - [i26]Jingyan Wang, Ashwin Pananjady:
Modeling and Correcting Bias in Sequential Evaluation. CoRR abs/2205.01607 (2022) - [i25]Sheng Zhang, Ashwin Pananjady, Justin Romberg:
A Dual Accelerated Method for Online Stochastic Distributed Averaging: From Consensus to Decentralized Policy Evaluation. CoRR abs/2207.11425 (2022) - 2021
- [j9]Koulik Khamaru, Ashwin Pananjady, Feng Ruan, Martin J. Wainwright, Michael I. Jordan
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis. SIAM J. Math. Data Sci. 3(4): 1013-1040 (2021) - [j8]Ashwin Pananjady
Instance-Dependent ℓ∞-Bounds for Policy Evaluation in Tabular Reinforcement Learning. IEEE Trans. Inf. Theory 67(1): 566-585 (2021) - [j7]Ashwin Pananjady
Single-Index Models in the High Signal Regime. IEEE Trans. Inf. Theory 67(6): 4092-4124 (2021) - [i24]Kush Bhatia, Ashwin Pananjady, Peter L. Bartlett, Anca D. Dragan, Martin J. Wainwright:
Preference learning along multiple criteria: A game-theoretic perspective. CoRR abs/2105.01850 (2021) - [i23]Wenshuo Guo, Kumar Krishna Agrawal, Aditya Grover, Vidya Muthukumar, Ashwin Pananjady:
Learning from an Exploring Demonstrator: Optimal Reward Estimation for Bandits. CoRR abs/2106.14866 (2021) - [i22]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright, Peter L. Bartlett:
Optimal and instance-dependent guarantees for Markovian linear stochastic approximation. CoRR abs/2112.12770 (2021) - [i21]Tianjiao Li, Guanghui Lan, Ashwin Pananjady:
Accelerated and instance-optimal policy evaluation with linear function approximation. CoRR abs/2112.13109 (2021) - 2020
- [b1]Ashwin Pananjady:
Statistics, computation, and adaptation in high dimensions. University of California, Berkeley, USA, 2020 - [j6]Dhruv Malik, Ashwin Pananjady, Kush Bhatia, Koulik Khamaru, Peter L. Bartlett, Martin J. Wainwright:
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. J. Mach. Learn. Res. 21: 21:1-21:51 (2020) - [c12]Avishek Ghosh, Ashwin Pananjady, Aditya Guntuboyina
Max-affine regression with universal parameter estimation for small-ball designs. ISIT 2020: 2706-2710 - [c11]Kush Bhatia, Ashwin Pananjady, Peter L. Bartlett, Anca D. Dragan, Martin J. Wainwright:
Preference learning along multiple criteria: A game-theoretic perspective. NeurIPS 2020 - [i20]Koulik Khamaru, Ashwin Pananjady, Feng Ruan, Martin J. Wainwright, Michael I. Jordan:
Is Temporal Difference Learning Optimal? An Instance-Dependent Analysis. CoRR abs/2003.07337 (2020) - [i19]Ashwin Pananjady, Richard J. Samworth:
Isotonic regression with unknown permutations: Statistics, computation, and adaptation. CoRR abs/2009.02609 (2020) - [i18]Wenlong Mou, Ashwin Pananjady, Martin J. Wainwright:
Optimal oracle inequalities for solving projected fixed-point equations. CoRR abs/2012.05299 (2020)
2010 – 2019
- 2019
- [c10]Dhruv Malik, Ashwin Pananjady, Kush Bhatia, Koulik Khamaru, Peter L. Bartlett, Martin J. Wainwright:
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. AISTATS 2019: 2916-2925 - [c9]Efe Aras, Kuan-Yun Lee, Ashwin Pananjady, Thomas A. Courtade:
A Family of Bayesian Cramér-Rao Bounds, and Consequences for Log-Concave Priors. ISIT 2019: 2699-2703 - [i17]Efe Aras, Kuan-Yun Lee, Ashwin Pananjady, Thomas A. Courtade:
A Family of Bayesian Cramér-Rao Bounds, and Consequences for Log-Concave Priors. CoRR abs/1902.08582 (2019) - [i16]Avishek Ghosh, Ashwin Pananjady, Adityanand Guntuboyina, Kannan Ramchandran:
Max-Affine Regression: Provable, Tractable, and Near-Optimal Statistical Estimation. CoRR abs/1906.09255 (2019) - [i15]Ashwin Pananjady, Martin J. Wainwright:
Value function estimation in Markov reward processes: Instance-dependent 𝓁∞-bounds for policy evaluation. CoRR abs/1909.08749 (2019) - 2018
- [j5]Ashwin Pananjady
The Effect of Local Decodability Constraints on Variable-Length Compression. IEEE Trans. Inf. Theory 64(4): 2593-2608 (2018) - [j4]Ashwin Pananjady
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery. IEEE Trans. Inf. Theory 64(5): 3286-3300 (2018) - [j3]Thomas A. Courtade
Quantitative Stability of the Entropy Power Inequality. IEEE Trans. Inf. Theory 64(8): 5691-5703 (2018) - [c8]Dong Yin, Ashwin Pananjady, Maximilian Lam, Dimitris S. Papailiopoulos, Kannan Ramchandran, Peter L. Bartlett:
Gradient Diversity: a Key Ingredient for Scalable Distributed Learning. AISTATS 2018: 1998-2007 - [c7]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time. COLT 2018: 2037-2042 - [i14]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Breaking the 1/√n Barrier: Faster Rates for Permutation-based Models in Polynomial Time. CoRR abs/1802.09963 (2018) - [i13]Cheng Mao, Ashwin Pananjady, Martin J. Wainwright:
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations. CoRR abs/1806.09544 (2018) - [i12]Dhruv Malik, Ashwin Pananjady, Kush Bhatia, Koulik Khamaru, Peter L. Bartlett, Martin J. Wainwright:
Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems. CoRR abs/1812.08305 (2018) - 2017
- [j2]Ashwin Pananjady
Optimally Approximating the Coverage Lifetime of Wireless Sensor Networks. IEEE/ACM Trans. Netw. 25(1): 98-111 (2017) - [c6]Ashwin Pananjady, Martin J. Wainwright
Denoising linear models with permuted data. ISIT 2017: 446-450 - [c5]Thomas A. Courtade, Max Fathi, Ashwin Pananjady:
Wasserstein stability of the entropy power inequality for log-concave random vectors. ISIT 2017: 659-663 - [i11]Thomas A. Courtade, Max Fathi, Ashwin Pananjady:
Existence of Stein Kernels under a Spectral Gap, and Discrepancy Bound. CoRR abs/1703.07707 (2017) - [i10]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Denoising Linear Models with Permuted Data. CoRR abs/1704.07461 (2017) - [i9]Dong Yin, Ashwin Pananjady, Maximilian Lam, Dimitris S. Papailiopoulos, Kannan Ramchandran, Peter L. Bartlett:
Gradient Diversity Empowers Distributed Learning. CoRR abs/1706.05699 (2017) - [i8]Ashwin Pananjady, Cheng Mao, Vidya Muthukumar, Martin J. Wainwright, Thomas A. Courtade:
Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisons. CoRR abs/1707.06217 (2017) - 2016
- [c4]Ashwin Pananjady, Martin J. Wainwright
Linear regression with an unknown permutation: Statistical and computational limits. Allerton 2016: 417-424 - [i7]Ashwin Pananjady, Martin J. Wainwright, Thomas A. Courtade:
Linear Regression with an Unknown Permutation: Statistical and Computational Limits. CoRR abs/1608.02902 (2016) - [i6]Thomas A. Courtade, Max Fathi, Ashwin Pananjady:
Wasserstein Stability of the Entropy Power Inequality for Log-Concave Densities. CoRR abs/1610.07969 (2016) - 2015
- [j1]Sounaka Mishra
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion. J. Discrete Algorithms 33: 71-80 (2015) - [c3]Ashwin Pananjady, Vivek Kumar Bagaria, Rahul Vaze:
The online disjoint set cover problem and its applications. INFOCOM 2015: 1221-1229 - [c2]Ashwin Pananjady, Thomas A. Courtade:
Compressing sparse sequences under local decodability constraints. ISIT 2015: 2979-2983 - [i5]Ashwin Pananjady, Thomas A. Courtade:
Compressing Sparse Sequences under Local Decodability Constraints. CoRR abs/1504.02063 (2015) - 2014
- [c1]Ashwin Pananjady, Vivek Kumar Bagaria, Rahul Vaze:
Maximizing utility among selfish users in social groups. NCC 2014: 1-6 - [i4]Ashwin Pananjady, Vivek Kumar Bagaria, Rahul Vaze:
The Online Disjoint Set Cover Problem and its Applications. CoRR abs/1411.5739 (2014) - 2013
- [i3]Vivek Kumar Bagaria, Ashwin Pananjady, Rahul Vaze:
Optimally Approximating the Lifetime of Wireless Sensor Networks. CoRR abs/1307.5230 (2013) - [i2]Ashwin Pananjady, Vivek Kumar Bagaria, Rahul Vaze:
Maximizing Utility Among Selfish Users in Social Groups. CoRR abs/1309.7935 (2013) - [i1]Sounaka Mishra, Ashwin Pananjady, N. Safina Devi:
On the Complexity of Making a Distinguished Vertex Minimum or Maximum Degree by Vertex Deletion. CoRR abs/1312.3779 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-30 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: