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

56113169225 · Jun 202019922001200920172026
48 results for group-level variables

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.

We present a Bayesian nonparametric framework for multilevel clustering which utilizes group-level context information to simultaneously discover low-dimensional structures of the group contents and partitions groups into clusters. Using the Dirichlet process as the building block, our model constructs a product base-m…

2014-01-09abs ↗pdf ↗

BSD is a Bayesian framework for analyzing neural spectral data.

problem Challenges in statistical analysis and group-level comparisons of neural power spectra.
method Bayesian Spectral Decomposition (BSD) for parametric models of neural spectra.
result BSD outperforms existing methods in model selection and parameter estimation.

The paper analyzes how minority group imbalance affects neural network performance.

problem The impact of minority group imbalance on neural network performance.
method Formulated group imbalance problem with Gaussian Mixture Model, quantified sample complexity, convergence rate, and testing performance.
result Increasing the minority group fraction does not necessarily improve the generalization performance of the minority group.

Develops a method to estimate uncertainty for group-level recommendations in matrix completion.

problem Uncertainty estimation for group-level recommendations in matrix completion.
method Structured conformal inference method combining any matrix completion algorithm.
result Stronger group-level guarantees through structured calibration.

Models for sequential data such as the recurrent neural network (RNN) often implicitly model a sequence as having a fixed time interval between observations and do not account for group-level effects when multiple sequences are observed. We propose a model for grouped sequential data based on the RNN that accounts for …

2018-12-23abs ↗pdf ↗

We consider the problem of sparse variable selection in nonparametric additive models, with the prior knowledge of the structure among the covariates to encourage those variables within a group to be selected jointly. Previous works either study the group sparsity in the parametric setting (e.g., group lasso), or addre…

2012-06-18abs ↗pdf ↗

Many data-driven approaches exist to extract neural representations of functional magnetic resonance imaging (fMRI) data, but most of them lack a proper probabilistic formulation. We propose a group level scalable probabilistic sparse factor analysis (psFA) allowing spatially sparse maps, component pruning using automa…

2016-12-14abs ↗pdf ↗

We present the discrete infinite logistic normal distribution (DILN), a Bayesian nonparametric prior for mixed membership models. DILN is a generalization of the hierarchical Dirichlet process (HDP) that models correlation structure between the weights of the atoms at the group level. We derive a representation of DILN…

2011-03-24abs ↗pdf ↗

Sensor fusion is a key technology that integrates various sensory inputs to allow for robust decision making in many applications such as autonomous driving and robot control. Deep neural networks have been adopted for sensor fusion in a body of recent studies. Among these, the so-called netgated architecture was propo…

2018-10-08abs ↗pdf ↗

Proposes a robust optimization method for selecting grouped variables robustly.

problem Selecting grouped variables under data perturbations for regression and classification.
method Distributionally Robust Optimization (DRO) with Wasserstein uncertainty set.
result Coefficients in the same group converge to the same value as sample correlation approaches 1.

Constellation learns group-level visual relationships for abstract reasoning.

problem Learning configurational properties of entire groups of objects.
method Introduces Constellation, a network that learns relational abstractions over static visual scenes.
result Offers a basis for abstract relational reasoning and sensory imagination.

GROOVE learns representations for weakly paired multimodal data.

problem Learning representations for high-content perturbation data with weakly paired samples.
method GroupCLIP contrastive loss integrated with an autoencoder framework.
result GROOVE performs on par with or outperforms existing approaches for cross-modal tasks.

Distribution regression has recently attracted much interest as a generic solution to the problem of supervised learning where labels are available at the group level, rather than at the individual level. Current approaches, however, do not propagate the uncertainty in observations due to sampling variability in the gr…

2017-05-11abs ↗pdf ↗

Identifies patient-specific root causes of disease using structural equation models.

problem Detecting significant variables in complex diseases that differ between patients.
method Defining patient-specific root causes as exogenous errors in a structural equation model, quantifying predictivity using Shapley values, and developing a fast algorithm called Root Causal Inference.
result Significant improvements in accuracy by uncovering root causes with large effect sizes at the individual level but clinically insignificant effect sizes at the group level.

The paper proposes a method to measure fairness through equality of effort using algorithmic recourse.

problem Measuring fairness through equality of effort in automated systems.
method Applying algorithmic recourse to quantify equality of effort, overcoming previous limitations.
result An algorithm for assessing equality of effort has been developed and validated.

We present a new approach for transferring knowledge from groups to individuals that comprise them. We evaluate our method in text, by inferring the ratings of individual sentences using full-review ratings. This approach, which combines ideas from transfer learning, deep learning and multi-instance learning, reduces t…

