Sanjay Chaudhuri

dblp:35/493 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorTheory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 33% Information theory · 33% Computational geometry · 33%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.712023
Maximum Likelihood Estimation Under Constraints: Singularities and Random Critical Points · IEEE Trans. Inf. Theory 2023
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › bayesian asymptotics
posterior consistency
0.712023
Maximum Likelihood Estimation Under Constraints: Singularities and Random Critical Points · IEEE Trans. Inf. Theory 2023
Computational geometry › computational topology
critical points
0.712023
Maximum Likelihood Estimation Under Constraints: Singularities and Random Critical Points · IEEE Trans. Inf. Theory 2023
Mathematical optimization › statistical estimation
maximum likelihood estimation
0.712023
Maximum Likelihood Estimation Under Constraints: Singularities and Random Critical Points · IEEE Trans. Inf. Theory 2023
Information theory › probability theory
random polynomials
0.712023
Maximum Likelihood Estimation Under Constraints: Singularities and Random Critical Points · IEEE Trans. Inf. Theory 2023

Methods — techniques the papers use, named apart from their topics

wilks' statistic · 1.3random polynomial analysis · 1.3
YearPublicationVenuePosition
2023 Maximum Likelihood Estimation Under Constraints: Singularities and Random Critical Points
abstract
We investigate the procedure of semi-parametric maximum likelihood estimation under constraints on summary statistics. Such a procedure results in a discrete probability distribution supported on the data points that maximizes the likelihood among all distributions supported on the data points satisfying the specified constraints (called estimating equations). The resultant distribution is an approximation of the underlying population distribution. The study of such empirical likelihood estimation originates from the seminal work of Owen (1998 and 2001). We investigate this procedure in the setting of misspecified (or biased) constraints, i.e., when the null hypothesis is not true. We establish that the behavior of the optimal weight distribution under such misspecification differ markedly from their properties under the null, i.e., when the estimating equations are correctly specified (or unbiased). This is manifested by certain “singularities” in the optimal distribution, that are not observed under the null. Furthermore, we establish an anomalous behavior of the log-likelihood based Wilks’ statistic, which, unlike under the null, does not exhibit a chi-squared limit. In the Bayesian setting, we establish the posterior consistency of procedures based on these ideas, where instead of a parametric likelihood, an empirical likelihood is used to define the posterior distribution. In particular, we show that this posterior, as a random probability measure, rapidly converges, with explicit convergence guarantees, to the delta measure at the true parameter value. We also illustrate implications of our results in diverse settings such as degeneracies in exponential random graph models (ERGM) for random networks (Chatterjee and Diaconis, 2013, and Mukherjee, 2020), empirical procedures where the constraints are themselves estimated from data (Hjort, 2009), and to approximate Bayesian computation based procedures (Chaudhuri et al., 2020). A novel feature of our work is to connect the likelihood maximization problem to critical points of random polynomials. This yields the mass of the singular weight in the optimal weight distribution as the leading term in a canonical expansion of a critical point of a random polynomial. Our work unveils the possibility that similar random polynomial based techniques could be effective in analyzing a wide class of problems in related areas.
Subhroshekhar Ghosh, Sanjay Chaudhuri, Ujan Gangopadhyay
IEEE Trans. Inf. Theory2
2003 Using the structure of d-connecting paths as a qualitative measure of the strength of dependence
Sanjay Chaudhuri, Thomas Richardson 0001
UAI1