Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

60119179238 · Jun 202019922001200920172026
48 results for birth weight

Study estimates personalized effects of maternal PM2.5 exposure on birth weight.

problem Identify critical windows and heterogeneity in maternal PM2.5 exposure effects on birth weight.
method Heterogeneous Distributed Lag Models and Bayesian Additive Regression Trees.
result Evidence of heterogeneity in PM2.5-birth weight relationship, with some dyads showing 3x larger decrease.

Quantile regression is a tool for learning conditional distributions. In this paper we study quantile regression in the setting where a protected attribute is unavailable when fitting the model. This can lead to "unfair'' quantile estimators for which the effective quantiles are very different for the subpopulations de…

2019-07-19abs ↗pdf ↗

In this paper, we study curvature dimension conditions on birth-death processes which correspond to linear graphs, i.e., weighted graphs supported on the infinite line or the half line. We give a combinatorial characterization of Bakry and Émery's CD(K,n)CD(K,n) condition for linear graphs and prove the triviality of edge w…

2017-12-05abs ↗pdf ↗

This is a survey article on recent progress of comparison geometry and geometric analysis on Finsler manifolds of weighted Ricci curvature bounded below. Our purpose is two-fold: Give a concise and geometric review on the birth of weighted Ricci curvature and its applications; Explain recent results from a nonlinear an…

2017-04-05abs ↗pdf ↗

New RL algorithm reduces regret in birth-death queueing problems.

problem Efficiency of reinforcement learning in MDPs with large state spaces.
method Modified Ucrl2 algorithm exploiting birth-death structure.
result Regret bound of ildeO(E2AT) ilde{\mathcal{O}}(\sqrt{E_2AT}) independent of state space size.

Study birth-death dynamics for sampling Gibbs measures with nonconvex potentials.

problem Sampling Gibbs measures with nonconvex potentials.
method Birth-death dynamics, Kullback-Leibler divergence, χ2χ^2 divergence, kernel-based approximations, ΓΓ-convergence of gradient flows.
result Probability density converges exponentially fast to Gibbs equilibrium measure with a universal rate.

We consider models of the population or opinion dynamics which result in the non-linear stochastic differential equations (SDEs) exhibiting the spurious long-range memory. In this context, the correspondence between the description of the birth-death processes as the continuous-time Markov chains and the continuous SDE…

2019-04-30abs ↗pdf ↗

Near a birth-death critical point in a one-parameter family of gradient flows, there are precisely two Morse critical points of index difference one on the birth side. This paper gives a self-contained proof of the folklore theorem that these two critical points are joined by a unique gradient trajectory up to time-shi…

2017-06-23abs ↗pdf ↗

A fundamental problem in Bayesian inference and statistical machine learning is to efficiently sample from multimodal distributions. Due to metastability, multimodal distributions are difficult to sample using standard Markov chain Monte Carlo methods. We propose a new sampling algorithm based on a birth-death mechanis…

2019-05-23abs ↗pdf ↗

New method uses birth-death process and exploration component to accelerate sampling from multimodal distributions.

problem Sampling from multimodal probability distributions efficiently.
method Combines birth-death process and exploration component to accelerate sampling.
result Proves exponential asymptotic convergence under mild assumptions.

New method speeds up uncertainty estimation for large datasets in causal inference.

problem Computational infeasibility of bootstrap-based uncertainty quantification for large datasets.
method Extends cBLB algorithm to kernel methods, combining subsampling and resampling.
result Achieves computational scalability with nominal coverage.

Bayesian networks (BNs) are graphical models that are useful for representing high-dimensional probability distributions. There has been a great deal of interest in recent years in the NP-hard problem of learning the structure of a BN from observed data. Typically, one assigns a score to various structures and the sear…

2016-10-01abs ↗pdf ↗

Kernel methods identify treatment effects with unobserved confounding using negative controls.

problem Learning causal relationships with unmeasured confounding.
method Kernel ridge regression algorithms for nonparametric treatment effects.
result Uniform consistency and finite sample rates of convergence proved.

FS&P uses birth-death process to ensure global convergence of stochastic conic particle gradient descent.

problem Global optimization of non-convex objective functions over measure space.
method Introduces Fast Spawn\&Prune (FS\&P) combining CPGD with birth-death process.
result First theoretical guarantee of global convergence for discrete-time stochastic algorithms.

Classifies and analyzes the stability of black hole event horizon birth points using contact geometry.

