The paper revisits PCM and APCM clustering algorithms from an uncertainty perspective.
problem Uncertainty in clustering algorithms and its impact on clustering behavior.
method Introducing parameters σ_v and α to characterize uncertainty, modeling membership values as conditional fuzzy sets.
result Unified clustering framework (UPCM) that reduces to PCM and APCM under specific conditions.
The paper tackles energy management in buildings with PCM using dynamic programming.
problem Optimal scheduling of HVAC systems in buildings with PCM is challenging due to nonlinear and non-convex characteristics.
method The paper uses dynamic programming to address the nonlinear nature of PCM, incorporating macro actions and multi-time scale Markov decision processes to reduce computational burden.
result The proposed method demonstrates a computational speed-up of up to 12,900 times compared to direct DP application.
New method detects inconsistencies in AHP matrices using triadic preference reversals.
problem Challenges in assessing consistency in AHP pairwise comparison matrices.
method Triadic preference reversals to detect inconsistencies between pairs of elements.
result 97% accuracy in detecting inconsistencies, significantly surpassing traditional methods.
New SPD metrics improve stability and efficiency in neural networks.
problem Designing stable and efficient Riemannian metrics on SPD manifolds.
method Cholesky decomposition to derive SPD metrics.
result Proposed metrics provide closed-form operators, computational efficiency, and improved numerical stability.
A new method estimates treatment effects in mixed groups, improving accuracy.
problem Estimating treatment effects in mixed groups with heterogeneous responses.
method PCM (pre-cluster and merge) approach for nonparametric estimation.
result Asymptotic consistency and significant improvement in accuracy over existing methods.
Study uses Open Banking data to estimate customer value, showing potential 21% increase.
problem Limited CLV estimation using single-entity data.
method Introduces PCLV framework using Open Banking data for comprehensive customer value estimation.
result Open Banking data can estimate PCLV per competitor, showing a 21.06% increase over Actual CLV.
FedIRT enables privacy-preserving psychometric estimation without centralizing data.
problem Privacy and data governance concerns in centralized IRT estimation.
method Federated Item Response Theory (FedIRT) and FedIRT-DP for differentially private estimation.
result FedIRT matches accuracy of centralized estimators while preserving privacy.
Efficient DL reduces EM nanostructure design complexity.
problem Designing and optimizing electromagnetic nanostructures efficiently.
method Autoencoder-based dimensionality reduction for one-to-one problem reformulation.
result Significant reduction in computational complexity for EM nanostructures.
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.
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.
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. Greedy policy achieves good results for adaptive submodular problems.
problem Sequential decision making with adaptive stochastic optimization.
method Adaptive submodularity ratio to analyze greedy policy performance.
result Greedy policy achieves approximation guarantees for a broader class of problems.
Seq2seq ASR adapts to speakers, improving performance by 25%.
problem Speaker adaptation for seq2seq ASR systems to match conventional methods.
method Applied Kullback-Leibler divergence and Linear Hidden Network adaptation to seq2seq models.
result 25% relative word error rate improvement with seq2seq model adaptation.
Adaptive decision-making for state estimation with partial observations.
problem Stochastic state estimation with partial observations and active diagnosis.
method Weak adaptive submodularity and adaptive greedy policy.
result Adaptive greedy policy achieves near-optimal performance for weakly adaptive submodular reward functions.
Develops a robust classifier for domain adaptation without relying on restrictive assumptions.
problem Robustness of domain-adaptive classifiers in general domain adaptation settings.
method Formulates a conservative parameter estimator that guarantees lower risk for all possible target labelings.
result Classical least-squares and discriminant analysis cases perform on par with state-of-the-art classifiers in sample selection bias settings and outperform them in general domain adaptation settings.
AdaPTS adapts univariate FMs for multivariate time series forecasting.
problem Challenges in managing feature dependencies and uncertainty quantification in multivariate time series forecasting.
method Adapters that transform multivariate inputs into a latent space and apply univariate FMs independently to each dimension.
result AdaPTS enhances forecasting accuracy and uncertainty quantification compared to baseline methods.
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 algorithm reduces interventional strategy complexity for causal graph discovery.
problem Designing efficient interventional strategies for causal graph discovery.
method Developed an r-adaptive algorithm for causal graph discovery that minimizes the number of interventions.
result Achieved an approximation of O(min{r, log n} * n^{1/min{r, log n}}) for the verification number.
Paper presents a Transformer model for automatic domain adaptation.
problem Challenges in selecting or designing domain adaptation algorithms.
method Transformer model approximates and selects domain adaptation algorithms.
result Transformers can approximate and automatically select domain adaptation algorithms.
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.
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.
New approach shows AI can adapt like toddlers by correcting old knowledge.
problem Lack of adaptability in AI models compared to humans and animals.
method Casting adaptation as posterior correction and using Bayesian Learning Rule.
result AI can learn to adapt quickly by using posterior correction.
New methods estimate probabilities from pairwise comparisons, adapting to difficulty.
problem Estimating probabilities from pairwise comparisons with varying difficulty.
method Adaptive estimators using an adaptivity index based on indifference sets.
result CRL estimator has adaptivity index upper bounded by n \sqrt{n} n up to logarithmic factors. New analysis proves consistency for adaptive Bayesian quadrature methods.
problem No theoretical guarantees for adaptive Bayesian quadrature methods.
method Introduces weak adaptivity and proves consistency for a broad class of adaptive Bayesian quadrature rules.
result Proves consistency and derives non-tight but informative convergence rates for adaptive Bayesian quadrature methods.
Paper analyzes convergence of adaptive gradient methods for nonconvex optimization.
problem Lack of convergence guarantees for adaptive gradient methods in nonconvex optimization.
method Fine-grained convergence analysis of adaptive gradient methods including AMSGrad, RMSProp, and AdaGrad.
result Proves adaptive gradient methods converge to first-order stationary points for smooth nonconvex functions.
Unified framework for speaker-adaptive models using scaling and bias codes.
problem Improving speaker-adaptive neural-network based speech synthesis systems.
method Unified framework representation and generalized scaling and bias codes.
result Improves performance of speaker adaptation compared to conventional methods.
Unified view of context-adaptive inference across statistics, meta-learning, and foundation models.
problem Adapting predictive systems to specific situations.
method Unified framework for context-adaptive inference, bridging statistics, meta-learning, and foundation models.
result Explicit and implicit approaches are mathematically equivalent under certain conditions.
New adaptive strategy for active learning with smooth boundaries.
problem Adaptive active learning in multivariate classification with unknown distributional parameters.
method Combining insights from recent works, reduction to univariate-adaptive strategies.
result Near-optimal rates achieved without prior knowledge of distributional parameters.
This paper explains why Adam generalizes worse than SGD by analyzing its components.
problem Understanding why Adam generalizes worse than Stochastic Gradient Descent (SGD).
method Diffusion theoretical framework to disentangle the effects of Adaptive Learning Rate and Momentum.
result Adaptive Learning Rate helps escape saddle points but not select flat minima, while Momentum provides a drift effect to help pass through saddle points.
This paper improves neural network generalization by dynamically learning kernel parameters.
problem Improving neural network generalization and adaptability.
method Diagonal adaptive kernel model that learns kernel eigenvalues and output coefficients during training.
result The diagonal adaptive kernel model significantly improves generalization over fixed-kernel methods.
Study on distributed nonparametric function estimation with optimal rate and cost of adaptation.
problem Optimal rate of convergence and cost of adaptation in distributed nonparametric function estimation.
method Distributed minimax estimation and adaptive estimation under communication constraints for Gaussian sequence model and white noise model.
result Established minimax rate of convergence and exact communication cost for adaptation.
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.
Adaptive networks improve model robustness through conditional normalization.
problem Limited robustness of adversarial-trained networks due to network capacity and training samples.
method Proposes a conditional normalization module to adapt networks during adversarial training.
result Adaptive networks outperform both clean validation accuracy and robustness compared to non-adaptive counterparts.
FLAP adapts policies quickly to new tasks using shared linear representations.
problem Adapting policies to new tasks efficiently and effectively.
method FLAP uses a shared linear representation and a separate adapter network for quick adaptation.
result FLAP achieves up to 8X faster adaptation and significantly better performance on out-of-distribution tasks.
AvaGrad optimizes vision tasks by decoupling learning rate and adaptability.
problem Improving optimization methods for vision tasks.
method Derives AvaGrad, a new optimizer that decouples learning rate and adaptability.
result AvaGrad outperforms SGD on vision tasks when adaptability is properly tuned.
Personalized adaptation improves building-specific energy forecasting.
problem Building-specific temporal behavior is lost in fully shared adapters, and local adaptation discards cross-building transfer.
method Proposes a personalized federated sparse adaptation framework with a heterogeneous temporal mixture-of-experts (MoE) adapter.
result Personalization consistently outperforms Global FL-MoE and Local MoE across 50 buildings and three TSFM backbones.
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.
Improved speech recognition with cumulative adaptation methods.
problem Robust speech recognition in varying environments and speakers.
method Used a bidirectional LSTM neural network and i-vectors for adaptation.
result Achieved 13% relative improvement in word error rate.
FLoE adapts LLMs by selectively deploying LoRA adapters based on layer importance and task requirements.
problem Uniform LoRA deployment across all layers leads to inefficient and redundant parameter allocation.
method FLoE uses Fisher information to dynamically identify task-critical layers and optimizes LoRA ranks.
result FLoE achieves significant efficiency-accuracy trade-offs, especially in resource-constrained environments.
New neural network learns adaptive behaviors inspired by neuromodulation.
problem Current AI lacks the ability to adapt to changing environments.
method Inspired by cellular neuromodulation, a new deep neural network architecture is designed.
result Neuromodulation-based networks improve adaptation in meta-reinforcement learning tasks.
The paper improves generalization bounds for domain adaptation.
problem Improving generalization bounds for domain adaptation under practical conditions.
method Derives generalization bounds for domain adaptation based on finitely many moments and smoothness conditions.
result Obtains generalization bounds for domain adaptation.
New protocols show 1-bit mean estimation can be order-optimal without interaction.
problem Can 1-bit mean estimation be optimal without interaction?
method Adaptive and non-adaptive threshold and interval queries, with one adaptive transition.
result Arbitrary non-adaptive quantizers can match the adaptive rate, suggesting interaction is not necessary.
New adaptive attacks bypass many defenses to adversarial examples.
problem Adversarial example defenses are not adequately evaluated using adaptive attacks.
method Detailed analysis of thirteen defenses, demonstrating their vulnerabilities to adaptive attacks.
result Adversarial example defenses are more vulnerable to adaptive attacks than previously thought.
AdapTable adapts tabular models to shifts without source data, improving HELOC performance.
problem Distribution shifts in tabular data threaten model performance.
method Shift-aware uncertainty calibrator and label distribution handler.
result Up to 16% improvement on HELOC dataset.
The paper addresses statistical inference issues in adaptive experiments.
problem Statistical inference problems in adaptive experiments.
method Explains and fixes statistical inference issues in adaptive experiments using various methods.
result Various methods to stabilize inferences and recover asymptotic normality.
Enhances physics-informed neural networks with adaptive sampling and weighting.
problem Challenges in training physics-informed neural networks on complex problems.
method Hybrid adaptive sampling and weighting method.
result Consistently improves prediction accuracy and training efficiency.
We study the performance of the adaptive construction scheme for a Bayesian inference on the Quadratic GARCH model which introduces the asymmetry in time series dynamics. In the adaptive construction scheme a proposal density in the Metropolis-Hastings algorithm is constructed adaptively by changing the parameters of t…
Adaptive template systems improve feature extraction from persistence diagrams for machine learning.
problem Feature extraction from persistence diagrams for machine learning.
method Adaptive template systems using CDER, GMM, and HDBSCAN algorithms.
result Adaptive template systems yield competitive and often superior results in classification tasks.