Natesh S. Pillai

Affiliations:
  • LinkedIn, USA
  • Harvard University, CA, USA


According to our database1, Natesh S. Pillai authored at least 19 papers between 2007 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
BP-Seg: A graphical model approach to unsupervised and non-contiguous text segmentation using belief propagation.
CoRR, May, 2025

Efficient AI in Practice: Training and Deployment of Efficient LLMs for Industry Applications.
CoRR, February, 2025

360Brew: A Decoder-only Foundation Model for Personalized Ranking and Recommendation.
CoRR, January, 2025

AlphaPO - Reward shape matters for LLM alignment.
CoRR, January, 2025

AlphaPO: Reward Shape Matters for LLM Alignment.
Proceedings of the Forty-second International Conference on Machine Learning, 2025

2024
From Models to Systems: A Comprehensive Fairness Framework for Compositional Recommender Systems.
CoRR, 2024

Privacy-Preserving Race/Ethnicity Estimation for Algorithmic Bias Measurement in the U.S.
CoRR, 2024

Policy Gradients for Optimal Parallel Tempering MCMC.
CoRR, 2024

2023
Towards Understanding the Dynamics of Gaussian-Stein Variational Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Rate-optimal refinement strategies for local approximation MCMC.
Stat. Comput., 2022

Weak Separation in Mixture Models and Implications for Principal Stratification.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Simple conditions for metastability of continuous Markov chains.
J. Appl. Probab., 2021

2020
Kac meets Johnson and Lindenstrauss: a memory-optimal, fast Johnson-Lindenstrauss transform.
CoRR, 2020

2018
Parallel Local Approximation MCMC for Expensive Models.
SIAM/ASA J. Uncertain. Quantification, 2018

Does Hamiltonian Monte Carlo mix faster than a random walk on multimodal densities?
CoRR, 2018

2017
The use of a single pseudo-sample in approximate Bayesian computation.
Stat. Comput., 2017

2016
Inefficiency of Data Augmentation for Large Sample Imbalanced Data.
CoRR, 2016

Parallel Markov Chain Monte Carlo via Spectral Clustering.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2007
Characterizing the Function Space for Bayesian Kernel Models.
J. Mach. Learn. Res., 2007


  Loading...