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,657 papers · 148 categories

Trend · papers per month

491317 · May 202619922001200920172026
48 results for population-level

CLSB models system dynamics from cross-sectional data with population-level regularization.

problem Challenges in modeling system dynamics from limited cross-sectional samples and heterogeneous individual behaviors.
method Introduces CLSB framework for learning dynamics, regularized for population-level temporal variations.
result Empirically superior in single-cell sequencing data analyses, e.g., simulating cell development and drug response.

New method pools labels from similar data items to improve learning from small samples.

problem Learning from small, human-annotated samples with potential disagreement among annotators.
method Proposes neighborhood-based pooling for sharing labels across similar data items.
result Improves learning from small, noisy samples by pooling labels from similar items.

Conventional survival analysis approaches estimate risk scores or individualized time-to-event distributions conditioned on covariates. In practice, there is often great population-level phenotypic heterogeneity, resulting from (unknown) subpopulations with diverse risk profiles or survival distributions. As a result, …

2020-02-29abs ↗pdf ↗

Aims to describe neural network training dynamics using two-time-scale models.

problem Lack of a general mathematical description of neural network training.
method Introduces a theoretical framework based on two-time-scale population dynamics.
result Derives selection-mutation equations and effective fitness for hyperparameters.

Efficiently estimates variable importance in prediction tasks using Shapley values.

problem Valid statistical inference on the importance of variables in prediction tasks.
method Randomly sampling feature subsets to estimate Shapley Population Variable Importance Measure (SPVIM) efficiently.
result The proposed estimator converges at an asymptotically optimal rate and can construct valid confidence intervals and hypothesis tests.

The paper analyzes the generalization performance of spectral clustering algorithms and proposes new methods to improve their effectiveness.

problem Theoretical analysis of spectral clustering's generalization performance.
method Theoretical analysis and development of new spectral clustering algorithms.
result The excess risk bounds of spectral clustering algorithms have a O(1/n)\mathcal{O}(1/\sqrt{n}) convergence rate.

Left atrium shape has been shown to be an independent predictor of recurrence after atrial fibrillation (AF) ablation. Shape-based representation is imperative to such an estimation process, where correspondence-based representation offers the most flexibility and ease-of-computation for population-level shape statisti…

2018-09-30abs ↗pdf ↗

Models predict probabilities of causation from limited data.

problem Estimating probabilities of causation requires unreliable or impractical experimental and observational data.
method Proposed Exact-MLP and Mask-MLP models trained on reliable subpopulations.
result Models achieve average MAEs of roughly 0.03, reducing MAE by 80%.

Multi-party machine learning leaks global dataset properties even with black-box access.

problem Leakage of global dataset properties in multi-party machine learning.
method Demonstrated leakage of sensitive attribute distributions in pooled data.
result A curious party can infer sensitive attribute distributions in other parties' data with high accuracy.

TILT improves target domain performance by penalizing an auxiliary component on unlabeled target inputs.

problem Improving performance on target domain under covariate shift.
method TILT uses a novel objective function to decompose the source predictor and penalize an auxiliary component on unlabeled target inputs.
result TILT improves target domain performance over source-only training and other baselines.

A new method combines synthetic data analysis and DP generation to produce accurate uncertainty estimates.

problem Invalid inferences from DP synthetic data analysis.
method Combining synthetic data analysis techniques from MI and NA Bayesian modeling with a novel noise-aware synthetic data generation algorithm.
result Accurate confidence intervals from DP synthetic data are produced, wider with tighter privacy.

o1Neuro neural network approximates complex functions and converges quickly.

problem Approximating complex functions and ensuring convergence in neural networks.
method Sparse indicator activation neurons, population and sample level convergence properties.
result o1Neuro achieves optimal model approximation and convergence with high probability.

The study analyzes the performance of statistical estimators under stability and computational efficiency.

problem Understanding the performance of statistical estimators in relation to stability and computational efficiency.
method Developed a framework to bound statistical accuracy based on the interplay between algorithm convergence rates and stability.
result Unstable algorithms can achieve the same statistical accuracy as stable ones in fewer steps.

Integrates neural encoders into GLMMs for multimodal data analysis.

problem Scalable Bayesian inference for GLMMs assumes low-dimensional tabular predictors and does not handle high-dimensional modalities.
method Jointly learns modality-specific neural encoders with GLMM objective, performs variance-corrected stochastic-gradient MCMC.
result Preserves interpretable fixed and random effects while scaling to large longitudinal datasets.

The paper explores various forms of calibration scores and their implications for fairness.

problem The evaluation of probabilistic predictions through calibration.
method The authors organize three grouping choices and one agglomeration of group errors, providing a framework for comparing and creating new calibration scores.
result The study demonstrates that appropriate choices of grouping can provide notions of (sub-)group or individual fairness.

dLDS models neural dynamics as sparse combinations of simpler components.

problem Understanding complex neural dynamics at a population level.
method Proposes a decomposed dynamical system model trained through dictionary learning.
result Model efficiently captures and demix diverse neural dynamics.

