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.
Sparse Meta Networks adapt deep neural networks incrementally for fast learning.
problem Training deep neural networks is slow and impractical for complex, changing environments.
method Sparse Meta Networks use a memory layer to learn online sequential adaptation, accumulating fast-weights incrementally.
result Sparse Meta Networks achieve strong performance in various sequential adaptation scenarios.
DANE adapts network embeddings across multiple domains.
problem Learning embeddings for multiple networks without transferability.
method Graph Convolutional Network with adversarial learning.
result DANE achieves superior performance in cross-network domain adaptation.
GDA-HIN adapts across heterogeneous networks by aligning shared and private node types.
problem Domain adaptation challenges in heterogeneous networks with shared and private node types.
method Generalized Domain Adaptive model across HINs (GDA-HIN) that aligns identical-type nodes and edges while utilizing different-type nodes and edges.
result GDA-HIN outperforms state-of-the-art methods in various domain adaptation tasks across heterogeneous networks.
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.
We present an approach to adaptively utilize deep neural networks in order to reduce the evaluation time on new examples without loss of accuracy. Rather than attempting to redesign or approximate existing networks, we propose two schemes that adaptively utilize networks. We first pose an adaptive network evaluation sc…
Algorithm for decentralized competition among adaptive agents.
problem Decentralized competition among adaptive networks.
method Developed an algorithm for decentralized competition among teams of adaptive agents.
result Algorithm enables decentralized competition among adaptive agents.
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.
Adaptive dropout and regularization are shown to be dual in linear networks.
problem Sparsifying deep neural networks.
method Examining dropout in the linear case, revealing a duality with regularization.
result Adaptive dropout methods lead to sparse solutions with effective penalties similar to classical sparse optimization penalties.
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.
Neural networks learn adaptive kernels that improve approximation and representation.
problem Improving neural network performance in approximating and representing functions from data.
method Dynamic reproducing kernel Hilbert space (RKHS) approach.
result Gradient flow in neural networks learns an adaptive RKHS representation and performs global least-squares projection.
AGCRN forecasts traffic using adaptive graph and recurrent learning.
problem Forecasting traffic dynamics with complex spatial and temporal correlations.
method Adaptive Graph Convolutional Recurrent Network (AGCRN) with Node Adaptive Parameter Learning (NAPL) and Data Adaptive Graph Generation (DAGG).
result AGCRN outperforms state-of-the-art models without pre-defined graphs.
Adaptive weights improve physics-informed neural networks and deep operator networks.
problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.
Unintended effects from scaling neural network outputs with adaptive learning rates.
problem Adaptive learning rate optimization's behavior is altered by output scaling, leading to misinterpretation.
method Presented a modified optimization algorithm to mitigate unintended effects.
result Adaptive learning rate's effectiveness is significantly impacted by output scaling, especially for small scaling factors.
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.
Adaptive gradient methods, which adopt historical gradient information to automatically adjust the learning rate, despite the nice property of fast convergence, have been observed to generalize worse than stochastic gradient descent (SGD) with momentum in training deep neural networks. This leaves how to close the gene…
Efficiently selects seed nodes to maximize content influence in unknown social networks.
problem Maximizing content spread in social networks with unknown network model.
method Formulated as an infinite-horizon discounted MDP, uses model-based reinforcement learning to select seed users adaptively.
result Established a regret bound of O ~ ( T ) \widetilde O(\sqrt{T}) O ( T ) for the algorithm. 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.
New method shows AdaGrad converges globally to neural network minima.
problem Convergence of adaptive gradient methods for neural networks.
method Proposed adaptive gradient method for over-parameterized neural networks.
result Converges to global minimum in polynomial time for two-layer networks.
Firms' collaboration networks can decline but remain resilient.
problem Resilience of firms' collaboration networks during decline.
method Analysis of 21,500 R&D collaborations over 25 years, simulating drop-out cascades.
result Firms' collaboration networks can adapt to mitigate decline and recover.
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.
New method AdaMod stabilizes deep neural network training by limiting adaptive learning rates.
problem Adaptive learning rates can produce extremely large values at the start of training, hindering learning.
method AdaMod uses adaptive and momental upper bounds to restrict learning rates dynamically.
result AdaMod eliminates large learning rates and improves training on complex networks.
AdaGCN transfers labels across networks via adversarial domain adaptation and graph convolution.
problem Cross-network node classification with limited labeled data.
method Adversarial domain adaptation and graph convolution.
result AdaGCN successfully transfers labels with low labeled data on source networks and significant domain divergence.
Adaptive vehicle trajectory prediction for safer autonomous driving.
problem Inability of current methods to guarantee physical feasibility and adapt to human driving policies.
method Bayesian recurrent neural network combining policy and physical models, with gradient-based training and parameter adaptation.
result The proposed method ensures physical feasibility and adaptability to human driving policies.
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.
Improves deep neural network training and accuracy with adaptive basis approach.
problem Gap between theoretical and practical performance of deep neural networks.
method Adaptive basis viewpoint, novel initializations, hybrid optimizer.
result Dramatic increases in accuracy and convergence rate for various DNN applications.
Linearized neural networks provide a fast and interpretable way to adapt models to new settings.
problem Difficulty in understanding and adapting inductive biases of trained neural networks.
method Linearization of neural networks and embedding these biases into Gaussian processes through a kernel designed from the Jacobian.
result Domain adaptation becomes interpretable posterior inference with analytic and scalable computational speed-ups.
Adaptive neural network adjusts layer depth based on computational needs.
problem Deciding the number of layers in deep recurrent neural networks is challenging.
method Proposes a layer flexible recurrent neural network with adaptive computation time.
result Improves performance by 7\% to 12\% on financial and language data.
iDAD uses neural networks to quickly adapt experiments without likelihoods.
problem Performing adaptive experiments in real-time with implicit models.
method iDAD learns a design policy network upfront to make quick design decisions.
result iDAD can make design decisions in milliseconds, unlike traditional BOED approaches.
Calibrates network confidence for unsupervised domain adaptation.
problem Calibrating a model trained on a source domain to a target domain without labeled data.
method Estimates network accuracy on the target domain and calibrates prediction confidence directly in the target domain.
result Significantly outperforms existing methods across standard datasets.
ReLeASE uses reinforcement learning and adaptive sampling to optimize neural network compilation.
problem Efficiently optimizing neural network compilation with shorter compilation time.
method Formulated as a reinforcement learning problem, with adaptive sampling to focus on representative points.
result 4.45x speed up in optimization time over AutoTVM, 5.6% improvement in inference time.
This work bridges two views of feature learning in neural networks.
problem The relationship between kernel scale changes and data-adaptive feature learning in neural networks remains unresolved.
method Using statistical mechanics, the work derives analytical expressions for network output statistics across scaling regimes.
result Kernel adaptation can be reduced to an effective kernel rescaling, but multi-scale adaptive approach provides richer insights.
New algorithm improves Bayesian neural networks using adaptive importance sampling.
problem High computational cost in training Bayesian neural networks.
method Adaptive Importance Sampling (AIS) integrated into a novel algorithm (PMCnet).
result Improved performance and exploration capabilities for both shallow and deep neural networks.
Supporting evidence for adaptive feature program across diverse models.
problem Analyzing feature learning in neural networks.
method Over-parameterized sequence models and feature error measure (FEM).
result FEM is decreasing during training of adaptive feature models.
The most widely used activation functions in current deep feed-forward neural networks are rectified linear units (ReLU), and many alternatives have been successfully applied, as well. However, none of the alternatives have managed to consistently outperform the rest and there is no unified theory connecting properties…
Autonomous robots need to interact with unknown, unstructured and changing environments, constantly facing novel challenges. Therefore, continuous online adaptation for lifelong-learning and the need of sample-efficient mechanisms to adapt to changes in the environment, the constraints, the tasks, or the robot itself a…
New method for estimating higher-order network dependencies in streaming data.
problem Estimating higher-order dependencies in massive, dynamic, and streaming networks.
method Adaptive sampling and unbiased estimators for streaming networks, with a James-Stein shrinkage estimator.
result Our approach outperforms baseline methods in estimating higher-order network structure from streaming data.
Neural network HDP improves virtual inertia control for non-inductive grids.
problem Traditional virtual inertia controllers are not suitable for non-inductive grids.
method Adaptive neural network heuristic dynamic programming (HDP) for optimal control.
result The proposed HDP controller outperforms traditional controllers in virtual inertia control.
JADAI optimizes design and inference for parameter estimation.
problem Parameter estimation with active optimization of design variables.
method Jointly trains a policy, history network, and inference network to minimize posterior error.
result Achieves superior or competitive performance across benchmarks.
Deep neural networks have excelled on a wide range of problems, from vision to language and game playing. Neural networks very gradually incorporate information into weights as they process data, requiring very low learning rates. If the training distribution shifts, the network is slow to adapt, and when it does adapt…
Adapts neural network neurons' activation functions for better predictions.
problem Training neural networks with fixed activation functions limits their performance.
method Proposes training over a shape parameter, allowing neurons to adapt their own activation functions.
result Improves prediction accuracy by allowing neurons to tune their activation functions.
Adaptive Transfer Learning improves wind power prediction accuracy.
problem Efficiently predicting wind power using limited labeled data.
method Adaptive Transfer Learning in Deep Neural Networks for wind power prediction.
result Adaptive Transfer Learning improves prediction accuracy across different wind farms and task domains.
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.
LoRA enhances model adaptability without increasing parameters.
problem Theoretical understanding of LoRA's adaptability.
method Theoretical analysis of LoRA's expressive power.
result LoRA can adapt any model to a smaller target model with a specific rank.
New algorithm reduces misclassification costs in neural networks.
problem Reduces costs of misclassified instances in neural networks.
method Adaptive Cost-Sensitive Learning (AdaCSL) adjusts loss function to bridge class distribution mismatches.
result Deep neural networks with AdaCSL outperform other methods on cost-sensitive binary classification tasks.
Adaptive optimization methods bias neural network trajectories towards regions of lower local geometry.
problem The success of adaptive optimization methods in neural networks is not fully explained by traditional second-order methods.
method Local trajectory analysis and introduction of a new statistic R e x t m e d e x t O P T R^{ ext{OPT}}_{ ext{med}} R e x t m e d e x t O P T . result Adaptive methods like Adam bias trajectories towards regions of lower local geometry, leading to faster convergence.
Study on gradient dynamics of shallow ReLU networks for least-squares interpolation.
problem Understanding the gradient dynamics of shallow ReLU networks for interpolation.
method Theoretical and empirical analysis of gradient flow in non-redundant parameterization.
result Identification of two learning regimes: kernel and adaptive, with distinct interpolant shapes.
Adaptive regularization improves neural network performance on small datasets.
problem Improving neural network performance on limited data.
method Adaptive regularization using a matrix-variate normal prior with a Kronecker product structure.
result The method leads to networks with smaller stable ranks and spectral norms, suggesting better generalization.