arXiv research

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…

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

FGSV defends against shell company attacks in group data valuation.

New model clusters cells and individuals, revealing genetic influences on cell types.

BSD is a Bayesian framework for analyzing neural spectral data.

New framework for forecasting psychological processes from ILD.

Unimodal approach for group-level emotion recognition without individual features.

Improves clustering fairness by learning fair clusters adaptively.

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

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 …

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…

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…

Constellation learns group-level visual relationships for abstract reasoning.

GROOVE learns representations for weakly paired multimodal data.

In this review paper, we present several results on central extensions of the Lie algebra of symplectic (Hamiltonian) vector fields, and compare them to similar results for the Lie algebra of (exact) divergence free vector fields. In particular, we comment on universal central extensions and integrability to the group …

How do groups of individuals achieve consensus in movement decisions? Do individuals follow their friends, the one predetermined leader, or whomever just happens to be nearby? To address these questions computationally, we formalize "Coordination Strategy Inference Problem". In this setting, a group of multiple individ…

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…

Summarizing large-scaled directed graphs into small-scale representations is a useful but less studied problem setting. Conventional clustering approaches, which based on "Min-Cut"-style criteria, compress both the vertices and edges of the graph into the communities, that lead to a loss of directed edge information. O…

We present a Bayesian method for feature selection in the presence of grouping information with sparsity on the between- and within group level. Instead of using a stochastic algorithm for parameter inference, we employ expectation propagation, which is a deterministic and fast algorithm. Available methods for feature …

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

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…

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…

Genome-wide association studies (GWA studies or GWAS) investigate the relationships between genetic variants such as single-nucleotide polymorphisms (SNPs) and individual traits. Recently, incorporating biological priors together with machine learning methods in GWA studies has attracted increasing attention. However, …

LCMQR improves prediction intervals by adapting to local heteroscedasticity.

Proposes a method to cluster fMRI data and estimate brain connectivity networks.

Flexible co-data learning improves clinical prediction models.

Dirichlet Process(DP) is a Bayesian non-parametric prior for infinite mixture modeling, where the number of mixture components grows with the number of data items. The Hierarchical Dirichlet Process (HDP), is an extension of DP for grouped data, often used for non-parametric topic modeling, where each group is a mixtur…

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…

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…

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…

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…

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…

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…

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

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…

Unified framework for multi-source data analysis improves network structure identification.

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

Proposes a method for multilevel explanations of black-box models.

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

This work introduces a fair learning method for diverse sensitive attributes.

Personalized models using group attributes reduce performance, study finds.

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

Differential privacy is a leading protection setting, focused by design on individual privacy. Many applications, in medical / pharmaceutical domains or social networks, rather posit privacy at a group level, a setting we call integral privacy. We aim for the strongest form of privacy: the group size is in particular n…

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…

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…

Unified framework detects dynamic community structure in brain networks across individuals.

New method aligns brain surfaces based on functional signatures.