New welfare-based fairness notions align with existing error rate balance and predictive parity.
problem Aligning fairness notions with welfare-based criteria.
method Discussing and establishing conditions for envy freeness and prejudice freeness.
result Envy freeness and prejudice freeness are equivalent to error rate balance and predictive parity.
This paper tackles worst-class error rate in classification tasks.
problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.
Kernel balancing weights are generalized as KRRR, providing better confidence intervals for treatment effects.
problem Lack of generalization error, correct feature specification, and limited to average effects.
method Interpreting kernel balancing weights as KRRR, relaxing feature specification, and extending Gaussian approximation.
result KRRR provides strong generalization properties and justifies confidence sets for causal functions.
TempBalance improves neural network training by balancing learning rates across layers.
problem Improving neural network training performance.
method Layer-wise learning rate scheduling based on HT-SR Theory.
result TempBalance significantly outperforms ordinary SGD and state-of-the-art optimizers.
We propose a novel algorithm for learning fair representations that can simultaneously mitigate two notions of disparity among different demographic subgroups in the classification setting. Two key components underpinning the design of our algorithm are balanced error rate and conditional alignment of representations. …
Cross-balancing improves causal inference by balancing features with outcome data.
problem Balancing features for valid causal inference when outcome data is available.
method Cross-balancing using sample splitting to separate feature construction and weight estimation errors.
result Cross-balancing produces consistent, asymptotically normal, and efficient estimators under mild conditions.
New bounds for balanced classification improve understanding of imbalanced datasets.
problem Negligible size of the minority class in imbalanced datasets.
method Developed non-asymptotic and consistent bounds for balanced empirical risk minimization and balanced nearest neighbors estimates.
result Improved understanding of class-weighting benefits in real-world imbalanced classification settings.
Paper establishes convergence rates for learning elliptic pseudo-differential operators.
problem Learning elliptic pseudo-differential operators in partial differential equations.
method Wavelet-Galerkin framework, structured infinite-dimensional regression problem, sparse estimator, matrix compression, nested-support strategy.
result Obtained convergence rates for the estimator and efficient Galerkin solver.
Balancing graph summarization and change detection in streaming data.
problem Balancing compression rate in graph summarization and accuracy in change detection.
method Introducing a probabilistic hierarchical latent variable model and optimizing parameters based on the minimum description length principle to balance the trade-off.
result Guaranteed suppression of Type I error probability (false alarms) in change detection.
We propose a fair principal component analysis method that balances reconstruction error and subgroup fairness.
problem Fairness and robustness in principal component analysis for consequential domains.
method Distributionally robust optimization over the Stiefel manifold with a Riemannian subgradient descent.
result The proposed method achieves better performance on real-world datasets compared to state-of-the-art baselines.
The paper argues for using Neyman orthogonal score for balancing in debiased machine learning.
problem Debiased machine learning requires a proper approach to balance covariates.
method The paper advocates for using Riesz regression with basis functions of X for balancing.
result Covariate balancing is only valid when the score-relevant regression error is a function of covariates alone.
Compared to in-clinic balance training, in-home training is not as effective. This is, in part, due to the lack of feedback from physical therapists (PTs). Here, we analyze the feasibility of using trunk sway data and machine learning (ML) techniques to automatically evaluate balance, providing accurate assessments out…
Paper adapts ACI for online multi-step time-series forecasting with coverage guarantees.
problem Achieving reliable error bounds in online multi-step time-series forecasting.
method Adaptive conformal inference (ACI) adapted for multi-step forecasting with dynamic significance levels.
result Proposes a multi-step ACI algorithm with finite-sample coverage guarantees for non-exchangeable data.
Synthetic data augmentation can improve imbalanced classification metrics.
problem Improving imbalanced classification metrics
method Developing a framework for analyzing the effects of synthetic data augmentation on score-based classification
result Augmentation can improve AUROC, AUPRC, balanced accuracy, and F1 score
Symmetric losses improve classifier robustness from corrupted labels.
problem Improving classifier performance from corrupted labels.
method Symmetric losses that satisfy a certain condition.
result Symmetric losses enhance robust classification from corrupted labels.
We develop an axiomatic theory of balance functions (future value functions) in the theory of interest that is derived from financial considerations and which applies to general regulated payment streams, including continuous payment streams. Balance functions exist and are unique up to an initial choice of deposit and…
The paper addresses privacy in rank aggregation using randomized responses.
problem Preserving privacy while aggregating pairwise rankings.
method Adaptive debiasing method for randomized response rankings.
result Established minimax rates for estimation errors and optimal privacy guarantees.
Optimizes assortment decisions with a new OFU scheme for online choice problems.
problem Online assortment optimization under stochastic choice with revenue performance and inference quality considerations.
method Forced-exploration OFU scheme combining regularized estimators for decision making and inference.
result Explicit regret bound and error bounds for approximate optimistic actions, showing Pareto optimality.
We analyze the classical model of compound interest with a constant per-period payment and interest rate. We examine the outstanding balance function as well as the periodic payment function and show that the outstanding balance function is not generally concave in the interest rate, but instead may be initially convex…
This paper balances short-term and long-term rewards in policy learning.
problem Balancing short-term and long-term rewards in policy learning.
method Formalizes a new framework to balance rewards, identifies rewards under mild assumptions, deduces efficiency bounds, and develops a policy learning approach.
result The proposed method improves the estimator of long-term reward and reduces regret.
Inserting label noise can improve model accuracy and fairness.
problem Improving model accuracy and fairness with noisy labels.
method Increasing label noise rates to balance and detect noisy instances.
result Inserting label noise can lead to more accurate and fair models.
New model reveals balance crucial for robust neural coding.
problem Efficient neural coding in noisy, chaotic networks.
method Analytical model of balanced predictive coding with dissociated balance and weight disorder.
result Superclassical scaling in coding accuracy, independent of balance and weight disorder.
Quantizes symplectic fibrations to analyze vector bundles and metrics.
problem Quantizing higher rank vector bundles and understanding their metrics.
method Relates Berezin-Toeplitz quantization to hybrid systems and symplectic fibrations.
result Established refined estimates for computing balanced metrics on Kähler manifolds.
Adaptive weights improve physics-informed neural networks and deep operator networks.
problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.
Distributed Stochastic Gradient Descent (SGD) when run in a synchronous manner, suffers from delays in waiting for the slowest learners (stragglers). Asynchronous methods can alleviate stragglers, but cause gradient staleness that can adversely affect convergence. In this work we present a novel theoretical characteriz…
New mortgage contracts reduce underwater default by adjusting loan balances, but must balance prepayment incentives.
problem Underwater default incentives in mortgages.
method Analyzes automatic balance adjustment and prepayment penalties in mortgage contracts.
result Automatic balance adjustments are preferable to traditional contracts at certain spreads, reducing underwater default.
New method balances covariates for stable causal survival effect estimation.
problem Estimating causal survival effects in data with conditionally-independent censoring.
method Covariate-balancing approach to empirically stable and asymptotically efficient estimation.
result Validated theoretical results in synthetic and semi-synthetic data.
Enhances FDR control in variable selection using neural networks.
problem Balancing rigorous error control with statistical power in high-dimensional variable selection.
method Learning-augmented T-Rex Selector framework with a neural network trained on synthetic datasets.
result Achieves superior detection of true variables compared to existing approaches.
In graph-based active learning, algorithms based on expected error minimization (EEM) have been popular and yield good empirical performance. The exact computation of EEM optimally balances exploration and exploitation. In practice, however, EEM-based algorithms employ various approximations due to the computational ha…
This paper aims to provide a better understanding of a symmetric loss. First, we emphasize that using a symmetric loss is advantageous in the balanced error rate (BER) minimization and area under the receiver operating characteristic curve (AUC) maximization from corrupted labels. Second, we prove general theoretical p…
This paper uses PCA and FA for feature selection in credit rating.
problem Selecting important features for credit rating prediction.
method Principal Component Analysis and Factor Analysis.
result Factor Analysis reduces feature set significantly without losing much accuracy.
Agents buy and sell services. All services are of equal quality. Buyers choose sellers at random. Monetary and fiscal policies are imposed by a central bank and a central government. Credit is supplied by a commercial banking system. Propensities to buy, sell, and lend depend on account balances, interest rates, tax ra…
The ability to rank candidate architectures is the key to the performance of neural architecture search~(NAS). One-shot NAS is proposed to reduce the expense but shows inferior performance against conventional NAS and is not adequately stable. We investigate into this and find that the ranking correlation between archi…
Study shows convergence of anticanonically balanced metrics to Kähler-Einstein metrics on Fano manifolds.
problem Finding anticanonically balanced metrics on Fano manifolds.
method Simplification of Donaldson's proof using Berezin-Toeplitz quantization.
result Sequence of anticanonically balanced metrics converges to Kähler-Einstein metric.
Paper simplifies balancing weights by relaxing outcome assumptions.
problem Estimating missing outcomes in a target population.
method Relaxes outcome assumptions to simplify balancing weights.
result Balancing weights can be simplified with convex loss and minimum worst-case bias.
SA-PEF improves federated learning efficiency by correcting gradient mismatches.
problem Slow decay of residual error in federated learning under non-IID data.
method Integrates step-ahead correction with partial error feedback.
result Achieves faster convergence and target accuracy compared to standard EF.
As application demands for zeroth-order (gradient-free) optimization accelerate, the need for variance reduced and faster converging approaches is also intensifying. This paper addresses these challenges by presenting: a) a comprehensive theoretical analysis of variance reduced zeroth-order (ZO) optimization, b) a nove…
Large learning rates lead to various implicit biases in nonconvex optimization.
problem Understanding the conditions under which large learning rates yield edge of stability, balancing, and catapult phenomena.
method Developed a global convergence theory for nonconvex functions without globally Lipschitz continuous gradient, focusing on functions with good regularity.
result These implicit biases are more likely to occur in functions with good regularity, and large learning rates favor flatter regions.
Hierarchical GANs reduce anomaly detection costs.
problem Balancing anomaly detection accuracy and sampling costs.
method Hierarchical GANs for nonuniform sampling and buffer zones.
result Proposed GAN-based detector outperforms baseline in detection delay and average cost of error.
Recidivism prediction instruments (RPI's) provide decision makers with an assessment of the likelihood that a criminal defendant will reoffend at a future point in time. While such instruments are gaining increasing popularity across the country, their use is attracting tremendous controversy. Much of the controversy c…
Synthetic augmentation helps but not always in imbalanced learning.
problem Imbalanced learning causes poor performance on rare classes.
method Developed a statistical framework for synthetic augmentation in imbalanced learning.
result Synthetic augmentation is not always beneficial and depends on the imbalance regime.
A new sampling method called Restart improves both speed and quality of generative processes.
problem Balancing speed and quality in generative processes involving differential equations.
method Alternates between adding noise and following ODE, improving both speed and quality.
result Surpasses previous SDE and ODE samplers in both speed and accuracy.
Paper analyzes constant-product market making protocols.
problem Understanding and optimizing constant-product market making.
method Mathematical analysis of trade splitting and fee recompounding.
result Splitting trades does not affect final exchange rate.
Analyzes Indian commercial dynamism using time series data.
problem Understanding commercial dynamism in India.
method Time series analysis of various economic indicators.
result Detailed insights into growth rate, trade balance, etc.
The widespread use of ML-based decision making in domains with high societal impact such as recidivism, job hiring and loan credit has raised a lot of concerns regarding potential discrimination. In particular, in certain cases it has been observed that ML algorithms can provide different decisions based on sensitive a…
New insights into how large learning rates affect transformer training dynamics.
problem Understanding how large learning rates impact the training of transformer models.
method Analyzing a simplified linear transformer model with a two-factor product map.
result Large learning rates can lead to various training outcomes including cycles, chaos, or divergence.
Study controls error rates of binary classifiers using hypothesis testing.
problem Traditional binary classifiers have uncontrolled error rates.
method Combines binary classification with statistical hypothesis testing.
result Trained classifiers can be made to meet target error rate thresholds.
A new random forest algorithm improves tree construction for optimal performance.
problem Improving the performance of random forests, especially in complex and smooth scenarios.
method Adaptive split-balancing method using permutation-based splitting criterion.
result Achieves minimax optimality under various Lipschitz and Hölder classes.