A new CVaR test reduces group performance disparity detection complexity.
problem Detecting performance disparities across multiple sensitive groups in ML models.
method Conditional Value-at-Risk (CVaR) testing to reduce sample complexity.
result Sample complexity reduced exponentially to be at most the square root of the number of groups.
Spectral methods achieve near-optimal performance in orthogonal and permutation group synchronization.
problem Recovering group elements from pairwise measurements in computer vision.
method Spectral methods applied with the leave-one-out technique.
result Near-optimal performance bounds for orthogonal and permutation group synchronization established.
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.
New algorithm improves group fairness in social classification problems by exploiting performativity.
problem Inequities in social classification problems due to performativity.
method Develops algorithmic fairness practices that leverage performativity to achieve stronger group fairness guarantees.
result Achieves stronger group fairness guarantees compared to non-performative settings.
This paper improves model robustness to underrepresented groups using ranking metrics and reweighting.
problem Underrepresented groups suffer from low accuracy in models trained via ERM.
method Proposes Discounted Cumulative Gain (DCG) and Discounted Rank Upweighting (DRU) methods.
result Models trained with DRU show superior generalization to unseen groups.
Study identifies negative data externalities affecting model performance on specific groups.
problem Negative data externalities on group performance in machine learning models.
method Characterized and detected data-model inefficiencies, focusing on specific types of externalities.
result Negative data externalities can lower model performance on specific sub-groups, even with larger datasets.
New method improves grouped convolutions on edge devices.
problem Efficiently implementing grouped convolutions on edge devices.
method Grouped Spatial Pack Convolutions (GSPC) in TVM.
result GSPC outperforms existing implementations by 3.4x, 8x, and 4x on average.
Proposes a method to select fair performance metrics through metric elicitation.
problem Choosing fair performance metrics in multiclass classification with multiple sensitive groups.
method Metric elicitation strategy that requires only relative preference feedback and is robust to noise.
result Elicits group-fair performance metrics for multiclass classification problems.
Paper proposes a new method for more accurate group testing of infected patients.
problem Identifying infected patients efficiently with reduced tests and corrected errors.
method Adaptive design of pools based on Bayesian posterior prediction using belief propagation algorithm.
result The proposed method results in more accurate identification of infected patients.
Extends ML fairness to handle minority groups over time.
problem Limitations of existing fairness criteria.
method Performative Distributionally Robust Optimization.
result Improves fairness for minority groups over time.
Proposes group whitening to enhance deep learning models' performance.
problem Improving learning efficiency and representational capacity in deep learning models.
method Group Whitening (GW) combines whitening and group normalization to balance these aspects.
result Group Whitening consistently improves model performance across different architectures and benchmarks.
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.
Most systems and learning algorithms optimize average performance or average loss -- one reason being computational complexity. However, many objectives of practical interest are more complex than simply average loss. This arises, for example, when balancing performance or loss with fairness across people. We prove tha…
JTT improves model worst-group accuracy without group annotations.
problem Low worst-group accuracy in standard ERM models with spurious correlations.
method Two-stage approach: first ERM, then upweight misclassified examples.
result JTT closes 75% of the gap in worst-group accuracy compared to group DRO.
Unified approach for fair classification with overlapping groups.
problem Ensuring fairness across multiple overlapping groups in prediction problems.
method Probabilistic population analysis leading to Bayes-optimal classifier, unifying existing methods.
result Outperforms baselines in fairness-performance tradeoff on real datasets.
FairACE improves fairness in GNNs by balancing node performance across degree groups.
problem Degree biases in GNNs lead to unequal prediction performance among nodes with varying degrees.
method Integrates asymmetric contrastive learning with adversarial training to balance performance between high-degree and low-degree nodes.
result Significantly improves degree fairness metrics while maintaining competitive accuracy.
MixMax improves model performance across different settings using convex optimization.
problem Worst-case performance in group distributionally robust optimization for non-convex and non-parametric models.
method Reparameterizing group DRO from parameter space to function space, resulting in a convex optimization problem.
result MixMax matches or outperforms standard group DRO baselines, improving XGBoost performance on specific datasets.
Machine learning approaches have been effective in predicting adverse outcomes in different clinical settings. These models are often developed and evaluated on datasets with heterogeneous patient populations. However, good predictive performance on the aggregate population does not imply good performance for specific …
In Stochastic blockmodels, which are among the most prominent statistical models for cluster analysis of complex networks, clusters are defined as groups of nodes with statistically similar link probabilities within and between groups. A recent extension by Karrer and Newman incorporates a node degree correction to mod…
Extends causal discovery to group variables, improving performance in real-world applications.
problem Inferring cause-effect relationships from grouped data.
method Two-step approach: infer causal order and select models.
result Strong performance in simulations and real-world assembly line data.
Proposes Robust Matrix Factorization with Grouping Effect (GRMF) for better performance and robustness.
problem Improves matrix factorization by incorporating grouping effect for better performance and robustness.
method Integrates grouping effect into matrix factorization, using an efficient alternating minimization framework with DC programming and ADMM.
result Demonstrates improved performance and robustness compared to five benchmark algorithms on real-world data sets with outliers and noise.
A new technique normalizes nodes within groups to improve GNN performance.
problem Over-smoothing in deeper GNNs reduces node distinguishability.
method Differentiable group normalization (DGN) to separate node distributions among groups.
result DGN makes GNN models more robust to over-smoothing and achieves better performance with deeper GNNs.
ComEx protocol reduces communication costs in cooperative bandits.
problem Minimizing communication costs in cooperative bandits while maintaining optimal performance.
method Developed ComEx protocol to reduce communication from Θ(T) to O(logT) messages. result Achieves state-of-the-art performance with significantly reduced communication cost.
Using ensemble methods for regression has been a large success in obtaining high-accuracy prediction. Examples are Bagging, Random forest, Boosting, BART (Bayesian additive regression tree), and their variants. In this paper, we propose a new perspective named variable grouping to enhance the predictive performance. Th…
Proposes a two-stage method for selecting correlated predictors in high-dimensional data.
problem Selecting correlated predictors in high-dimensional data with unknown group structures.
method Two-stage approach: variable clustering followed by group selection.
result The two-stage method improves prediction accuracy and active predictor selection.
Paper tackles group robustness with partially labeled data.
problem Learning invariant representations from datasets with spurious correlations.
method Constructs a constraint set and derives a high probability bound for group assignment. Proposes an optimization algorithm for worst-off group assignments.
result Improvements in minority group's performance while preserving overall accuracy.
ROME improves algorithmic fairness by learning latent group structure robustly.
problem Latent subgroup disparities and distribution shifts in machine learning models.
method ROME uses an Expectation-Maximization algorithm for linear models and a neural Mixture-of-Experts for nonlinear settings.
result ROME significantly improves fairness compared to standard methods while maintaining average performance.
Optimal classification requires choosing the right group symmetries, contrary to intuition.
problem Improving binary classification performance by selecting appropriate group symmetries.
method Developed a theoretical framework for designing group equivariant neural networks.
result Optimal classification performance is achieved by selecting the appropriate subgroups of symmetries, not the largest equivariant groups.
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.
Paper tackles inconsistent CATE estimation across group assignments.
problem Inconsistent learning behavior for the same instance across different group assignments.
method CLAGA method to eliminate inconsistency.
result Significant performance improvements with CLAGA method.
Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector β* given n noisy observations. Naturally, we want this superset to be as small as possible. We propose a novel framework for screening, which we refer to as Multiple Grouping (MuG), that groups variables, pe…
Improves AUC for disadvantaged groups by adding features.
problem Reducing cross-group differences in AUC for classification models.
method Feature augmentation to improve AUC for disadvantaged groups.
result Significantly improves AUC for disadvantaged groups.
Improves model robustness to shifts in subpopulations.
problem Poor performance of ML models under data distribution shifts.
method Develops group-aware priors (GAP) over neural network parameters.
result Training with GAP yields state-of-the-art performance.
Gradient boosting predicts promotion efficiency using multiple performance indicators.
problem Forecasting promotion efficiency in FMCG retail.
method Gradient boosting applied to six performance indicators for different product groups.
result Models accurately forecast promotion efficiency, optimizing marketing strategies.
SharedRep-RLHF learns shared traits for diverse groups, improving fairness and performance.
problem Uniform-reward RLHF fails to capture diverse preferences, leading to unfairness.
method SharedRep-RLHF learns shared traits among various groups, improving fairness and performance.
result SharedRep-RLHF outperforms MaxMin-RLHF by up to 20% in win rate.
Toward enabling next-generation robots capable of socially intelligent interaction with humans, we present a computationalmodel of interactions in a social environment of multiple agents and multiple groups. The Multiagent Group Perception and Interaction (MGpi) network is a deep neural network that predi…
The paper characterizes Alexander quandles of finite groups.
problem Characterizing Alexander quandles of finite groups.
method Using group theory and automorphism groups, the paper provides characterizations of Alexander quandles.
result Generalized Alexander quandles of finite groups are characterized in terms of automorphism groups and underlying groups.
SON-GOKU uses graph coloring to improve multi-task learning by partitioning tasks into compatible groups.
problem Gradient interference between conflicting multi-task learning objectives slows convergence and model performance.
method SON-GOKU computes gradient interference, constructs an interference graph, and applies greedy graph-coloring to partition tasks.
result SON-GOKU consistently outperforms baselines and state-of-the-art multi-task optimizers on six datasets.
Credit scores misclassify borrowers, especially minorities, leading to inequitable access.
problem Misclassification of borrowers by credit scores, particularly minorities.
method Benchmarked a widely used credit score against a machine learning model.
result Machine learning model improves predictive accuracy for low-quality data, leading to more equitable access.
Bayesian design improves accuracy without extra cost.
problem Nested inference in complex systems limits BED accuracy and efficiency.
method Grouped geometric pooled posterior with EKI formulation.
result Improved accuracy and stable estimators at comparable cost.
Group personalization improves FL performance in heterogeneous client data.
problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.
Online selection of dynamic features has attracted intensive interest in recent years. However, existing online feature selection methods evaluate features individually and ignore the underlying structure of feature stream. For instance, in image analysis, features are generated in groups which represent color, texture…
E2GC optimizes energy efficiency in DNNs by balancing computational and data movement costs.
problem Imbalance between computational complexity and data reuse in GConv leads to suboptimal energy efficiency.
method Developed an optimum group size model and proposed E2GC module with constant group size.
result E2GC modules improve energy efficiency by 10.8% and 4.73% on P100 and P4000 GPUs, respectively.
Whereas previous post-processing approaches for increasing the fairness of predictions of biased classifiers address only group fairness, we propose a method for increasing both individual and group fairness. Our novel framework includes an individual bias detector used to prioritize data samples in a bias mitigation a…
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.
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…
A new method improves AI fairness assessment by estimating performance across intersectional subgroups.
problem Limited evaluation of AI systems across intersectional subgroups due to small sample sizes.
method Structured regression approach to disaggregated evaluation.
result Our method yields more accurate performance estimates, especially for small subgroups.
Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for c…