New approach handles changing data distributions via reused models.
problem Handling concept drift in streaming data.
method Model reuse with adaptive weights based on performance.
result Adaptive model weights improve performance on various datasets.
Enhances DenseNets with multi-scale convolutions and stochastic feature reuse.
problem Overfitting in DenseNets with dense feature reuse.
method Multi-scale Convolution Aggregation module and Stochastic Feature Reuse.
result Significant improvement in model accuracy with fewer parameters.
Paper explores reusing and adapting training data for entity resolution.
problem Entity resolution with limited training data.
method Distributed representation and five algorithms for reuse scenarios.
result Significant performance improvements with reused training data.
ECPF improves classification accuracy and speed for evolving data streams.
problem Reusing classifiers trained on recurring concepts to maintain accuracy and speed.
method ECPF uses similarity of classifications to quickly identify the best classifier to reuse.
result ECPF significantly outperforms state-of-the-art frameworks on synthetic and real-world datasets.
A new gradient method LAG reduces communication in distributed learning.
problem Reducing communication in distributed machine learning.
method Skip gradient calculations for slowly-varying gradients using simple rules.
result Communication reduction with theoretical and empirical support.
Pipeline-aware hyperparameter tuning speeds up machine learning pipelines by reusing intermediate computations.
problem High computational burden in hyperparameter tuning of multi-stage pipelines.
method Proposes a hybrid hyperparameter tuning method and a caching problem formulated as an ILP to maximize reuse.
result Pipeline-aware approach offers over an order-of-magnitude speedup over independent evaluations.
The paper proposes a method to adapt machine learning models to changing conditions.
problem Machine learning models need to adapt to new conditions in a constantly changing environment.
method Reuse knowledge from existing models to train future generations.
result The proposed method allows machine learning models to adapt and survive in a dynamic environment.
New bounds show multiclass problems reduce overfitting from test set reuse.
problem Overfitting from test set reuse in multiclass problems.
method Upper and lower bounds on bias of attacks, practical and inefficient attacks.
result Multiclass problems mitigate overfitting from test set reuse.
VRER selectively reuses samples to improve policy optimization in complex systems.
problem Lack of effective reuse of historical samples in reinforcement learning.
method Variance reduction based experience replay (VRER) framework.
result VRER accelerates policy optimization and enhances performance.
Adaptive statistical learning improves model generalization with privacy-preserving techniques.
problem Overfitting and poor generalization in adaptive statistical learning.
method Adapting Bayesian differential privacy techniques to handle correlated data.
result The holdout dataset can be reused adaptively in statistical learning with privacy-preserving perturbations.
The paper investigates what enables successful transfer learning and separates feature reuse from data statistics.
problem Understanding what enables successful transfer learning and identifying the responsible parts of the network.
method Analyzes transfer learning on block-shuffled images to distinguish feature reuse from data statistics.
result Some benefit of transfer learning comes from learning low-level statistics of data, not just feature reuse.
KVCOMM optimizes multi-agent LLM systems by reusing KV-caches, reducing redundant processing.
problem Substantial overhead from reprocessing overlapping contexts across multi-agent systems.
method KVCOMM reuses KV-caches and adjusts offsets for shared content using a pool of cached examples (anchors).
result Achieves over 70% reuse rate across diverse multi-agent tasks, up to 7.8x speedup.
We introduce the Adaptive Skills, Adaptive Partitions (ASAP) framework that (1) learns skills (i.e., temporally extended actions or options) as well as (2) where to apply them. We believe that both (1) and (2) are necessary for a truly general skill learning framework, which is a key building block needed to scale up t…
PTF accelerates RL by reusing source policies without measuring task similarity.
problem Leveraging prior knowledge for faster RL.
method Adaptive Policy Transfer Framework (PTF) for RL.
result Significantly accelerates RL learning process and surpasses state-of-the-art methods.
LAZO reduces query complexity and variance in ZO methods.
problem High query complexity and variance in zeroth-order optimization.
method LAZO uses adaptive lazy queries to reduce variance and save queries.
result LAZO achieves lower regret and query complexity compared to existing methods.
Study on reliability of latent reuse in diffusion models under distribution shift.
problem When can latent spaces from a source dataset be reused for a target dataset with different distributions?
method Considered a source-target setting with approximately low-dimensional datasets near different subspaces. Analyzed the target-domain score error due to principal-angle misalignment and target ambient noise.
result Latent reuse is reliable only if the source and target subspaces are close and the target ambient noise is not too amplified.
Efficiently processes dynamic inputs in AI writing assistants with incremental computation.
problem Efficiently updating AI models in real-time with dynamic inputs.
method Incremental computing using vector quantization to filter and reuse intermediate values in neural networks.
result Comparable accuracy with 12.1X fewer operations for processing dynamic inputs.
Robotics learns new skills faster by reusing past movements.
problem Learning new motor skills is time-consuming and requires exploration of a large space of motor configurations.
method Combines probabilistic movement primitives with relative entropy policy search for skill initialization and adaptation.
result Quality of learned skills improves and the number of required iterations to learn a new task can be reduced by more than 60%.
New techniques reuse subword embeddings in neural models, reducing size and improving performance.
problem Improving performance and reducing model size in subword-aware neural language models.
method Reusing subword embeddings and other weights in multi-layer input embedding models, tying layers consecutively bottom-up.
result Best morpheme-aware model with reused weights outperforms competitive word-level model by a large margin.
Framework learns best model from diverse pretrained models for distribution shift.
problem No single pretrained model is best for all downstream tasks under distribution shift.
method Frontier Learning constructs a unified feature from white-box and black-box models, fitting a lightweight learner.
result Frontier Learning matches or outperforms strongest individual reuse strategy across settings.
New RL algorithms improve control tasks with data reuse.
problem Real-world control requires performance guarantees and data efficiency.
method Generalized Policy Improvement combining on-policy guarantees and sample reuse.
result Extensive experimental analysis shows benefits of new algorithms.
Bayesian Experience Reuse improves learning from multiple experts.
problem Learning from multiple experts with conflicting goals.
method Bayesian neural networks with shared features to model uncertainty and derive a probability distribution over expert models.
result BERS method effectively samples demonstrations from the derived distribution to reuse them in new tasks.
Self-organizing maps improve reinforcement learning efficiency.
problem Improving sample efficiency in reinforcement learning.
method Using a similarity measure based on self-organizing maps to store and transfer knowledge between tasks.
result The approach significantly improves sample efficiency in reinforcement learning.
HRM-Agent learns to navigate dynamic mazes using reinforcement learning.
problem Training HRM in dynamic, uncertain, partially observable environments.
method Reinforcement learning to train HRM-Agent.
result HRM-Agent successfully learns to navigate dynamic mazes.
New method reduces bias in high-dimensional action spaces for efficient reinforcement learning.
problem Large bias and difficulty in reusing old samples in high-dimensional action spaces.
method Dimension-wise IS weight clipping to control bias and adaptively manage IS weights.
result Proposed method outperforms PPO and other RL algorithms in various tasks.
New approach allows deep learning to adapt to new tasks without explicit training.
problem How to reuse deep learning knowledge for new tasks without explicit training.
method Homoiconic Meta-Mapping (HoMM) that transforms task representations.
result Zero-shot remapping of behavior to adapt to new tasks.
Adaptive workflow combines fast amortized inference with MCMC for many datasets.
problem Trade-off between computational speed and sampling accuracy in Bayesian inference.
method Adaptive workflow integrating amortized inference and MCMC with principled diagnostics.
result Efficiency gains with high posterior quality on tens of thousands of datasets.
DTS improves inference-time alignment of diffusion models with less compute.
problem Inference-time alignment of diffusion models suffers from inaccurate value estimation and inefficient reuse of past computations.
method Diffusion Tree Sampling (DTS) uses a tree-based approach to propagate terminal rewards and iteratively refine value estimates.
result DTS produces asymptotically exact samples and matches the FID of best-performing baselines with up to 10x less compute.
Disentangled representations naturally emerge in multi-task learning.
problem Finding adaptable representations for multiple tasks.
method Empirical study of neural networks trained on automatically generated supervised tasks.
result Disentanglement naturally occurs during multi-task learning.
AdapVAE learns streaming data clustering and feature learning adaptively.
problem Adaptive clustering and feature learning for streaming data.
method Bayesian Nonparametric (BNP) modeling with Deep Neural Networks (DNNs) for feature learning, online variational inference algorithm.
result AdapVAE can adaptively detect novel clusters in emerging data without catastrophic forgetting.
Adapts data analysis for growing data, improving generalization guarantees.
problem Challenges of overfitting and statistical validity in adaptive workflows with growing data.
method Generalizes adaptive analysis on dynamic data, incorporating time-varying empirical accuracy bounds and mechanisms.
result First generalization bounds for adaptive analysis on dynamic data, matching prior works' improvement over data splitting.
Paper proposes PRR network for better experience reuse in reinforcement learning.
problem Efficient experience reuse in reinforcement learning across multiple granularities.
method Proposes PRR network trained on multi-level architecture to extract and store experience.
result PRR network leads to better experience reuse and improved performance.
Improves reinforcement learning stability and efficiency.
problem Combining stability and efficiency in reinforcement learning.
method Combines on-policy stability with off-policy sample reuse.
result Demonstrates improved performance in both theory and practice.
MAML's success is due to feature reuse, not rapid learning.
problem Understanding the effectiveness of MAML in few-shot learning.
method Ablation studies and analysis of latent representations.
result Feature reuse is the dominant factor in MAML's success.
Similar models predict similarly, reducing overfitting risk.
problem Excessive reuse of test data in machine learning.
method Proved model similarity mitigates overfitting and provided a generalization bound.
result Model similarity reduces the risk of overfitting, even when accuracy levels suggest otherwise.
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.
Improved scaling laws in linear regression using data reuse.
problem Sustainability of neural scaling laws when running out of new data.
method Data reuse in multi-pass stochastic gradient descent (multi-pass SGD) for M-dimensional linear models trained on N data with sketched features. result Multi-pass SGD achieves a test error of Θ(M1−b+L(1−b)/a) with L>N, improving scaling laws in data-constrained regimes. This paper proposes reusing CNN layers to speed up hyperparameters tuning.
problem Time-consuming hyperparameters tuning in CNNs.
method Reuse trained convolutional layers among different trainings.
result Reduces training time and increases accuracy of neural networks.
Paper proposes a method to reuse models without raw data.
problem Reuse existing models without accessing raw data.
method Two-phase framework: Upload and Deployment phases.
result Theoretical and experimental validation of approach effectiveness.
New method uses rank-conditioned Horvitz-Thompson estimation for unbiased sample reuse in Plackett-Luce best-of-K objective.
problem Estimating the expected maximum reward in Plackett-Luce draws without replacement.
method Rank-conditioned Horvitz-Thompson estimation with joint-score REINFORCE for unbiased sample reuse.
result Unbiased estimation of the Plackett-Luce best-of-K objective with finite second moment guarantees.
Improves on-policy RL by reusing data from multiple policies.
problem Lack of reuse of data from previous policies in on-policy RL.
method Adapts replay buffer concept to combine on- and off-policy learning.
result Method outperforms state-of-the-art on-policy RL algorithms.
The paper proposes a uniformity regularization scheme to improve deep neural network transferability.
problem Improving deep neural network transferability and adaptation to new tasks.
method Introduces a uniformity regularization scheme to encourage high uniformity in embedding space.
result Uniformity regularization consistently offers benefits over baseline methods and achieves state-of-the-art performance in Deep Metric Learning and Meta-Learning.
ACS is an interactive framework for model-free selection with guaranteed error control.
problem Model-free selection with rigorous error control.
method Adaptive conformal selection with human-in-the-loop data exploration and new information incorporation.
result ACS provides concrete selection algorithms for various goals, including model update/selection, diversified selection, and incorporating new data.
Method predicts rarity of image features to support research integrity investigations.
problem Difficulty in determining if image reuse is by chance or intentional.
method Statistical estimation of ORB features' chance occurrence across PubMed Open Access Subset dataset.
result The method produces decreasingly smaller p-values for more complex imagery, supporting null hypothesis.
Differentially private algorithms protect model explanations from leaking training data.
problem Model explanations can leak training data, compromising privacy.
method Adaptive differentially private gradient descent algorithm to produce accurate, private explanations.
result Privacy amplification and reduction of overall privacy loss on explanation data.
New RL approach transfers policies across related domains.
problem Efficiently transfer policies between different domains in RL.
method Adapts and reuses optimal policies from related source tasks.
result Improves sample efficiency in target domain learning.
CLEAS improves neural architecture search for continual learning.
problem Overcoming catastrophic forgetting and adapting to new tasks while controlling model complexity.
method Neural architecture search (NAS) with reinforcement learning to find optimal neural architecture.
result CLEAS achieves higher classification accuracy with simpler neural architectures.
Improved Markov models learn from their mistakes and adapt to problem complexity.
problem Limitations of standard masked discrete diffusion models in reasoning tasks.
method Learning a Markov transition kernel trained on its own outputs, allowing remasking and adaptation.
result Significant improvement in solving reasoning problems, especially Sudoku-Extreme and Countdown-4.