New method aligns brain data across individuals for better brain decoding.

problem Inter-individual variability in brain response patterns limits decoder generalization.
method SpectralOT method that embeds cortical geometry into Laplace-Beltrami eigenmodes.
result SpectralOT strikes balance between aligning functional features and preserving anatomical structure.

Good predictors of ICU Mortality have the potential to identify high-risk patients earlier, improve ICU resource allocation, or create more accurate population-level risk models. Machine learning practitioners typically make choices about how to represent features in a particular model, but these choices are seldom eva…

2015-12-16abs ↗pdf ↗

The paper introduces Shapley curves for measuring variable importance in nonparametric settings.

problem Limited statistical understanding of Shapley values as variable importance measures.
method Introduces Shapley curves based on conditional expectation and covariate distribution; derives convergence rates and normality; proposes a novel bootstrap procedure.
result Validates theoretical findings with numerical studies and analyzes vehicle prices determinants.

New framework shows diverse training data improves subgroup and overall performance.

problem Lack of understanding how diverse training data affects subgroup and overall performance.
method Casts data collection as part of the learning process, analyzes dataset compositions, and guides dataset design.
result Diverse representation in training data improves subgroup and overall performance.

This paper analyzes EM algorithm for softmax mixture models in high dimensions.

problem Modeling heterogeneous populations choosing from multiple attributes.
method Comprehensive analysis of the EM algorithm for softmax mixture models (SMMs), proving identifiability and convergence.
result EM algorithm recovers mixture atoms at near-parametric rate under suitable initialization.

Federated Learning allows for population level models to be trained without centralizing client data by transmitting the global model to clients, calculating gradients locally, then averaging the gradients. Downloading models and uploading gradients uses the client's bandwidth, so minimizing these transmission costs is…

2019-09-27abs ↗pdf ↗

Modern data analysis depends increasingly on estimating models via flexible high-dimensional or nonparametric machine learning methods, where the identification of structural parameters is often challenging and untestable. In linear settings, this identification hinges on the completeness condition, which requires the …

2017-09-11abs ↗pdf ↗

G-Net uses deep learning for complex counterfactual outcome prediction.

problem Estimating counterfactual outcomes under dynamic treatment strategies.
method G-Net is a sequential deep learning framework for G-computation.
result G-Net can handle complex temporal data and provide accurate treatment effects.

Neural networks can learn relationships that traditional models cannot.

problem Identifying factors that differentiate neural networks from traditional models.
method Proving non-identifiability of neural networks compared to smooth parametric models.
result Neural networks can learn nontrivial relationships that traditional models cannot.

Estimates population mean from user-level data with privacy, accounting for heterogeneity.

problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.

Policy learning can be used to extract individualized treatment regimes from observational data in healthcare, civics, e-commerce, and beyond. One big hurdle to policy learning is a commonplace lack of overlap in the data for different actions, which can lead to unwieldy policy evaluation and poorly performing learned …

2019-06-20abs ↗pdf ↗

Study proves convergence of subgradients for optimal transport-based objectives.

problem Ensuring statistical consistency and optimization stability in transport-based models.
method Proves graphical convergence of subdifferentials to the subdifferential of the population objective.
result Standard subgradient methods consistently approach stationary points of the population-level problem.

Generative models improve causal effect estimation from observational data.

problem Estimating causal effects from observational data, especially when confounding factors are present.
method Proposes a progressive sequence of Variational Auto-Encoder models to learn underlying factors and causal effects.
result Empirical results show superior performance compared to state-of-the-art approaches.

Twitter has been a prominent social media platform for mining population-level health data and accurate clustering of health-related tweets into topics is important for extracting relevant health insights. In this work, we propose deep convolutional autoencoders for learning compact representations of health-related tw…

2018-12-25abs ↗pdf ↗

The paper identifies the best treatment to maximize NDPO, a key outcome in causal mediation analysis.

problem Identifying the treatment that maximizes the expected natural direct potential outcome (NDPO) in causal mediation analysis.
method Developed a fixed-confidence best-arm identification (BAI) algorithm based on the Track-and-Stop (TaS) framework, using a cutting-set method to solve a semi-infinite optimization problem.
result The proposed algorithm achieves sample-efficient identification with a high-probability correctness guarantee and asymptotic optimality.

Develops a nonparametric graphical model for conditional independence.

problem Evaluation of conditional independence without distributional assumptions.
method Nonlinear sufficient dimension reduction techniques applied to a nonparametric graphical model.
result Method outperforms existing methods in non-Gaussian settings and high-dimensional data.

Study shows fast rates for inverse reinforcement learning with linear rewards.

problem Entropy-regularized min-max inverse reinforcement learning in finite-horizon MDPs.
method Structural and statistical analysis of Min-Max-IRL with pseudo-self-concordance.
result Both trajectory-level KL divergence and parameter error decay at O(n1)\mathcal{O}(n^{-1}).