| Publication | Date of Publication | Type |
|---|
| Limitations of information-theoretic generalization bounds for gradient descent methods in stochastic convex optimization | 2025-02-24 | Paper |
| Algorithmic barriers to representing conditional independence | 2024-12-19 | Paper |
| Bi-objective model for the distribution of COVID-19 vaccines | 2024-10-29 | Paper |
Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization
The Annals of Statistics | 2024-01-04 | Paper |
Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization
The Annals of Statistics | 2024-01-04 | Paper |
| de Finetti's theorem and the existence of regular conditional distributions and strong laws on exchangeable algebras | 2023-12-26 | Paper |
Minimax rates for conditional density estimation via empirical entropy
The Annals of Statistics | 2023-07-19 | Paper |
| Statistical minimax theorems via nonstandard analysis | 2022-12-26 | Paper |
| Admissibility is Bayes optimality with infinitesimals | 2021-12-28 | Paper |
On extended admissible procedures and their nonstandard Bayes risk
The Annals of Statistics | 2021-12-03 | Paper |
On extended admissible procedures and their nonstandard Bayes risk
The Annals of Statistics | 2021-12-03 | Paper |
The beta-Bernoulli process and algebraic effects
(available as arXiv preprint) | 2021-07-28 | Paper |
scientific article; zbMATH DE number 7370631 (Why is no real title available?)
(available as arXiv preprint) | 2021-07-09 | Paper |
| scientific article; zbMATH DE number 7370631 (Why is no real title available?) | 2021-07-09 | Paper |
Gibbs-type Indian buffet processes
Bayesian Analysis | 2021-02-09 | Paper |
Gibbs-type Indian buffet processes
Bayesian Analysis | 2021-02-09 | Paper |
Bootstrap estimators for the tail-index and for the count statistics of graphex processes
Electronic Journal of Statistics | 2021-01-19 | Paper |
Bootstrap estimators for the tail-index and for the count statistics of graphex processes
Electronic Journal of Statistics | 2021-01-19 | Paper |
On the computability of conditional probability
Journal of the ACM | 2020-02-11 | Paper |
Sampling and estimation for (sparse) exchangeable graphs
The Annals of Statistics | 2020-01-15 | Paper |
Sampling and estimation for (sparse) exchangeable graphs
The Annals of Statistics | 2020-01-15 | Paper |
| Black-box constructions for exchangeable sequences of random multisets | 2019-08-17 | Paper |
Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via \(\infty\)-ESS, and an application to particle Gibbs
Bernoulli | 2019-01-28 | Paper |
Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via \(\infty\)-ESS, and an application to particle Gibbs
Bernoulli | 2019-01-28 | Paper |
A characterization of product-form exchangeable feature probability functions
The Annals of Applied Probability | 2018-08-16 | Paper |
A characterization of product-form exchangeable feature probability functions
The Annals of Applied Probability | 2018-08-16 | Paper |
| On the computability of graphons | 2018-01-31 | Paper |
On computability and disintegration
Mathematical Structures in Computer Science | 2017-11-22 | Paper |
The combinatorial structure of beta negative binomial processes
Bernoulli | 2016-07-14 | Paper |
The combinatorial structure of beta negative binomial processes
Bernoulli | 2016-07-14 | Paper |
| The Class of Random Graphs Arising from Exchangeable Random Measures | 2015-12-07 | Paper |
Sequential Monte Carlo as Approximate Sampling: bounds, adaptive resampling via $\infty$-ESS, and an application to Particle Gibbs
(available as arXiv preprint) | 2015-03-03 | Paper |
| The continuum-of-urns scheme, generalized beta and Indian buffet processes, and hierarchies thereof | 2014-12-31 | Paper |
| Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence | 2012-12-19 | Paper |
Computable de Finetti measures
Annals of Pure and Applied Logic | 2012-03-13 | Paper |
Computable exchangeable sequences have computable de Finetti measures
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets
(available as arXiv preprint) | N/A | Paper |
