VLDB 2026 Research / reviewers in the wild / expert
Michael W. Trosset
dblp:89/3132
· DBLP profile ↗
4ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 1
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.
| Artificial intelligence
1 paper |
Probabilistic and Bayesian machine learning · 56% Learning theory · 44% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Learning theory
hypothesis testing |
0.8 | 1 | 2024 | Approximate Information Tests on Statistical Submanifolds · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning
statistical inference |
0.8 | 1 | 2024 | Approximate Information Tests on Statistical Submanifolds · J. Mach. Learn. Res. 2024 |
Algorithms and data structures › numerical linear algebra › dimensionality reduction › nonlinear dimensionality reduction
manifold learning |
0.8 | 1 | 2024 | Approximate Information Tests on Statistical Submanifolds · J. Mach. Learn. Res. 2024 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
likelihood ratio test |
0.2 | 1 | 2024 | Approximate Information Tests on Statistical Submanifolds · J. Mach. Learn. Res. 2024 |
Methods — techniques the papers use, named apart from their topics
manifold learning · 1.5asymptotic analysis · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Approximate Information Tests on Statistical SubmanifoldsabstractParametric inference posits a statistical model that is a specified family of probability distributions. Restricted inference, for example, restricted likelihood ratio testing, attempts to exploit the structure of a statistical submodel that is a subset of the specified family. We consider the problem of testing a simple hypothesis against alternatives from such a submodel. In the case of an unknown submodel, it is not clear how to realize the benefits of restricted inference. To do so, we first construct information tests that are locally asymptotically equivalent to likelihood ratio tests. Information tests are conceptually appealing but (in general) computationally intractable. However, unlike restricted likelihood ratio tests, restricted information tests can be approximated even when the statistical submodel is unknown. We construct approximate information tests using manifold learning procedures to extract information from samples of an unknown (or intractable) submodel, thereby providing a roadmap for computational solutions to a class of previously impenetrable problems in statistical inference. Examples illustrate the efficacy of the proposed methodology. Michael W. Trosset, Carey E. Priebe |
J. Mach. Learn. Res. | 1 |
| 2020 | Algorithm 1007: QNSTOP - Quasi-Newton Algorithm for Stochastic OptimizationabstractQNSTOP consists of serial and parallel (OpenMP) Fortran 2003 codes for the quasi-Newton stochastic optimization method of Castle and Trosset for stochastic search problems. A complete description of QNSTOP for both local search with stochastic objective and global search with “noisy” deterministic objective is given here, to the best of our knowledge, for the first time. For stochastic search problems, some convergence theory exists for particular algorithmic choices and parameter values. Both the parallel driver subroutine, which offers several parallel decomposition strategies, and the serial driver subroutine can be used for local stochastic search or global deterministic search, based on an input switch. Some performance data for computational systems biology problems is given. Brandon Amos, David R. Easterling, Layne T. Watson, William I. Thacker, Brent S. Castle, Michael W. Trosset |
ACM Trans. Math. Softw. | 6 |
| 2019 | Quasi-Newton Stochastic Optimization Algorithm for Parameter Estimation of a Stochastic Model of the Budding Yeast Cell CycleabstractParameter estimation in discrete or continuous deterministic cell cycle models is challenging for several reasons, including the nature of what can be observed, and the accuracy and quantity of those observations. The challenge is even greater for stochastic models, where the number of simulations and amount of empirical data must be even larger to obtain statistically valid parameter estimates. The two main contributions of this work are (1) stochastic model parameter estimation based on directly matching multivariate probability distributions, and (2) a new quasi-Newton algorithm class QNSTOP for stochastic optimization problems. QNSTOP directly uses the random objective function value samples rather than creating ensemble statistics. QNSTOP is used here to directly match empirical and simulated joint probability distributions rather than matching summary statistics. Results are given for a current state-of-the-art stochastic cell cycle model of budding yeast, whose predictions match well some summary statistics and one-dimensional distributions from empirical data, but do not match well the empirical joint distributions. The nature of the mismatch provides insight into the weakness in the stochastic model. Minghan Chen 0001, Brandon Amos, Layne T. Watson, John J. Tyson, Yang Cao 0001, Clifford A. Shaffer, Michael W. Trosset, Cihan Oguz, Gisella Kakoti |
IEEE ACM Trans. Comput. Biol. Bioinform. | 7 |
| 2013 | Adjusting process count on demand for petascale global optimization
Masha Sosonkina, Layne T. Watson, Nicholas R. Radcliffe, Raphael T. Haftka, Michael W. Trosset |
Parallel Comput. | 5 |