problem Classifying and understanding the structural possibilities of black hole crease sets.
method Contact geometry approach, focusing on BigFronts and their Legendrian projections.
result Refined stability discussion of the event horizon birth component and identification of additional components.

Every year, 3 million newborns die within the first month of life. Birth asphyxia and other breathing-related conditions are a leading cause of mortality during the neonatal phase. Current diagnostic methods are too sophisticated in terms of equipment, required expertise, and general logistics. Consequently, early dete…

2017-11-17abs ↗pdf ↗

Decision trees are flexible models that are well suited for many statistical regression problems. In a Bayesian framework for regression trees, Markov Chain Monte Carlo (MCMC) search algorithms are required to generate samples of tree models according to their posterior probabilities. The critical component of such an …

2019-04-19abs ↗pdf ↗

Preterm birth is the most common cause of neonatal death. Current diagnostic methods that assess the risk of preterm birth involve the collection of maternal characteristics and transvaginal ultrasound imaging conducted in the first and second trimester of pregnancy. Analysis of the ultrasound data is based on visual i…

2019-08-24abs ↗pdf ↗

Large language models based on transformers have achieved great empirical successes. However, as they are deployed more widely, there is a growing need to better understand their internal mechanisms in order to make them more reliable. These models appear to store vast amounts of knowledge from their training data, and…

2023-06-01abs ↗pdf ↗

The Infant Mortality Rate (IMR) is the number of infants per 1000 that do not survive until their first birthday. It is an important metric providing information about infant health but it also measures the society's general health status. Despite the high level of prosperity in the U.S.A., the country's IMR is higher …

2019-07-21abs ↗pdf ↗

No regularization needed for InLDL, achieving efficient and effective model.

problem InLDL struggles with performance degradation due to missing degrees.
method Proposes a model that uses label distribution as a prior, implicitly regularizing the learning process.
result Achieves competitive performance without explicit regularization.

Paper proposes scalable method for analyzing multi-omic data.

problem Integrating high-dimensional multi-omic data for cancer subtyping.
method Mixed graphical model approach using Birth-Death MCMC algorithm.
result Our method outperforms LASSO and standard BDMCMC in computational efficiency and model selection accuracy.

Neural networks with a large number of parameters admit a mean-field description, which has recently served as a theoretical explanation for the favorable training properties of "overparameterized" models. In this regime, gradient descent obeys a deterministic partial differential equation (PDE) that converges to a glo…

2019-02-05abs ↗pdf ↗

Recent advances in Reinforcement Learning, grounded on combining classical theoretical results with Deep Learning paradigm, led to breakthroughs in many artificial intelligence tasks and gave birth to Deep Reinforcement Learning (DRL) as a field of research. In this work latest DRL algorithms are reviewed with a focus …

2019-06-24abs ↗pdf ↗

Thirty years after the birth of foliations in the 1950's, André Haefliger has introduced a special property satisfied by holonomy pseudogroups of foliations on compact manifolds, called compact generation. Up to now, this is the only general property known about holonomy on compact manifolds. In this article, we give a…

2009-04-29abs ↗pdf ↗

Enhances early risk assessments for pediatric outcomes using contrastive learning.

problem Improving risk assessments in early stages of pediatric development.
method Contrastive multi-modal framework that treats each time window as a distinct modality, training on all available data.
result Consistent improvements in early-stage risk assessments validated on real-world tasks.

Flow Matching for count data improves sample quality and efficiency.

problem Mapping between count distributions across batches or time points in high-dimensional count data.
method count-FM, a flow-matching framework based on a continuous-time birth-death process with local unit jumps.
result count-FM achieves better sample quality than representative baselines while using fewer parameters.

Valid causal inference with unobserved confounding in high-dimensional settings.

problem Estimating causal effects with unobserved confounders in high-dimensional data.
method Proposes methods to estimate causal effects with valid confidence intervals in the presence of unobserved confounders and high-dimensional nuisance models.
result Valid semiparametric inference can be obtained with unobserved confounding, and uncertainty intervals are proposed.

Stein transport improves Bayesian inference with faster convergence and reduced variance.

problem Efficiently approximating posterior distributions in Bayesian inference.
method A novel Bayesian inference method using Stein transport, which pushes particles along a curve of tempered distributions.
result Stein transport reaches posterior approximations faster and more accurately than Stein variational gradient descent (SVGD).