Proposes a continuous, differentiable model from local adaptive models.
problem Inadequate continuity and differentiability in over-parameterized models.
method A global continuous and differentiable model constructed from weighted averages of locally learned models.
result Achieves faster statistical convergence and improved performance in various settings.
Local adaptive methods in FL can accelerate convergence but introduce bias, which is corrected.
problem The effect of using adaptive optimization methods for local updates in federated learning.
method Proposed correction techniques to overcome the bias introduced by local adaptive methods.
result Correction techniques can achieve faster convergence and higher test accuracy than baseline methods.
We present ARU, an Adaptive Recurrent Unit for streaming adaptation of deep globally trained time-series forecasting models. The ARU combines the advantages of learning complex data transformations across multiple time series from deep global models, with per-series localization offered by closed-form linear models. Un…
Local adaptation improves federated learning models.
problem Improving accuracy of federated learning models on non-iid data.
method Local adaptation techniques (fine-tuning, multi-task learning, knowledge distillation).
result Participants benefit from local adaptation, improving federated model accuracy.
LSCI provides locally adaptive prediction sets for operator models with tighter coverage.
problem Generating robust, calibrated uncertainty quantification for operator models.
method Local Sliced Conformal Inference (LSCI) for operator models.
result LSCI yields tighter prediction sets with stronger adaptivity compared to conformal baselines.
Adaptive batch sizes improve local gradient methods in distributed training.
problem Communication bottlenecks in distributed deep learning.
method Adaptive batch size strategies for local gradient methods.
result Adaptive batch sizes reduce minibatch gradient variance and improve training efficiency.
Adaptive personalized federated learning improves local model personalization.
problem Maximizing global model performance limits local model personalization.
method APFL algorithm trains local models while contributing to global model, with optimal mixing parameter and communication-efficient optimization.
result Demonstrates effectiveness of personalization schema and correctness of generalization theories.
GIST adapts HMC by tuning parameters based on position and momentum.
problem Locally adaptive sampling in Hamiltonian Monte Carlo.
method GIST uses Gibbs sampling to adaptively tune HMC parameters.
result GIST improves sampling efficiency for high-dimensional models.
Adaptive sampling detects local concept drift with limited labels.
problem Detecting local concept drift in dynamic environments with scarce labels.
method Combines residual-based exploration and exploitation with EWMA monitoring.
result Superior performance in label efficiency and drift detection accuracy.
Meta-SAGE improves deep RL scalability for CO tasks by adapting pre-trained models to larger-scale problems.
problem Improving scalability of deep reinforcement learning models for combinatorial optimization tasks.
method Meta-SAGE combines a scale meta-learner and scheduled adaptation with guided exploration to adjust model parameters for larger-scale problems.
result Meta-SAGE outperforms previous methods and significantly improves scalability in CO tasks.
Locally adaptive interpretable regression improves linear regression's predictability.
problem Linear regression's predictability is limited; it lacks adaptability.
method Locally adaptive interpretable regression (LoAIR) uses neural networks to predict percentile of a Gaussian distribution for regression coefficients.
result LoAIR achieves comparable or better predictive performance than state-of-the-art baselines.
cKAM improves adaptive sampling by incorporating a cyclical stepsize scheme.
problem Adaptive Metropolis algorithms can get stuck in local modes.
method cKAM uses a cyclical stepsize scheme to encourage exploration and escape from local modes.
result cKAM successfully escapes local modes and converges to the true posterior distribution.
Adaptive uncertainty quantification improves black-box model predictions in generative AI.
problem Improving uncertainty quantification for black-box models in generative AI.
method Adaptive partitioning and local calibration of conformity scores.
result Local tightening of uncertainty sets with adaptive bands.
Locally adaptive federated learning improves convergence in distributed machine learning.
problem Balancing local updates in federated learning leads to slow convergence.
method Locally adaptive federated learning algorithms that use uncoordinated stepsizes based on local geometric information.
result Locally adaptive methods can be particularly efficient in overparameterized settings and outperform standard federated algorithms.
Adapted metrics found on complex manifolds.
problem Finding metrics suitable for complex manifolds.
method Characterizing adapted metrics as critical points of a functional.
result Gauduchon metric is adapted on locally conformally product manifolds.
L-ARC improves model fairness by localizing risk guarantees.
problem Improving model fairness in tasks like image segmentation and wireless networks.
method Localized Adaptive Risk Control (L-ARC) updates a threshold function in RKHS to target localized statistical risk guarantees.
result L-ARC produces prediction sets with improved fairness across different data subpopulations.
Super-resolution is a classical problem in image processing, with numerous applications to remote sensing image enhancement. Here, we address the super-resolution of irregularly-sampled remote sensing images. Using an optimal interpolation as the low-resolution reconstruction, we explore locally-adapted multimodal conv…
Adversarial online nonparametric regression achieves optimal rates with locally adaptive learning.
problem Adversarial online nonparametric regression with general convex losses.
method Parameter-free learning algorithm leveraging chaining trees to compete against H{ö}lder functions, dynamically tracking and adapting to local smoothness variations.
result First computationally efficient algorithm with locally adaptive optimal rates for online regression in an adversarial setting.
Unsupervised domain adaptation methods aim to alleviate performance degradation caused by domain-shift by learning domain-invariant representations. Existing deep domain adaptation methods focus on holistic feature alignment by matching source and target holistic feature distributions, without considering local feature…
Locally adaptive nearest neighbors improve automated systems' performance and are easier to interpret.
problem Improving automated systems' performance and interpretability.
method Developed a method for k nearest neighbors algorithms to learn locally adaptive metrics.
result Locally adaptive metrics improve performance and are interpretable.
We take initial steps in studying PAC-MDP algorithms with limited adaptivity, that is, algorithms that change its exploration policy as infrequently as possible during regret minimization. This is motivated by the difficulty of running fully adaptive algorithms in real-world applications (such as medical domains), and …
ABHT boosts regression by filtering regions with different smoothness.
problem Improving regression performance through local adaptivity.
method Gradient boosting with adaptive histogram transform.
result ABHT converges faster than PEHT in Hölder continuous spaces.
Generalizes machine learning models using localization kernels and local means.
problem Understanding and unifying diverse machine learning models.
method Formal definition of localization method through localization kernels and local means.
result Unified theoretical lens and new methodological tools for designing flexible learning systems.
Adaptive algorithm minimizes online prediction errors for irregular data.
problem Online adversarial regression with highly irregular prediction rules.
method Adaptive wavelet-based algorithm for Besov space regression.
result Minimax-optimal regret bounds in adversarial settings.
DANCE improves prediction set efficiency for deep learning models.
problem Inefficient, overly conservative prediction sets for pre-trained models.
method DANCE combines adaptive kernel regression and nearest-neighbor approach.
result DANCE produces more efficient and robust prediction sets.
New approach to adaptively select bandwidths in nonparametric regression.
problem Adaptive bandwidth selection in nonparametric regression.
method Inspired by ℓ2-norms of interval projections, introduces a new bandwidth selection procedure. result Obtains non-asymptotic risk bounds for local polynomial regression methods that adapt to local Hölder exponent.
Adaptive sampling results in dramatic improvements in the recovery of sparse signals in white Gaussian noise. A sequential adaptive sampling-and-refinement procedure called Distilled Sensing (DS) is proposed and analyzed. DS is a form of multi-stage experimental design and testing. Because of the adaptive nature of the…
Meta-GLAR combines global deep representations with local adaptation for improved forecasting accuracy.
problem Joint learning from related time series boosts accuracy but fails for out-of-sample forecasting.
method Meta-GLAR uses a meta-learning approach to adapt RNN representations for each time series.
result Meta-GLAR outperforms state-of-the-art methods in out-of-sample forecasting accuracy.
Proposes a method to refine PDE-driven high-dimensional rare-event simulation.
problem Challenges in constructing accurate surrogates for rare-event simulation.
method Adaptive importance sampling framework that refines a locally constructed surrogate.
result Achieves accuracy comparable to true-model adaptive importance sampling with fewer high-fidelity evaluations.
Edge devices adapt pre-trained models to local data without backpropagation.
problem Adapting pre-trained models to edge devices' local data distributions.
method Feed-forward latent domain adaptation using cross-attention.
result Consistent improvements over ERM baselines and domain-supervised adaptation.
Locally adaptive clustering for tree delineation.
problem Tree delineation from distance data.
method Locally adaptive hierarchical cluster termination.
result Multi-scale alternative to conventional termination criteria.
Adaptive methods improve gradient descent and proximal gradient for convex optimization.
problem Improving efficiency of gradient descent and proximal gradient methods.
method Adaptive versions of GD and ProxGD using local curvature information.
result Proved convergence with local Lipschitz gradient assumptions.
LDAO addresses imbalanced regression by learning local distribution structures.
problem Imbalanced regression with sparse target regions difficult for models.
method LDAO learns local distribution structures, models and samples from each, then merges.
result LDAO outperforms state-of-the-art methods on 45 imbalanced datasets.
SPARTAN learns sparse interaction graphs between objects in scenes.
problem Capturing structured interactions between entities in complex settings remains challenging.
method SPARTAN is a Transformer-based world model that learns sparse, context-dependent interaction graphs through sparsity regularization on attention patterns.
result SPARTAN achieves significantly improved few-shot adaptation to dynamics changes and robustness against distractors.
Adapts Hölder smoothness with normalized gradients.
problem Improving smoothness adaptation methods.
method Black-box adaptation of Levy's method using normalized gradients.
result Bound depends on local Hölder smoothness.
LCMQR improves prediction intervals by adapting to local heteroscedasticity.
problem Efficient and adaptive prediction intervals for local heteroscedasticity.
method LCMQR combines multi-quantile information with kernel-based localization.
result LCMQR constructs tighter intervals than prior methods, especially in heterogeneous environments.
Combines local and global samplers for efficient sampling.
problem Limited learning accuracy in regions with little data.
method Explore-Exploit Markov chain Monte Carlo strategy (Ex2MCMC) result Proves V-uniform geometric ergodicity of Ex2MCMC. Adaptive framework improves nonparametric dimensionality reduction.
problem Optimal hyper-parameter tuning for nonparametric dimensionality reduction.
method Adaptive framework using intrinsic dimension estimator and optimal local neighbourhood sizes.
result Significant improvements in various learning tasks through better low-dimensional visualizations.
Locally adapted parameterizations of a model (such as locally weighted regression) are expressive but often suffer from high variance. We describe an approach for reducing the variance, based on the idea of estimating simultaneously a transformed space for the model, as well as locally adapted parameterizations in this…
We propose two approaches of locally adaptive activation functions namely, layer-wise and neuron-wise locally adaptive activation functions, which improve the performance of deep and physics-informed neural networks. The local adaptation of activation function is achieved by introducing a scalable parameter in each lay…
This paper introduces localized discrepancy theories for unsupervised domain adaptation.
problem Improving generalization bounds for unsupervised domain adaptation.
method Localized discrepancies defined on the hypothesis space after localization, leading to smaller and asymmetric values.
result Improved generalization bounds and sample complexity reduction.
The paper offers a unified approach to the study of three locally adaptive estimation methods in the context of univariate time series from both theoretical and empirical points of view. A general procedure for the computation of critical values is given. The underlying model encompasses all distributions from the expo…
Optimizes hard-to-optimize metrics using adaptive surrogates.
problem Training models with black-box and hard-to-optimize metrics.
method Expresses metric as a function of surrogates, solves optimization problem over relaxed surrogate space.
result Approach performs on par with known methods and adds value when metric form is unknown.
Improves multi-objective learning by adapting to local subintervals.
problem Learning a predictor satisfying multiple objectives in an online, changing data setting.
method Adapting an existing multi-objective learning method with an adaptive online algorithm.
result Improves predictions over subgroups and remains robust under distribution shift.
The multivariate normal density is a monotonic function of the distance to the mean, and its ellipsoidal shape is due to the underlying Euclidean metric. We suggest to replace this metric with a locally adaptive, smoothly changing (Riemannian) metric that favors regions of high local density. The resulting locally adap…
Adapts manifold structure for better clustering performance.
problem Lack of consideration for local manifold structure in existing multiple kernel k-means methods.
method Adopts manifold adaptive kernel to integrate local manifold structure of kernels.
result Proposed method outperforms state-of-the-art methods.
WALNUTS improves sampling efficiency and robustness for multi-scale distributions.
problem Adapting leapfrog step size for multi-scale posterior distributions.
method Adapts leapfrog step size at fixed intervals of simulated time, selecting the largest step size to keep energy error below a threshold.
result Substantial improvements in sampling efficiency and robustness compared to standard NUTS.
Federated learning framework improves model generalization and privacy.
problem Communication overhead and statistical heterogeneity in FL.
method Prototypes and lightweight adapters for local model refinement.
result Improves classification accuracy over baseline algorithms.