Estimates population profile from small random samples.
problem Learning population composition from limited data.
method Minimum distance estimator based on linear programming.
result Consistent estimation of profile in sublinear sample size.
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
48 results for “Population profile”
An evolutionary algorithm separates mixed DNA profiles in forensic genetics.
problem Deconvolving mixed DNA profiles from crime samples.
method Multiple population evolutionary algorithm (MEA) with guided mutation.
result The MEA successfully deconvoluted DNA profiles from crime samples.
New method resolves causal heterogeneity by defining a resolution profile.
problem Causal subgroup analyses often oversimplify heterogeneity into a small number of groups.
method Introduces a resolution profile as a functional of the causal feature law, using Bayesian-bootstrap inference.
result Shows that the resolution profile is a continuous path with discontinuities at knots, providing integer-valued subgroup numbers.
Survival Cluster Analysisstat.ML
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, …
Semi-supervised GAN creates synthetic genetic data for disease prediction.
problem Expensive and time-consuming to build large labeled genetic databases.
method Semi-supervised Genetic Generative Adversarial Network (gGAN).
result Model achieved satisfactory results with real genetic data.
New metric scores perturbations across populations, not cells, improving model comparison.
problem Single-cell perturbation data overlaps, making per-cell accuracy unreliable.
method Average per-cell probability vectors over all cells of a perturbation to form a population profile and rank candidate perturbations.
result Classifier Discrimination Score (CDS) identifies true perturbation more reliably than pseudobulk-based scores.
Framework generates precise synthetic populations for scalable modeling.
problem Generating accurate synthetic populations without personal data.
method Constraint-programming framework encoding aggregated statistics and structural relations.
result Exact control of demographic profiles without requiring microdata.
We address the problem of correcting group discriminations within a score function, while minimizing the individual error. Each group is described by a probability density function on the set of profiles. We first solve the problem analytically in the case of two populations, with a uniform bonus-malus on the zones whe…
Background: While machine learning (ML) models are rapidly emerging as promising screening tools in critical care medicine, the identification of homogeneous subphenotypes within populations with heterogeneous conditions such as pediatric sepsis may facilitate attainment of high-predictive performance of these prognost…
While studying response trajectory, often the population of interest may be diverse enough to exist distinct subgroups within it and the longitudinal change in response may not be uniform in these subgroups. That is, the timeslope and/or influence of covariates in longitudinal profile may vary among these different sub…
Kernel testing compares cell states in single-cell data.
problem Comparing non-linear cell states in single-cell data.
method Kernel-based testing framework for non-linear distribution comparison.
result Identifies subtle population variations in cell states.
Tissue heterogeneity is a major confounding factor in studying individual populations that cannot be resolved directly by global profiling. Experimental solutions to mitigate tissue heterogeneity are expensive, time consuming, inapplicable to existing data, and may alter the original gene expression patterns. Here we a…
Differential privacy comes equipped with multiple analytical tools for the design of private data analyses. One important tool is the so-called "privacy amplification by subsampling" principle, which ensures that a differentially private mechanism run on a random subsample of a population provides higher privacy guaran…
Wide accessibility of imaging and profile sensors in modern industrial systems created an abundance of high-dimensional sensing variables. This led to a a growing interest in the research of high-dimensional process monitoring. However, most of the approaches in the literature assume the in-control population to lie on…
Distributional Random Forests for Complex Survey Designs on Reproducing Kernel Hilbert Spacesstat.ME
SDRF estimates complex survey designs for conditional distributions.
problem Estimating conditional distributions under complex survey designs.
method Survey-calibrated distributional random forest (SDRF) with pseudo-population bootstrap and MMD split criterion.
result Established design consistency and model consistency for survey designs.
Sparse multi-view matrix factorisation: a multivariate approach to multiple tissue comparisonsstat.ML
Gene expression levels in a population vary extensively across tissues. Such heterogeneity is caused by genetic variability and environmental factors, and is expected to be linked to disease development. The abundance of experimental data now enables the identification of features of gene expression profiles that are s…
Study data biases to predict algorithmic discrimination, developing a Data Bias Profile.
problem Data biases contribute to algorithmic discrimination, but their impact is understudied.
method Analyzed three common data biases across various datasets and models, developing a Data Bias Profile.
result Combination of proxies and label bias can lead to more significant discrimination than underrepresentation alone.
Recent developments in high throughput profiling of individual neurons have spurred data driven exploration of the idea that there exist natural groupings of neurons referred to as cell types. The promise of this idea is that the immense complexity of brain circuits can be reduced, and effectively studied by means of i…
The aim of this paper is to get an overview of the online buyer profile, and also some key aspects in the way the online shopping is conducted. In this project we conducted a quantitative research, consisting of a questionnaire based survey. For data processing and interpretation we used SPSS statistical software and E…
We extend multi-way, multivariate ANOVA-type analysis to cases where one covariate is the view, with features of each view coming from different, high-dimensional domains. The different views are assumed to be connected by having paired samples; this is a common setup in recent bioinformatics experiments, of which we a…
New model clusters cells and individuals, revealing genetic influences on cell types.
problem Clustering nested data with group-level and observation-level variables.
method Nested Atoms Model (NAM), Bayesian nonparametric approach.
result Identifies clusters of genetically similar individuals with homogeneous cell-type profiles.
Accurate facial expression analysis is an essential step in various clinical applications that involve physical and mental health assessments of older adults (e.g. diagnosis of pain or depression). Although remarkable progress has been achieved toward developing robust facial landmark detection methods, state-of-the-ar…
The paper develops methods to infer membership probabilities and rank network nodes using the DCMM model.
problem Understanding the latent structure of network data, especially in mixed-membership models.
method Degree-Corrected Mixed Membership (DCMM) model, novel finite-sample expansion, asymptotic distributions, confidence intervals, multiplier bootstrap method.
result Valid inference on membership probabilities and node rankings, quantifying uncertainty.
A method to produce personalized classification models to automatically review online dating profiles on Tinder is proposed, based on the user's historical preference. The method takes advantage of a FaceNet facial classification model to extract features which may be related to facial attractiveness. The embeddings fr…
A method to describe Riemann surfaces using graph profiles is proposed.
problem Describing Riemann surfaces in a graph-theoretic framework.
method Graph profiles to represent Riemann surfaces, establishing necessary and sufficient conditions for their existence.
result A criterion for the existence of Riemann surfaces with a given signature.
We study the forecasting of the power consumptions of a population of households and of subpopulations thereof. These subpopulations are built according to location, to exogenous information and/or to profiles we determined from historical households consumption time series. Thus, we aim to forecast the electricity con…
Microscopic models describing a whole of economic interactions in a closed society are considered. The presence of a tax system combined with a redistribution process is taken into account, as well as the occurrence of tax evasion. In particular, the existence is postulated, in relation to the level of evasion, of diff…
In cheminformatics, compound-target binding profiles has been a main source of data for research. For data repositories that only provide positive profiles, a popular assumption is that unreported profiles are all negative. In this paper, we caution audience not to take this assumption for granted, and present empirica…
Method controls extrapolation in prediction profiles for statistical and machine learning models.
problem Avoiding invalid predictions due to extrapolation in prediction profiles.
method Genetic algorithm optimization over constrained factor regions.
result Optimal factor settings without constraint are often invalid and extrapolated.
We equip many non compact non simply connected surfaces with smooth Riemannian metrics whose isoperimetric profile is smooth, a highly non generic property. The computation of the profile is based on a calibration argument, a rearrangement argument, the Bol-Fiala curvature dependent inequality, together with new result…
We introduce a spectrum of monotone coarse invariants for metric measure spaces called Poincaré profiles. The two extremes of this spectrum determine the growth of the space, and the separation profile as defined by Benjamini--Schramm--Timár. In this paper we focus on properties of the Poincaré profiles of groups with …
Logarithmic separation profile in hyperbolic groups shows hierarchical structure.
problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.
Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.
problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.
The profile of a sample is the multiset of its symbol frequencies. We show that for samples of discrete distributions, profile entropy is a fundamental measure unifying the concepts of estimation, inference, and compression. Specifically, profile entropy a) determines the speed of estimating the distribution relative t…
Study compares isoperimetric profiles on manifolds with integral Ricci curvature bounds.
problem Comparing isoperimetric profiles on manifolds with integral Ricci curvature bounds.
method Extending previous work, the study uses integral bounds on Ricci curvature to prove comparison results for isoperimetric profile functions.
result Comparison results for the Isoperimetric profile function in manifolds with integral bounds on Ricci curvature.
There has been a rapid proliferation of machine learning/deep learning (ML) models and wide adoption of them in many application domains. This has made profiling and characterization of ML model performance an increasingly pressing task for both hardware designers and system providers, as they would like to offer the b…
Estimates lower bounds for isoperimetric profiles and improves on previous estimates for specific manifolds.
problem Estimating lower bounds for isoperimetric profiles of specific Riemannian manifolds.
method Explicit lower bounds for isoperimetric profiles of Riemannian product manifolds.
result Improved lower bounds for isoperimetric profiles and Yamabe constants.
In the context of sub-Riemannian Heisenberg groups Hn, n \geq 1, we shall study Isoperimetric Profiles, which are closed compact hypersurfaces having constant horizontal mean curvature, very similar to ellipsoids. Our main goal is to study the stability of Isoperimetric Profiles.
Paper describes profiles of multivariate normal distributions and novel estimators for mutual information.
problem Estimating mutual information for complex distributions.
method Analytical description of profiles, introduction of Bend and Mix Models, Monte Carlo estimation.
result Bend and Mix Models accurately estimate mutual information profiles and provide Bayesian estimates.
Non-Negative Matrix Factorization, NMF, attempts to find a number of archetypal response profiles, or parts, such that any sample profile in the dataset can be approximated by a close profile among these archetypes or a linear combination of these profiles. The non-negativity constraint is imposed while estimating arch…
We study the behavior of a Time-Aware Long Short-Term Memory Autoencoder, a state-of-the-art method, in the context of learning latent representations from irregularly sampled patient data. We identify a key issue in the way such recurrent neural network models are being currently used and show that the solution of the…
Random layer-wise pruning profiles are as effective as metric-based ones for various datasets.
problem Reduction of model size and computational resources in neural networks.
method Conducted baseline experiments, developed RL-based search algorithm for finding transferable layer-wise pruning profiles.
result RL-based layer-wise pruning profiles are as good or better than best profiles found on the original dataset via exhaustive search.
Study lampshuffler groups' isoperimetric profiles, refining previous estimates.
problem Relate isoperimetric profiles of lampshuffler groups to their base groups.
method Use lamplighter subgraphs and halo products to find optimal upper bounds.
result Sharp estimates for exponential growth groups, including Brieussel-Zheng groups.
The study analyzes how large language models form and express investor risk profiles.
problem Understanding how large language models (LLMs) form and express investor risk profiles.
method Examined three LLMs (GPT, Gemini, and Llama) and assessed their responses to a standardized risk questionnaire under varying prompts.
result LLMs generally form long-term investment profiles, but they exhibit different risk tolerance levels.
A new framework for adaptive behavior using reusable value profiles.
problem Adaptive behavior in changing environments requires switching among value-control regimes, but maintaining separate parameters for each situation is impractical.
method Introduces value profiles: reusable bundles of parameters assigned to hidden states, allowing for state-conditional strategy recruitment without independent parameters for each context.
result Profile-based models outperform simpler alternatives in probabilistic reversal learning, suggesting belief-dependent control of adaptive behavior.
It is shown that, in dimensions , isoperimetric profiles of compact real analytic Riemannian manifolds are semi-analytic.
The hypercube's perimeter is significantly larger than expected near half volume.
problem Understanding the isoperimetric profile of the hypercube.
method Analytical proof of perimeter bounds and comparison to Gaussian isoperimetric profile.
result The isoperimetric profile of the hypercube does not converge to the Gaussian profile as dimension increases.
The first known example of a complete Riemannian manifold whose isoperimetric profile is discontinuous is given.