Bayesian method improves group-level regression uncertainty.
problem Uncertainty in group-level labels.
method Bayesian distribution regression with neural network framework.
result Improved robustness and performance with varying group sizes.
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.
169,341 papers · 148 categories
Trend · papers per month
48 results for “group-level labels”
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…
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.
FGSV defends against shell company attacks in group data valuation.
problem Shell company attacks on group-level data valuation.
method Developed a provably fast and accurate approximation algorithm for FGSV.
result Empirical results show significant improvement in computational efficiency and accuracy.
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.
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.
Optimized deep learning architectures improve sensor fusion performance.
problem Sensor fusion in autonomous systems.
method Proposed two optimized architectures: coarser-grained and two-stage gated.
result Significant performance improvements and robustness in noisy conditions.
Unimodal approach for group-level emotion recognition without individual features.
problem Privacy issues in individual-based emotion recognition models.
method Frugal approach using global features, state-of-the-art and synthetic corpora.
result 59.13% accuracy on VGAF test set, 11th place in EmotiW Challenge 2020.
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.
Structured Conformal Inference for Matrix Completion with Applications to Group Recommender Systemsstat.ME
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.
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.
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…
Scalable psFA for fMRI data extracts sparse components.
problem Extracting neural representations from fMRI data with probabilistic formulation.
method Group level scalable probabilistic sparse factor analysis (psFA) with spatial sparsity, component pruning, and heteroscedastic noise modeling.
result Sparse components similar to group ICA and reduced noise in activated areas.
Proposes a new RNN model for grouped sequential data with varying time intervals.
problem Implicitly models fixed time intervals between observations and lacks group-level effects.
method Mixed membership framework for RNN, learning group-level base parameter.
result Demonstrates dynamic topic modeling with evolving topic distributions over time.
Framework infers coordination strategies from movement data.
problem Inferring individual movement strategies from group data.
method Formalizes Coordination Strategy Inference Problem; provides methodology to infer strategies.
result Framework accurately infers strategies in simulated and real-world datasets.
New method tracks all bees in a hive with high accuracy.
problem Efficient tracking of multiple objects in dense configurations.
method Combining CNNs with U-Net architecture and temporal regularities.
result Near human-level performance with reduced network size.
Improves clustering fairness by learning fair clusters adaptively.
problem Fairness in deep clustering, especially for protected status variables.
method Formulates group-level fairness as ILP, integrates into discriminative deep clustering, refines learning algorithm.
result Consistently outperforms fair clustering algorithms on real-world datasets.
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.
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…
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.
Review of central extensions for symplectic and divergence-free vector fields.
problem Comparing central extensions of symplectic and divergence-free vector fields.
method Analyzing universal central extensions and integrability.
result Similar results for both types of vector fields.
Develops new tests for high-dimensional models with mixed signal strengths.
problem Challenges in testing models with many signals and high-dimensional data.
method Moment matching formulation for developing new tests.
result Demonstrates optimality of GRIP test for various model types.
New framework for forecasting psychological processes from ILD.
problem Forecasting psychological processes at the individual level from ILD.
method A novel modeling framework addressing challenges in ILD.
result Improved forecasting of psychological processes at the individual level.
A new model identifies genetic risk factors using gene-level priors.
problem Identifying genetic risk factors from nucleotide-level genetic variants.
method Sparse Group Lasso with Group-level Graph structure (SGLGG) model.
result SGLGG effectively identifies phenotype-associated risk SNPs.
Novel equations for nonsmooth level sets on Heisenberg group.
problem Parametrizing level sets of irregular maps on the Heisenberg group.
method Rough path theory equations for sub-Riemannian geometry.
result Well-posedness and calculus on nonsmooth level sets.
A new model for multi-level non-parametric admixture modeling.
problem Non-parametric topic modeling with shared distributions across levels.
method Nested Hierarchical Dirichlet Processes (nHDP) with a multi-level Chinese Restaurant Franchise (nCRF) representation.
result Significantly better generalization and detection of missing author entities.
We study proper, isometric actions of nonsolvable discrete groups Gamma on the 3-dimensional Minkowski space R^{2,1} as limits of actions on the 3-dimensional anti-de Sitter space AdS^3. To each such action is associated a deformation of a hyperbolic surface group Gamma_0 inside O(2,1). When Gamma_0 is convex cocompact…
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…
The paper compares fairness criteria in algorithmic decision-making.
problem Fairness in machine learning algorithms can lead to biases and disparities.
method The study examines three fairness criteria: Color-blind, Demographic Parity, and Equalized Odds.
result Equalized Odds (EO) is the only criterion that removes group-level disparity.
Study shows multisite fMRI data can be used reliably, slightly reducing detection power but not prediction accuracy.
problem Systematic biases in connectivity measures across multiple sites in fMRI studies.
method Empirical analysis of real multisite fMRI datasets and Monte-Carlo simulations.
result Multisite fMRI data can be used reliably, but slightly decreases detection power in statistical tests and prediction accuracy.
New screening rules speed up Sparse-Group Lasso solving.
problem Efficiently solving Sparse-Group Lasso in high dimensions.
method Adapted safe screening rules for Sparse-Group Lasso.
result Significant speed-ups in computing time for coordinate descent.
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 , the Poisson bracket on extends to a Lie bracket on the space of all differential one-forms, under which the space of closed one-forms and the space of exact one-forms a…
Accurate Bayesian analysis for mixed-effects studies.
problem Statistical significance and inter-individual differences in group studies.
method Variational Bayesian approach for hierarchical mixed-effects models.
result Accurate assessment of group-level effects and inter-individual differences.
The paper compares different fairness definitions under various worldviews.
problem Avoiding disparity amplification under different worldviews.
method Mathematical comparison of four fairness definitions using a theoretical framework.
result Different worldviews require different fairness definitions to avoid disparity amplification.
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…
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.
This work introduces a fair learning method for diverse sensitive attributes.
problem Fairness in supervised learning with complex sensitive attributes.
method Neural network with a simple random sampler for fairness penalties.
result The method improves fairness and utility on benchmark data.
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.
The -length of a knot is a braid group invariant equaling its level number.
problem Finding a numerical invariant for knot positions.
method Using braid group on two points in the torus to describe and calculate the -length.
result The -length equals the level number of a knot.
The group lasso is a penalized regression method, used in regression problems where the covariates are partitioned into groups to promote sparsity at the group level. Existing methods for finding the group lasso estimator either use gradient projection methods to update the entire coefficient vector simultaneously at e…
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.
New method aligns brain surfaces based on functional signatures.
problem Inter-individual variability in neuroimaging data.
method Fused Unbalanced Gromov-Wasserstein (FUGW) based on Optimal Transport.
result FUGW significantly increases between-subject correlation of activity.
New fairness measures account for prediction uncertainties to detect bias.
problem Fairness of ML models is not well-defined and measures are limited.
method Introduce new fairness measures based on aleatoric and epistemic uncertainties.
result Uncertainty-based measures reveal bias not captured by existing measures.
Bayesian Additive Distribution Regression (DistBART) predicts distributions from grouped data.
problem Predicting distributions from grouped data with varying characteristics.
method Bayesian nonparametric approach using BART for modeling the regression function.
result Empirical and theoretical evidence supports DistBART's effectiveness in learning from low-dimensional marginals.
Proposes a model for multi-agent reinforcement learning with hierarchical graph attention network.
problem Limited transferability of trained policies to new multi-agent tasks.
method Uses hierarchical graph attention network for representation learning and multi-agent actor-critic for policy learning.
result Demonstrates superior performance in mixed cooperative and competitive tasks compared to existing methods.
Paper proposes a new algorithm to minimize AUC disparities in machine learning models.
problem Minimizing unfairness in AUC scores for machine learning models.
method Proposes a minimax learning and bias mitigation framework for AUC optimization.
result Proves the convergence of the proposed algorithm to minimize group-level AUC.