2014-11-12abs ↗pdf ↗

GCAO improves clustering of high-dimensional data by grouping low-density boundary points.

problem Stability and accuracy of clustering in high-dimensional, non-uniform data.
method Group-level optimization with gravitational attraction and optimization.
result GCAO outperforms 11 clustering methods on multiple datasets.

Brain decoding is a data analysis paradigm for neuroimaging experiments that is based on predicting the stimulus presented to the subject from the concurrent brain activity. In order to make inference at the group level, a straightforward but sometimes unsuccessful approach is to train a classifier on the trials of a g…

2014-04-16abs ↗pdf ↗

Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an L1-regularized linear regression problem, commonly referred to as Lasso or Basis Pursuit. In this work we combine the sparsity-inducing property of the Lasso model at the indivi…

2010-06-07abs ↗pdf ↗

In this paper, we consider the joint task of simultaneously optimizing (i) the weights of a deep neural network, (ii) the number of neurons for each hidden layer, and (iii) the subset of active input features (i.e., feature selection). While these problems are generally dealt with separately, we present a simple regula…

2016-07-02abs ↗pdf ↗

A novel validation method improves feature importance analysis in subject-specific ML models.

problem Limited effectiveness of general ML models trained on large datasets for individual patient outcomes.
method A novel validation approach using a general ML model with repeated trials and random seed variation.
result Consistent identification of key features at the subject level and improved group-level feature importance analysis.

Fairness in algorithmic decision-making processes is attracting increasing concern. When an algorithm is applied to human-related decision-making an estimator solely optimizing its predictive power can learn biases on the existing data, which motivates us the notion of fairness in machine learning. while several differ…

2018-06-13abs ↗pdf ↗

In high dimensional settings, sparse structures are crucial for efficiency, either in term of memory, computation or performance. In some contexts, it is natural to handle more refined structures than pure sparsity, such as for instance group sparsity. Sparse-Group Lasso has recently been introduced in the context of l…

2016-02-19abs ↗pdf ↗

From human crowds to cells in tissue, the detection and efficient tracking of multiple objects in dense configurations is an important and unsolved problem. In the past, limitations of image analysis have restricted studies of dense groups to tracking a single or subset of marked individuals, or to coarse-grained group…

2017-12-22abs ↗pdf ↗

This note is concerned with an accurate and computationally efficient variational bayesian treatment of mixed-effects modelling. We focus on group studies, i.e. empirical studies that report multiple measurements acquired in multiple subjects. When approached from a bayesian perspective, such mixed-effects models typic…

2019-03-21abs ↗pdf ↗

We mathematically compare four competing definitions of group-level nondiscrimination: demographic parity, equalized odds, predictive parity, and calibration. Using the theoretical framework of Friedler et al., we study the properties of each definition under various worldviews, which are assumptions about how, if at a…

2018-08-26abs ↗pdf ↗

Develops a new criterion for subgroup fairness in algorithmic decision support.

problem Identifying fair recommendations in algorithms despite group-level differences.
method IJDI criterion and IJDI-Scan approach to detect and mitigate disparities.
result Identifies significant disparities in recommendations across subpopulations.

An anologue of the Calabi invariant for Poisson manifolds is considered. For any Poisson manifold PP, the Poisson bracket on C(P)C^{\infty}(P) extends to a Lie bracket on the space Ω1(P)Ω^{1}(P) of all differential one-forms, under which the space Z1(P)Z^{1}(P) of closed one-forms and the space B1(P)B^{1}(P) of exact one-forms a…

1996-05-05abs ↗pdf ↗

Personalized models using group attributes reduce performance, study finds.

problem Reducing performance of models using group attributes like race or gender.
method Formal conditions and collective preference guarantees to ensure fair use.
result Models personalized with group attributes reduce performance at a group level.

ABROCA assesses algorithmic bias, revealing skewed distributions that inflate results.

problem Detecting nuanced performance differences in classifier fairness.
method Study of ABROCA metric's statistical properties under various conditions.
result ABROCA distributions are skewed, inflating results by chance in imbalanced classes.

Most previous studies on multi-agent reinforcement learning focus on deriving decentralized and cooperative policies to maximize a common reward and rarely consider the transferability of trained policies to new tasks. This prevents such policies from being applied to more complex multi-agent tasks. To resolve these li…

2019-09-27abs ↗pdf ↗

LCMQR improves prediction intervals by adapting to local heteroscedasticity.

problem Efficient and adaptive prediction intervals for local heteroscedasticity.
method LCMQR combines multi-quantile information with kernel-based localization.
result LCMQR constructs tighter intervals than prior methods, especially in heterogeneous environments.