New bounds show multicalibration error is close to prediction error.
problem Addressing fairness in machine learning systems.
method Sample complexity bounds for uniform convergence of multicalibration error.
result Uniform convergence guarantees for multicalibration error, independent of prediction error.
Unified approach for multicalibration in weakly supervised learning.
problem Existing multicalibration methods require clean input-label pairs, which are unavailable in weakly supervised learning.
method Developed estimators and post-hoc correction methods for multicalibration under weak supervision.
result Unified framework for estimating and correcting multicalibration under weak supervision with finite-sample guarantees.
The paper provides convergence guarantees for multicalibration gradient boosting.
problem Understanding the convergence properties of multicalibration gradient boosting.
method Computational guarantees for multicalibration gradient boosting algorithms, including adaptive variants.
result The magnitude of successive prediction updates decays at O ( 1 / T ) O(1/\sqrt{T}) O ( 1/ T ) , leading to convergence in empirical multicalibration error. New algorithm achieves faster multicalibration in online settings.
problem Achieving fair predictions in online settings with limited interaction.
method Generalized multicalibration to arbitrary bounded hypothesis classes and introduced swap multicalibration. Proposed an oracle-efficient algorithm achieving faster multicalibration error.
result Oracle-efficient algorithm achieves T 1 / ( r + 1 ) T^{1/(r+1)} T 1/ ( r + 1 ) ℓ r \ell_r ℓ r -swap multicalibration error with high probability, improving on previous bounds. Unified theory and practical insights for multicalibration boosting.
problem Ensuring fairness and robustness in predictions over diverse functions.
method Developed a unified framework for multicalibration boosting under weaker conditions.
result Boosting iterates converge to a Bregman projection, characterizing multicalibration.
Loss minimization leads to multicalibration for neural networks.
problem Ensuring fairness in predictions across multiple protected groups.
method Minimizing squared loss over neural networks of size n.
result Minimizing loss over neural nets of size n implies multicalibration for most values of n.
Paper examines fairness of data augmentation methods, finding vanilla Mixup outperforms Fair Mixup.
problem Improving fairness in classification models with limited minority data.
method Uses multicalibration to rigorously evaluate and improve data augmentation methods for classification fairness.
result Vanilla Mixup outperforms Fair Mixup and baseline methods in fairness and accuracy, especially with small minority groups.
The paper introduces multicalibration to improve confidence scores in LLMs.
problem Improving the reliability and interpretability of confidence scores for LLMs.
method Forming groupings of prompt/completion pairs correlated with correctness, using clustering and self-annotation. Developing multicalibration algorithms to reduce overfitting.
result Our techniques yield confidence scores that significantly improve calibration and accuracy compared to existing methods.
Efficiently generates models resistant to falsification.
problem Creating models that cannot be disproven by tests.
method Exploits connections between high-dimensional multicalibration and expected variational inequality problems to develop an efficient algorithm.
result First to efficiently produce online outcome indistinguishable generative models resistant to infinite classes of tests.
We resolve the open problem of optimal sample complexity for multicalibration and deterministic predictors.
problem Optimal sample complexity for multicalibration and deterministic predictors
method Minimax-optimal multicalibration algorithm and generalization to OI predictors
result Minimax-optimal multicalibration algorithm and deterministic predictors with optimal sample complexity
Improved bounds for multicalibration and omniprediction in online and distributional settings.
problem Achieving efficient multicalibration and omniprediction in fairness and loss minimization.
method Proposed an efficient algorithm achieving improved rates for multicalibration and omniprediction.
result Achieved O ( T 1 3 ) O(T^{\frac{1}{3}}) O ( T 3 1 ) ℓ 2 \ell_{2} ℓ 2 -swap multicalibration error for convex Lipschitz functions. Study shows sample complexity for multicalibration is Θ(ε^-3) with polylogarithmic factors.
problem Minimizing Expected Calibration Error (ECE) for predictors with respect to a family of groups.
method Proved necessary and sufficient sample complexity of Θ(ε^-3) for multicalibration, using online-to-batch reduction and lower bounds.
result Sample complexity of multicalibration is Θ(ε^-3) with polylogarithmic factors, distinguishing it from marginal calibration.
Paper proves tight lower bounds for online multicalibration, separating it from marginal calibration.
problem Proving lower bounds for online multicalibration in relation to marginal calibration.
method Information-theoretic approach, constructing group families from orthonormal bases.
result Establishes tight lower bounds for online multicalibration, matching upper bounds up to logarithmic factors.
The paper shows how to use proxy attributes for fairness in machine learning models with missing sensitive group data.
problem Measuring and enforcing fairness in machine learning models with incomplete sensitive group data.
method Using proxy-sensitive attributes to derive upper bounds on multiaccuracy and multicalibration violations and adjust models to satisfy these fairness notions.
result Provable upper bounds on multiaccuracy and multicalibration violations can be derived using proxy-sensitive attributes in the absence of sensitive group data.
The paper introduces moment multicalibration for estimating uncertainty across subgroups.
problem Ensuring fairness and accurate uncertainty estimation in predictions across different subgroups.
method Develops a method for multicalibration of higher moments, enabling point predictions and interval estimation.
result Moment multicalibration allows for valid prediction intervals that are fair across various subgroups.
The paper proposes multicalibration to improve matching in graphs with imperfect predictors.
problem Finding the best matching in graphs with imperfect predictors.
method Introduces multicalibration as a fairness notion to ensure unbiasedness on protected sets of contexts.
result Constructing a multicalibrated predictor that outperforms standard optimal rules in matching algorithms.
New algorithm for online omniprediction with strong guarantees for continuous hypothesis classes.
problem Online adversarial learning with continuous hypothesis classes.
method Developed an oracle-efficient online multicalibration algorithm for infinite benchmark classes.
result First efficient online omnipredictor with strong guarantees for Lipschitz convex loss functions.
Framework for ensuring fairness in machine learning models across multiple groups.
problem Ensuring fairness in machine learning models across multiple groups.
method Introduces ( s , G , α ) − (\mathbf{s},\mathcal{G}, α)- ( s , G , α ) − GMC for multi-dimensional mappings and constraint sets, proposing algorithms to achieve multicalibration. result Demonstrates the effectiveness of the framework on various scenarios, including image segmentation, hierarchical classification, and text generation.
Unified framework for generalized Venn and Venn-Abers calibration for reliable prediction.
problem Asymptotic guarantees of popular distribution-free methods in model calibration.
method Unified framework extending Vovk's approach to generic loss functions, transforming predictors into set-valued predictions.
result Finite-sample set predictions shrink to a single conditionally calibrated prediction, capturing epistemic uncertainty.
New machine learning paradigm ignores loss function until action time.
problem Learning with unknown loss functions.
method Introduces omnipredictors for any loss function.
result Extracts predictive power from any class, ignoring loss function.
New algorithm improves accuracy of importance weights for diverse applications.
problem Improving accuracy of importance weights for various applications.
method Formulated multicalibrated partitions and developed an efficient algorithm.
result Algorithm significantly improves accuracy of importance weights.
As algorithms increasingly inform and influence decisions made about individuals, it becomes increasingly important to address concerns that these algorithms might be discriminatory. The output of an algorithm can be discriminatory for many reasons, most notably: (1) the data used to train the algorithm might be biased…
The paper addresses the difficulty of decision makers trusting AI-assisted predictions and proposes a method to improve confidence values.
problem Decision makers struggle to trust AI-assisted predictions based on confidence values.
method The paper investigates why decision makers have difficulties and proposes a method to construct more useful confidence values.
result Multicalibration with respect to the decision maker's confidence on her own predictions is a sufficient condition for alignment, leading to better decisions.
The study quantifies decision-making risks from suboptimal classifiers and proposes methods to reduce these risks.
problem Excess risk in decision-making from suboptimal probabilistic classifiers.
method Analytical expressions and upper/lower bounds for excess risk, calibration curve estimation, grouping loss estimator.
result Identifies regimes where recalibration alone or post-training is more effective.
High-dimensional ConvNets detect patterns in 32+ dimensions for geometric registration.
problem Detecting geometric patterns in high-dimensional spaces.
method High-dimensional convolutional networks applied to geometric registration problems.
result High-dimensional ConvNets outperform global pooling approaches in 3D registration and image correspondence.
This is an introductory article on high dimensional knots for the beginners. High dimensional knot theory is an exciting field. It is a field of knot theory, which is one of topology and is connected with many ones. In this article we use few literal expressions, equations, functions, etc. We barely suppose that the re…
An adaptive dropout approach improves high-dimensional Bayesian optimization.
problem High-dimensional black-box optimization problems.
method Adaptive dropout of variables in the acquisition function.
result AdaDropout effectively tackles high-dimensional challenges and improves solution quality.
Comparative learning combines realizable and agnostic settings for two hypothesis classes, reducing sample complexity.
problem Learning with two hypothesis classes in a more general setting than single hypothesis classes.
method Introduces comparative learning, defines mutual VC dimension and Littlestone dimension, and applies insights to multiaccuracy and multicalibration.
result Sample complexity of comparative learning is characterized by mutual VC dimension and Littlestone dimension.
The paper provides statistical guarantees for SGD and ASGD in high-dimensional settings.
problem Theoretical understanding of SGD and ASGD in high-dimensional settings.
method Transfer of tools from high-dimensional time series to online learning, using coupling techniques.
result Established geometric-moment contraction and q q q -th moment convergence of SGD and ASGD. High-dimensional data and high-dimensional representations of reality are inherent features of modern Artificial Intelligence systems and applications of machine learning. The well-known phenomenon of the "curse of dimensionality" states: many problems become exponentially difficult in high dimensions. Recently, the ot…
PROD method improves high-dimensional regression by handling strong correlations.
problem Violation of Irrepresentable Condition in LASSO for high-dimensional data.
method PROD procedure based on orthogonal decomposition of design matrix.
result PROD enhances performance of high-dimensional penalized regression.
A new BO method tackles high-dimensional optimization without reconstruction.
problem Optimizing high-dimensional black-box functions is challenging, especially when low-dimensional structures are assumed.
method Tackles the problem in the original high-dimensional space using learned low-dimensional structure.
result Our method explores the high-dimensional space more effectively than existing approaches.
HD-BWDM improves clustering validation in high-dimensional data.
problem Determining the right number of clusters in high-dimensional data.
method HD-BWDM integrates random projection, PCA, trimmed clustering, and medoid-based distances.
result HD-BWDM remains stable and interpretable under high-dimensional projections and contamination.
Solves clustering contradictions by high-dimensional embedding with wide gaps.
problem Kleinberg's clustering axioms are contradictory.
method Embedding in high-dimensional space with wide gaps between clusters.
result Handles clustering contradictions by design.
Machine learning improves high-dimensional matrix estimation.
problem Efficient estimation of high-dimensional matrices.
method Integrates machine learning with classical optimization algorithms for high-dimensional matrix estimation.
result The reparameterized LADMM achieves faster convergence and higher accuracy.
In this paper, we propose the idea of radial scaling in frequency domain and activation functions with compact support to produce a multi-scale DNN (MscaleDNN), which will have the multi-scale capability in approximating high frequency and high dimensional functions and speeding up the solution of high dimensional PDEs…
New method estimates treatment effects from high dimensional data.
problem Estimating treatment effects from high dimensional data with confounders.
method Generative modeling approach to backdoor adjustment in variational inference.
result Empirically, estimates interventional likelihood in high dimensional settings.
Estimates high-dimensional posterior densities by marginal distributions and neural networks.
problem High-dimensional probability density estimation for inference is difficult.
method Direct estimation of lower-dimensional marginal distributions, using Moment Networks for fast computation of moments.
result Demonstrates estimation of gravitational wave time series and applications in cosmology.
AF improves sampling from high-dimensional, multi-modal distributions.
problem Sampling from high-dimensional, multi-modal distributions is challenging.
method Annealing Flow (AF) using Continuous Normalizing Flow (CNF) with dynamic Optimal Transport (OT) objective and annealing procedures.
result AF significantly improves training efficiency and stability, outperforming state-of-the-art methods.
New method explains high-dimensional text classifiers.
problem Limited explainability tools for high-dimensional inputs and neural networks.
method Theoretical high-dimensional properties in neural networks.
result Improved explainability for neural network classifiers.
A new machine learning method solves high-dimensional Kolmogorov PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs and SDEs.
method Stochastic weighted minimization and stochastic gradient descent with Malliavin weights.
result Accurate approximation of high-dimensional Kolmogorov PDEs and SDEs without curse of dimensionality.
Anomaly detection for high-dimensional data using large deviations principle.
problem Challenges in anomaly detection for high-dimensional data.
method Large Deviations Anomaly Detection (LAD) algorithm.
result Outperforms state-of-the-art methods on high-dimensional data sets.
Proposes GPLFR for predicting high-dimensional outputs with few data.
problem Predicting high-dimensional outputs from limited data.
method GPLFR combines Gaussian process and linear-Gaussian decoding for high-dimensional prediction.
result GPLFR outperforms existing methods in predicting high-dimensional outputs.
Paper proposes new density estimators for high-dimensional data.
problem Prohibitive computational cost and slow convergence rate in high-dimensional density estimation.
method Adaptive hyperbolic cross density estimators in mixed smooth Sobolev spaces.
result Proposed estimators do not suffer curse of dimensionality under Integral Probability Metrics.
Study improves Hayashi-Yoshida estimator for high-dimensional stock covolatility.
problem Inconsistent performance of Hayashi-Yoshida estimator in high dimensions.
method Analyzed the limiting spectral distribution of the Hayashi-Yoshida estimator.
result Established the connection between the estimator's spectrum and the true covariance matrix in high dimensions.
New BO method efficiently optimizes high-dimensional functions by automatically selecting variables.
problem Efficiently optimizing functions with high-dimensional domains.
method Exploits variable selection to automatically learn sub-spaces without pre-specified dimensions.
result Empirically validated on synthetic and real problems, demonstrating efficiency.
Overview of high-dimensional time series regression methods.
problem Estimation and inference with high-dimensional time series data.
method Limit theory for high-dimensional dependent data, asymptotic theory for time series regression, statistical learning methods.
result Main limit theory results and asymptotic theory for high-dimensional time series regression.
In many fields of science, high-dimensional integration is required. Numerical methods have been developed to evaluate these complex integrals. We introduce the code i-flow, a python package that performs high-dimensional numerical integration utilizing normalizing flows. Normalizing flows are machine-learned, bijectiv…