default search action
Natesh S. Pillai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Daniel Zhao, Natesh S. Pillai:
Policy Gradients for Optimal Parallel Tempering MCMC. CoRR abs/2409.01574 (2024) - [i5]Saikrishna Badrinarayanan, Osonde Osoba, Miao Cheng, Ryan Rogers, Sakshi Jain, Rahul Tandra, Natesh S. Pillai:
Privacy-Preserving Race/Ethnicity Estimation for Algorithmic Bias Measurement in the U.S. CoRR abs/2409.04652 (2024) - 2023
- [c3]Tianle Liu, Promit Ghosal, Krishnakumar Balasubramanian, Natesh S. Pillai:
Towards Understanding the Dynamics of Gaussian-Stein Variational Gradient Descent. NeurIPS 2023 - [i4]Tianle Liu, Promit Ghosal, Krishnakumar Balasubramanian, Natesh S. Pillai:
Towards Understanding the Dynamics of Gaussian-Stein Variational Gradient Descent. CoRR abs/2305.14076 (2023) - 2022
- [j5]Andrew D. Davis
, Youssef M. Marzouk, Aaron Smith, Natesh S. Pillai:
Rate-optimal refinement strategies for local approximation MCMC. Stat. Comput. 32(4): 60 (2022) - [c2]Nhat Ho, Avi Feller, Evan Greif, Luke Miratrix, Natesh S. Pillai:
Weak Separation in Mixture Models and Implications for Principal Stratification. AISTATS 2022: 5416-5458 - 2021
- [j4]Oren Mangoubi, Natesh S. Pillai, Aaron Smith:
Simple conditions for metastability of continuous Markov chains. J. Appl. Probab. 58(1): 83-105 (2021) - 2020
- [i3]Vishesh Jain, Natesh S. Pillai, Aaron Smith:
Kac meets Johnson and Lindenstrauss: a memory-optimal, fast Johnson-Lindenstrauss transform. CoRR abs/2003.10069 (2020)
2010 – 2019
- 2018
- [j3]Patrick R. Conrad, Andrew D. Davis, Youssef M. Marzouk, Natesh S. Pillai, Aaron Smith:
Parallel Local Approximation MCMC for Expensive Models. SIAM/ASA J. Uncertain. Quantification 6(1): 339-373 (2018) - [i2]Oren Mangoubi, Natesh S. Pillai, Aaron Smith:
Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities? CoRR abs/1808.03230 (2018) - 2017
- [j2]Luke Bornn, Natesh S. Pillai, Aaron Smith, Dawn Woodard:
The use of a single pseudo-sample in approximate Bayesian computation. Stat. Comput. 27(3): 583-590 (2017) - 2016
- [c1]Guillaume W. Basse, Aaron Smith, Natesh S. Pillai:
Parallel Markov Chain Monte Carlo via Spectral Clustering. AISTATS 2016: 1318-1327 - [i1]James E. Johndrow, Aaron Smith, Natesh S. Pillai, David B. Dunson:
Inefficiency of Data Augmentation for Large Sample Imbalanced Data. CoRR abs/1605.05798 (2016)
2000 – 2009
- 2007
- [j1]Natesh S. Pillai, Qiang Wu, Feng Liang, Sayan Mukherjee, Robert L. Wolpert:
Characterizing the Function Space for Bayesian Kernel Models. J. Mach. Learn. Res. 8: 1769-1797 (2007)
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 2025-01-20 22:53 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: