Adaptive PCA algorithms for changing environments.
problem Static adversarial regret is not suitable for changing environments.
method Online adaptive algorithms for PCA and variance minimization with sub-linear adaptive regret guarantees.
result The proposed algorithms adapt to changing environments.
New adaptive importance samplers improve stability and accuracy.
problem Improving the stability and accuracy of importance sampling estimators.
method Introducing AdaOAIS, a new adaptive importance sampler using adaptive optimisers to address the instability of OAIS.
result AdaOAIS leads to stable importance sampling estimators in practice.
Proposes blockwise adaptive stepsize for faster training and better generalization in deep learning.
problem Widespread use of coordinate-wise adaptive methods like RMSprop and Adam leads to worse generalization than SGD.
method Splits network parameters into blocks and uses a blockwise adaptive stepsize, balancing adaptivity and generalization.
result Blockwise adaptive gradient descent converges faster and has lower generalization error than coordinate-wise adaptive methods.
A novel adaptive kernel improves RBF neural networks performance.
problem Improving performance of RBF neural networks.
method Adaptive fusion of Euclidean and cosine distance measures using gradient descent.
result The method outperforms manual fusion on three major problems.
Automated strategies improve model adaptation efficiency.
problem Manual adaptation strategies are time-consuming and costly.
method Flexible adaptive mechanism deployment for automated adaptation strategies.
result Automated strategies achieve better or comparable performance.
Gradient learning optimises MCMC proposal distributions.
problem Intractable targets in MCMC sampling.
method Gradient-based optimisation of proposal distributions using a maximum entropy regularised objective function.
result Our method can outperform traditional MCMC algorithms, including Hamiltonian Monte Carlo.
A Bayesian estimation of a GARCH model is performed for US Dollar/Japanese Yen exchange rate by the Metropolis-Hastings algorithm with a proposal density given by the adaptive construction scheme. In the adaptive construction scheme the proposal density is assumed to take a form of a multivariate Student's t-distributi…
Adaptive Gaussian kernel filtering with updated parameters.
problem Improving kernel adaptive filtering for better performance.
method Adaptive updating of Gaussian kernel parameters on an SPD manifold.
result Validation of the proposed method through experimental results.
CORAL+ adapts PLDA for unsupervised domain adaptation.
problem Domain mismatch in speaker recognition systems.
method Inspired by CORAL, unsupervised PLDA adaptation.
result Improves PLDA performance on unlabeled in-domain data.
We propose a method to construct a proposal density for the Metropolis-Hastings algorithm in Markov Chain Monte Carlo (MCMC) simulations of the GARCH model. The proposal density is constructed adaptively by using the data sampled by the MCMC metho d itself. It turns out that autocorrelations between the data generated …
New unsupervised speaker adaptation method for speech synthesis.
problem Adapting speech synthesis to new speakers with minimal data.
method Concatenating audio and text inputs, proposing new training schemes.
result Improves adaptation to unseen speakers and multi-speaker modeling.
Proposes a new adaptive gradient method based on gradient differences.
problem Manual tuning of stepsize in vanilla gradient methods.
method Adaptation driven by cumulative squared norms of gradient differences.
result More robust than AdaGrad in various settings.
A new federated learning method reduces communication costs and improves adaptivity.
problem Large communication overhead and lack of adaptivity in federated learning.
method FedCAMS: A novel communication-efficient adaptive federated learning method with theoretical guarantees.
result FedCAMS achieves the same convergence rate as non-compressed federated learning methods.
Proposes a novel framework for unsupervised domain adaptation using causal representations.
problem Transferability of deep model representations across domains is limited.
method Integrates causal inference into deep learning pipeline for domain-invariant feature learning.
result Demonstrates superior performance in unsupervised domain adaptation using causal representations.
Adaptive linear bandit algorithm with best-of-three-worlds regret bounds.
problem Adaptive to adversarial and stochastic environments with varying sub-optimality gaps and corruption.
method Combines SCRiBLe algorithm with scaled-up sampling and optimistic online learning.
result Achieves best-of-three-worlds regret bounds of O ( T log T ) O(\sqrt{T \log T}) O ( T log T ) for adversarial and O ( log T Δ min + C log T Δ min ) O(\frac{\log T}{Δ_{\min}} + \sqrt{\frac{C \log T}{Δ_{\min}}}) O ( Δ m i n l o g T + Δ m i n C l o g T ) for stochastic environments. New method improves Bayesian cross-validation.
problem Finding good proposal distributions for importance sampling.
method Implicitly adaptive importance sampling that iteratively matches moments.
result Better than many existing parametric adaptive importance sampling methods.
The paper proposes a method to adapt models from source to target domains by calibrating their predictive uncertainties.
problem Inferring class labels for unlabeled target domain given a related labeled source dataset.
method The approach involves calibrating predictive uncertainties quantified as Renyi entropy, using variational Bayes learning and sample variance regularization.
result The proposed method effectively adapts models across three domain-adaptation tasks.
Adapts to estimate functions from noisy ERT data.
problem Estimating functions from noisy Exponential Radon Transform data.
method Locally adaptive kernel type estimator for functions of varying smoothness.
result Achieves minimax optimal rate up to a log(n) factor for Sobolev functions.
An adaptive clustering algorithm learns from evolving data without manual tuning.
problem Clustering in dynamic data environments where distributions change over time.
method ART-based topological clustering with self-adjusting vigilance parameter.
result The algorithm outperforms state-of-the-art methods in clustering performance and continual learning.
Paper proposes adaptive parameter selection for KGD algorithms.
problem Improving parameter selection for kernel-based gradient descent.
method Integrates bias-variance analysis with splitting method, introduces empirical effective dimension.
result Adaptive parameter selection strategy achieves optimal generalization error bound.
Adaptive Bayesian method improves deep learning performance and robustness.
problem Ensuring sparsity in deep learning models to improve performance and robustness.
method Adaptive empirical Bayesian method with self-adaptive spike-and-slab priors and stochastic gradient MCMC optimization.
result The method achieves state-of-the-art performance on MNIST and Fashion MNIST and compression performance on CIFAR10.
The paper proposes an efficient method for estimating ATEs using adaptive experiments.
problem Estimating average treatment effects (ATEs) with minimal sample size and high accuracy.
method The paper defines and uses the efficient treatment-assignment probability to sequentially assign treatments, estimating ATEs using an Adaptive Augmented Inverse Probability Weighting (A2IPW) estimator.
result The proposed experimental design and A2IPW estimator achieve the minimized semiparametric efficiency bound and provide anytime valid confidence intervals for early stopping.
Paper proposes a new DR estimator for adaptive experiments with improved performance.
problem Improving policy evaluation in adaptive experiments with dependent samples.
method Adaptive-fitting variant of sample-splitting for non-Donsker nuisance estimators.
result Proposed DR estimator shows better performance than other estimators with dependent samples.
Paper proposes a neural network for generating better questions from text.
problem Automatic generation of relevant questions from sentences and paragraphs.
method Adaptive copying recurrent neural network model with a copying mechanism added to a bidirectional LSTM architecture.
result The model outperforms state-of-the-art methods in question generation metrics.
Local AdaAlter reduces communication in SGD with adaptive learning rates.
problem Communication overhead in distributed training.
method Novel SGD variant with adaptive learning rates and reduced communication.
result Empirically reduces communication overhead by up to 30%.
Proposes ATM method to improve domain adaptation.
problem Mitigating distribution divergence between source and target domains.
method Adversarial Tight Match (ATM) method using Maximum Density Divergence (MDD).
result New state-of-the-art performance on domain adaptation benchmarks.
The paper proposes a learning algorithm that improves adaptability and generalization.
problem Improving adaptability and generalization in learning models.
method Learning to meta-learn by meta-finetuning on related tasks before adapting to specific tasks.
result Learning to meta-learn improves adaptability and generalization across various tasks.
Proposes a novel framework for unsupervised domain adaptation using specialized batch normalization.
problem Improves unsupervised domain adaptation in deep neural networks.
method Integrates domain-specific batch normalization layers in convolutional neural networks, estimating pseudo-labels for target domain examples and learning final models with multi-task classification loss.
result Achieves state-of-the-art accuracy in standard and multi-source domain adaptation scenarios.
Proposes unsupervised domain adaptation for unlabelled target data.
problem Discrepancy between source and target domains in real-world applications.
method Graph-based matching of source and target samples using convex optimization.
result Local sample-to-sample matching method outperforms traditional methods.
Learn to automatically plug domain-specific modules into a common network.
problem Learning inflexibility and computational intensiveness in multi-domain learning.
method Neural Architecture Search (NAS) for data-driven adapter plugging and structure design.
result NAS-driven MDL model achieves comparable performance to existing approaches.
The paper proposes a distributed method for adaptive learning of graph signals.
problem Learning signals defined over graphs with limited observations.
method Bandlimited assumption, distributed reconstruction, mean-square error guarantee, tracking from sampled vertices.
result Guaranteed performance in mean-square error with optimal sampling strategy.
Method generates intermediate domains to align source and target domains.
problem Challenges of domain adaptation with significant domain divergence.
method Progressive domain augmentation via domain interpolation and multiple subspace alignment.
result Achieves state-of-the-art performance on multiple domain adaptation tasks.
Improved privacy and utility in machine learning with adaptive differential privacy.
problem Enhancing privacy in machine learning models while maintaining utility.
method Adaptive differentially private (ADP) learning method that optimally adapts noise to stepsize.
result ADP method significantly improves utility compared to standard differentially private methods.
Paper introduces new PAC-Bayesian bounds for multi-view domain adaptation.
problem Lack of attention to multi-view learning in domain adaptation.
method Adapted distance measure for multi-view domain adaptation using Pac-Bayesian theory.
result Introduced novel Pac-Bayesian bounds for multi-view domain adaptation.
MaxVA improves Adam's step sizes by maximizing gradient variance.
problem Unstable or extreme adaptive learning rates in Adam.
method Maximizing the variance of gradient coordinates in Adam's running mean of squared gradients.
result Faster adaptation and more desirable convergence behaviors than Adam.
Proposes optimal transport method for multi-source domain adaptation under target shift.
problem Reduces discrepancies between multiple domains with differing label proportions.
method Optimal transport theory applied to learn class probabilities and align probability distributions.
result Superior performance compared to state-of-the-art methods on real-world satellite image segmentation.
The paper proposes a method to focus on discriminative regions for better unsupervised domain adaptation.
problem Unsupervised domain adaptation with limited target domain labels.
method Probabilistic certainty estimate of regions to focus on during classification.
result State-of-the-art results on various datasets compared to recent methods.
Adaptive variational Bayes framework improves inference adaptively.
problem Lack of general and computationally tractable variational Bayes method for adaptive inference.
method Proposes a novel adaptive variational Bayes framework combining variational posteriors over individual models.
result Adaptive variational Bayes achieves optimal contraction rates adaptively under general conditions.
Proposes novel losses for fine-grained categorical domain adaptation.
problem Fine-grained alignment of categories across domains in unsupervised domain adaptation.
method Joint category-domain classifier with adversarial training losses for both domain and category levels, and vicinal domain adaptation.
result Achieves state-of-the-art performance on benchmark datasets.
Paper tackles adaptive submodularity in sequential decision making.
problem Maximizing adaptive submodular functions with limited adaptive rounds.
method Proposes an efficient semi-adaptive policy with logarithmic adaptive rounds.
result Achieves an almost tight 1 − 1 / e − ε 1-1/e-ε 1 − 1/ e − ε approximation guarantee. 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.
Proposes first method for continuously indexed domain adaptation.
problem Challenges of transferring knowledge between continuously indexed domains.
method Combines adversarial adaptation with a novel discriminator.
result Outperforms state-of-the-art methods on synthetic and real-world datasets.
Paper proposes Adaptive DDPG for better stock portfolio allocation.
problem Challenges in finding optimal stock portfolio allocation in dynamic stock markets.
method Adaptive Deep Deterministic Reinforcement Learning (Adaptive DDPG) incorporating optimistic or pessimistic reinforcement learning.
result Adaptive DDPG outperforms traditional and baseline strategies in investment return and Sharpe ratio.
Paper proposes a new method to aggregate multiple sources with different label distributions.
problem Aggregating from multiple target-shifted sources with different label distributions.
method Unified framework to select relevant sources for domain adaptation with limited label, unsupervised, and label partial unsupervised scenarios.
result Empirical results significantly outperform baselines.
Proposes BDA for better transfer learning performance.
problem Distribution divergence between source and target domains, especially marginal and conditional.
method Balanced Distribution Adaptation (BDA) and Weighted BDA (W-BDA) algorithms.
result Improves transfer learning performance on both balanced and imbalanced datasets.
Sequential Monte Carlo (SMC), or particle filtering, is a popular class of methods for sampling from an intractable target distribution using a sequence of simpler intermediate distributions. Like other importance sampling-based methods, performance is critically dependent on the proposal distribution: a bad proposal c…
Paper proposes an improved domain adaptation technique using class-based information.
problem Adapting classifiers across domains with labeled source and unlabeled target datasets.
method Adversarial discriminator approach informed by class structure in source dataset.
result State-of-the-art results achieved on benchmark datasets.
New optimizer closes gap between adaptive methods and SGD for deep learning.
problem Degraded generalization performance of adaptive gradient methods compared to SGD.
method Introducing a new optimization algorithm with a tunable hyperparameter p.
result The new algorithm bridges the gap between adaptive methods and SGD with momentum.