Nesterov's extrapolation improves convergence in nonsmooth optimization.
problem Improving convergence rate in nonsmooth convex optimization.
method Nesterov's extrapolation applied to projected subgradient methods.
result Nesterov's extrapolation optimizes individual convergence for nonsmooth problems.
Algorithm learns similarity metrics for individual fairness.
problem Difficulty in learning similarity metrics for individual fairness.
method Gradient descent and Bradley-Terry model for pairwise comparisons.
result Algorithm converges to ground truth metric for individual fairness.
Paper tackles estimating individual treatment effects from observational data.
problem Estimating the difference between outcomes with and without treatment from single observation.
method Formulated as inference from hidden variables, uses a model of four causal populations, proposes ECM algorithm.
result ECM algorithm provides better performance compared to baseline methods on synthetic and real-world data.
Gradient boosting method enforced with individual fairness.
problem Enforcing fairness in machine learning models.
method Functional gradient descent on robust loss function.
result Algorithm converges globally and generalizes.
Optimal SGD rates achieved with shuffling, covering non-convex and convex cases.
problem Optimizing finite-sum optimization problems with shuffling strategies.
method RandomShuffle and SingleShuffle algorithms for SGD, analyzing convergence rates.
result Minimax optimal convergence rates established, generalizing to non-convex costs.
Minimizing a function over an intersection of convex sets is an important task in optimization that is often much more challenging than minimizing it over each individual constraint set. While traditional methods such as Frank-Wolfe (FW) or proximal gradient descent assume access to a linear or quadratic oracle on the …
We present a convergence rate analysis for biased stochastic gradient descent (SGD), where individual gradient updates are corrupted by computation errors. We develop stochastic quadratic constraints to formulate a small linear matrix inequality (LMI) whose feasible points lead to convergence bounds of biased SGD. Base…
This paper studies convergence behavior of latent mixing measures that arise in finite and infinite mixture models, using transportation distances (i.e., Wasserstein metrics). The relationship between Wasserstein distances on the space of mixing measures and f-divergence functionals such as Hellinger and Kullback-Leibl…
Study online learning with individual fairness without known similarity measure.
problem Online learning with individual fairness constraints without a known similarity measure.
method Reduction to standard online classification, leveraging auditor feedback.
result Achieves sub-linear regret and fairness violations with stochastic data.
Proposes a model to handle mobile health data with irregular measurements.
problem Handling heterogeneous, multi-resolution data in mobile health.
method Individualized dynamic latent factor model for irregular multi-resolution time series data.
result Superior performance compared to existing methods in simulation and smartwatch data applications.
Adaptive gradient methods such as Adam have been shown to be very effective for training deep neural networks (DNNs) by tracking the second moment of gradients to compute the individual learning rates. Differently from existing methods, we make use of the most recent first moment of gradients to compute the individual …
An algorithm is presented for momentum gradient descent optimization based on the first-order differential equation of the Newtonian dynamics. The fictitious mass is introduced to the dynamics of momentum for regularizing the adaptive stepsize of each individual parameter. The dynamic relaxation is adapted for stochast…
DGSAM improves domain generalization by minimizing individual sharpness.
problem Improving domain generalization models that perform well on unseen target domains.
method Shifts DG paradigm toward minimizing individual sharpness across source domains.
result DGSAM reduces performance variance across domains with less computational overhead.
Study efficient inference for network quantile causal effects with partial interference.
problem Estimating network causal effects on outcome quantiles with partial interference.
method Developed a nonparametric efficiency theory and a nonparametrically efficient estimator using a three-way cross-fitting procedure.
result Proposed estimator is consistent, asymptotically normal, and allows flexible estimation of nuisance functions.
Method learns optimal treatment sequences from observational data.
problem Optimal dynamic treatment regimes for public policies and medical interventions.
method Doubly robust classification-based approach via backward induction.
result Achieves optimal convergence rate of n^(-1/2) for welfare regret.
Proposes a framework to create fair IDRs by enforcing demographic parity constraints.
problem Discrimination in IDRs trained on biased data.
method Incorporates DP and CDP constraints into IDR estimation.
result Theoretically optimal IDRs can be efficiently obtained through perturbations.
Optimal privacy-preserving ranking from noisy comparisons.
problem Protecting individual privacy in ranking from noisy comparisons.
method Differentially private ranking algorithms under edge and individual differential privacy.
result Achieved minimax optimal rates of convergence under privacy constraints.
New method estimates optimal dose intervals for personalized treatment.
problem Learning optimal dose intervals from observational data.
method Probability dose interval (PDI) method using DC algorithm.
result Consistent policy with risk converging to best-in-class at root-n rate.
Optimizes contrastive learning with individualized temperatures for better performance on imbalanced datasets.
problem The common practice of using a global temperature parameter ignores the varying semantic similarity across different anchor data.
method Proposes a new robust contrastive loss inspired by distributionally robust optimization (DRO) and an efficient stochastic algorithm for automatic temperature individualization.
result Our method automatically learns a suitable temperature for each sample, improving performance on imbalanced datasets.
The paper develops methods to estimate optimal treatment sequences under policy constraints.
problem Estimating the best sequence of treatments over multiple stages for individuals.
method Empirical welfare maximization approach, solving treatment assignment sequentially or simultaneously.
result Established convergence rates and upper bounds for estimation methods.
Random permutations can offer faster convergence than with-replacement sampling for some functions.
problem Understanding when and how random permutations outperform with-replacement sampling in SGD convergence.
method Analyzing convergence rates for different function classes (1D strongly convex, general strongly convex, quadratic strongly convex).
result The optimal convergence gap between random and permutation-based SGD varies from exponential to nonexistent, depending on the function class.
We develop a simple routine unifying the analysis of several important recently-developed stochastic optimization methods including SAGA, Finito, and stochastic dual coordinate ascent (SDCA). First, we show an intrinsic connection between stochastic optimization methods and dynamic jump systems, and propose a general j…
New algorithm for collective Gaussian hidden Markov models inference.
problem Inference of collective Gaussian hidden Markov models from aggregate data.
method Collective Gaussian forward-backward algorithm, extending Sinkhorn belief propagation.
result Convergence guarantee and applicability to single individual Kalman filter.
Local Bayesian optimization shows strong performance and converges well, contrary to folklore.
problem Understanding the behavior and convergence of local Bayesian optimization methods.
method Studied the behavior of local optimization strategies and rigorously analyzed a specific algorithm.
result Local Bayesian optimization algorithms converge well and perform strongly, contrary to the folklore.
CausalBGM uses AI to infer causal effects from complex data.
problem Challenges in causal inference with high-dimensional covariates.
method AI-powered Bayesian generative modeling approach to estimate individual treatment effects.
result CausalBGM consistently outperforms existing methods in high-dimensional scenarios.
Analyze SGD with biased gradients, improving convergence rates and accuracy.
problem Analyzing the convergence of SGD with biased gradients.
method Derive convergence results for smooth non-convex functions and quantify the impact of bias magnitude.
result Improved rates under the Polyak-Lojasiewicz condition and insights into how bias magnitude affects accuracy and convergence.
Single individual haplotyping is an NP-hard problem that emerges when attempting to reconstruct an organism's inherited genetic variations using data typically generated by high-throughput DNA sequencing platforms. Genomes of diploid organisms, including humans, are organized into homologous pairs of chromosomes that d…
COPML framework securely trains models across multiple data owners without revealing individual data.
problem Privacy-preserving collaborative machine learning with multiple data owners.
method Securely encodes data, distributes computation, performs distributed training.
result Achieves up to 16x speedup in training time while maintaining strong privacy.
Fuses ITRs for primary and secondary outcomes to minimize harm.
problem Learn an ITR maximizing primary outcome while minimizing harm to secondary outcomes.
method Introduces fusion penalty to encourage similar recommendations for different outcomes. Two algorithms estimate the ITR using surrogate loss functions.
result Agreement rate between primary and secondary optimal ITRs converges faster than ignoring secondary outcomes.
New algorithm for efficient inference over tree-structured graphs.
problem Inference over probabilistic graphical models with aggregate data.
method Optimal transport theory, Sinkhorn/iterative scaling algorithm, belief propagation.
result Global convergence and polynomial computational complexity.
A new method for deep learning imbalance or noise, ABSGD, improves efficiency and effectiveness.
problem Data imbalance or label noise in deep learning.
method A modification of momentum SGD with individual-level weights proportional to loss values.
result Guaranteed convergence to stationary points of DRO problems, capturing class diversity.
Paper explores whether gradient normalization can replace clipping for SGD in heavy-tailed noise.
problem Ensuring convergence of SGD in heavy-tailed noise.
method Revisits gradient clipping and normalization, proving their sufficiency and effectiveness.
result Gradient normalization alone is sufficient for nonconvex SGD convergence under smoothness assumptions.
Proposes MRIV framework for unbiased CATE estimation using binary IVs.
problem Bias in estimating CATEs due to unobserved confounders.
method Multiply robust machine learning framework (MRIV) for binary IVs.
result MRIV yields multiple robust convergence rates and outperforms existing methods.
We study the problem of learning conditional average treatment effects (CATE) from observational data with unobserved confounders. The CATE function maps baseline covariates to individual causal effect predictions and is key for personalized assessments. Recent work has focused on how to learn CATE under unconfoundedne…
Adambs adapts Adam to prioritize important training examples.
problem Training deep learning models efficiently with varying example importance.
method Adapt Adam using a bandit sampling approach to prioritize examples based on their importance.
result Adambs improves convergence rate compared to Adam in some cases.
LMLFM tackles predictive modeling from longitudinal data with mixed correlations.
problem Learning predictive models from longitudinal data with complex correlations and non-linear interactions.
method Longitudinal Multi-Level Factorization Machine (LMLFM) that selects predictive fixed and random effects.
result LMLFM outperforms state-of-the-art methods in predictive accuracy, variable selection, and scalability.
A faster algorithm for ranking from pairwise comparisons.
problem Efficiently ranking individuals or objects from pairwise comparisons.
method An alternative and simpler iterative algorithm for ranking that converges faster.
result The new algorithm is over 100 times faster in some cases.
Settings such as lending and policing can be modeled by a centralized agent allocating a resource (loans or police officers) amongst several groups, in order to maximize some objective (loans given that are repaid or criminals that are apprehended). Often in such problems fairness is also a concern. A natural notion of…
A new approach to group fairness treats it as a bargaining problem.
problem Fairness in deploying predictors across subpopulations.
method Interpreting fairness as a bargaining problem and proposing relative improvement.
result Relative improvement provides axiomatic justification and finite-sample convergence guarantees.
Mean-field approximations simplify insurance liability calculations.
problem High-dimensional system of equations makes insurance liability calculation infeasible.
method Use mean-field model to replace high-dimensional system with a low-dimensional non-linear system.
result Insurance liability converges to mean-field approximation as cohort size increases.
We investigate the effect of tax evasion on the income distribution and the inequality index of a society through a kinetic model described by a set of nonlinear ordinary differential equations. The model allows to compute the global outcome of binary and multiple microscopic interactions between individuals. When evas…
Modeling tech transfer to explain convergence in Central and Eastern Europe.
problem Understanding mechanisms of technological diffusion in developing economies.
method Introducing a herding-based mechanism to model technological adoption and productivity growth.
result Explicit analytical solution showing nonlinear convergence to a moving frontier.
We consider saddle point problems which objective functions are the average of n strongly convex-concave individual components. Recently, researchers exploit variance reduction methods to solve such problems and achieve linear-convergence guarantees. However, these methods have a slow convergence when the condition n…
SCIENCE improves prediction intervals for individual causal effects.
problem Wide prediction intervals limit practical utility of causal inference.
method Surrogate-assisted conformal inference for efficient individual causal effects.
result SCIENCE produces more efficient prediction intervals for individual causal effects.
Developed a new algorithm to improve dynamic treatment regimens.
problem Non-convergence of Q-learning-based Q-shared algorithm in dynamic treatment regimens.
method Penalized Q-shared algorithm to address convergence issues.
result The penalized Q-shared algorithm converges and outperforms the original in various settings.
We address the issue of speeding up the training of convolutional neural networks by studying a distributed method adapted to stochastic gradient descent. Our parallel optimization setup uses several threads, each applying individual gradient descents on a local variable. We propose a new way of sharing information bet…
A standard way to obtain convergence guarantees in stochastic convex optimization is to run an online learning algorithm and then output the average of its iterates: the actual iterates of the online learning algorithm do not come with individual guarantees. We close this gap by introducing a black-box modification to …
Proposes a method to estimate personalized treatments from high-dimensional data.
problem Estimating individualized treatment regimes (ITRs) from high-dimensional covariates.
method Directly targets the contrast between potential outcomes, using dimension-reduced outcome-weighted learning.
result Achieves universal consistency, converging to the Bayes risk under mild conditions.