Proposes SAG-DBSCAN for clustering with self-adaptation.
problem Clustering analysis in data mining.
method Uses grey relational matrix and DBSCAN for clustering.
result Demonstrates superior performance compared to other methods.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “self-adaptation”
Self-adaptive training improves deep learning robustness.
problem Improving deep learning performance on corrupted data.
method Dynamic correction of problematic labels using model predictions.
result Self-adaptive training significantly improves generalization over ERM under various levels of noise.
A self-adaptive and robust fission clustering algorithm via heat diffusion and maximal turning anglecs.LG
A new clustering algorithm fuses heat diffusion and turning angle for robustness.
problem Cluster similar elements in various fields.
method Combines heat diffusion and maximal turning angle for robust fission clustering.
result The SARFC algorithm outperforms other methods in clustering performance.
Voice activity detection (VAD), which classifies frames as speech or non-speech, is an important module in many speech applications including speaker verification. In this paper, we propose a novel method, called self-adaptive soft VAD, to incorporate a deep neural network (DNN)-based VAD into a deep speaker embedding …
Self-adaptive PINNs improve accuracy in stiff PDEs.
problem Accurate numerical solution of stiff PDEs using neural networks.
method Adaptive weights applied to each training point individually, using a soft attention mechanism.
result SA-PINNs outperform other PINN algorithms in L2 error with fewer training epochs.
Proposes EDESH-SA for better inventory management under uncertainty.
problem Inventory management under uncertainty.
method Ensemble Differential Evolution with simulation-based hybridization and self-adaptation.
result Improves financial performance and optimizes search spaces.
M-L2O adapts fast to new tasks by self-adapting during test-time.
problem L2O optimizers struggle with out-of-distribution tasks.
method Meta-training an L2O optimizer to adapt quickly to new tasks.
result M-L2O converges significantly faster than vanilla L2O with only 5 steps of adaptation.
Improves neural networks by adjusting labels to reduce overfitting to noisy data.
problem Reduces overfitting to mislabeled or non-representative samples in neural networks.
method Combines self-adaptive training with mixup to improve accuracy and robustness.
result Achieves state-of-the-art accuracy on image recognition datasets with label noise.
Learning Whenever Learning is Possible: Universal Learning under General Stochastic Processesstat.ML
This work initiates a general study of learning and generalization without the i.i.d. assumption, starting from first principles. While the traditional approach to statistical learning theory typically relies on standard assumptions from probability theory (e.g., i.i.d. or stationary ergodic), in this work we are inter…
PDE-Foam - a probability-density estimation method using self-adapting phase-space binningphysics.data-an
Probability Density Estimation (PDE) is a multivariate discrimination technique based on sampling signal and background densities defined by event samples from data or Monte-Carlo (MC) simulations in a multi-dimensional phase space. In this paper, we present a modification of the PDE method that uses a self-adapting bi…
Structure plays a key role in learning performance. In centralized computational systems, hyperparameter optimization and regularization techniques such as dropout are computational means to enhance learning performance by adjusting the deep hierarchical structure. However, in decentralized deep learning by the Interne…
Speech enhancement improved by adapting to unknown speakers without auxiliary signals.
problem Improving speech enhancement accuracy for unknown speakers.
method Adopting multi-task learning for speech enhancement and speaker identification, using multi-head self-attention.
result Achieved state-of-the-art performance and improved subjective quality.
Paper presents a self-adaptive learning model for robust classification and regression.
problem Dealing with various datasets of different complexity.
method Combines DNDN and DSP, an end-to-end training approach with multiple randomly initialized softmax layers and adaptive soft pruning.
result The model demonstrates no performance loss compared with unpruned models and higher robustness over different data and feature distributions.
Paper introduces a novel error measure for neural networks integrating statistical and information theory.
problem No single error measure is universally best for neural network training.
method Developed a novel error measure and integrated it into the Levenberg-Marquardt algorithm.
result Self-adaptive, dynamic learning algorithm improves both model accuracy and training process.
The human brain is able to learn, generalize, and predict crossmodal stimuli. Learning by expectation fine-tunes crossmodal processing at different levels, thus enhancing our power of generalization and adaptation in highly dynamic environments. In this paper, we propose a deep neural architecture trained by using expe…
Enhances financial time series forecasting with a multi-period learning framework.
problem Accurate financial time series forecasting requires considering both short-term and long-term trends.
method Proposes a Multi-period Learning Framework (MLF) with three modules: Inter-period Redundancy Filtering, Learnable Weighted-average Integration, and Multi-period self-Adaptive Patching.
result Improves financial time series forecasting accuracy and efficiency.
In this article, we propose a new class of priors for Bayesian inference with multiple Gaussian graphical models. We introduce fully Bayesian treatments of two popular procedures, the group graphical lasso and the fused graphical lasso, and extend them to a continuous spike-and-slab framework to allow self-adaptive shr…
The Efficient Global Optimization (EGO) algorithm uses a conditional Gaus-sian Process (GP) to approximate an objective function known at a finite number of observation points and sequentially adds new points which maximize the Expected Improvement criterion according to the GP. The important factor that controls the e…
MASA framework uses RL to balance portfolio returns and risks.
problem Managing portfolio risk in turbulent financial markets.
method Multi-agent reinforcement learning with a market observer.
result MASA framework outperforms RL approaches in balancing returns and risks.
ICSGLD improves efficiency in posterior sampling for big data.
problem Efficient posterior sampling for large datasets.
method Embarrassingly parallel multiple-chain CSGLD with efficient interactions.
result ICSGLD is more efficient than a single-chain CSGLD.
New bounds show agnostic multiclass learning depends on two dimensions: Natarajan and Daniely-Shalev-Shwartz.
problem Understanding sample complexity in multiclass classification with agnostic learning.
method Developed a novel online procedure based on a self-adaptive multiplicative-weights algorithm.
result Agnostic sample complexity bounds are in the form of DS^(1.5)/ε + Nat/ε^2, nearly tight up to a √DS factor.
We propose a novel adaptive empirical Bayesian method for sparse deep learning, where the sparsity is ensured via a class of self-adaptive spike-and-slab priors. The proposed method works by alternatively sampling from an adaptive hierarchical posterior distribution using stochastic gradient Markov Chain Monte Carlo (M…
A contextual care protocol is used by a medical practitioner for patient healthcare, given the context or situation that the specified patient is in. This paper proposes a method to build an automated self-adapting protocol which can help make relevant, early decisions for effective healthcare delivery. The hybrid mode…
Traditional activity recognition systems work on the basis of training, taking a fixed set of sensors into account. In this article, we focus on the question how pattern recognition can leverage new information sources without any, or with minimal user input. Thus, we present an approach for opportunistic activity reco…
FLAME auto-labels mobile data efficiently on diverse processors.
problem Accurately and efficiently labeling mobile data with unknown labels on heterogeneous processors.
method Self-adaptive auto-labeling system Flame that schedules and executes workloads on mobile processors.
result Flame achieves high labeling accuracy and performance on heterogeneous mobile processors.
Framework improves gradient estimation for faster training convergence.
problem Efficiently estimating noisy gradients in stochastic optimization.
method Dynamic adaptive importance sampling combining multiple distributions.
result Adaptively weighted multiple importance sampling yields superior gradient estimates.
New algorithm reduces optimization complexity in adaptive mirror descent.
problem Optimizing complex, non-smooth, non-convex functions efficiently.
method SVRAMD: Variance Reduced Adaptive Mirror Descent.
result Variance reduction accelerates convergence in adaptive mirror descent.
A new algorithm flattens multi-modal distributions for better deep learning.
problem Bayesian learning in big data with multi-modal distributions.
method Contour Stochastic Gradient Langevin Dynamics (CSGLD) algorithm.
result The CSGLD algorithm avoids local traps in deep neural networks.
Multi-step-ahead time series prediction is one of the most challenging research topics in the field of time series modeling and prediction, and is continually under research. Recently, the multiple-input several multiple-outputs (MISMO) modeling strategy has been proposed as a promising alternative for multi-step-ahead…
Recent researches have shown that deep forest ensemble achieves a considerable increase in classification accuracy compared with the general ensemble learning methods, especially when the training set is small. In this paper, we take advantage of deep forest ensemble and introduce the Dense Adaptive Cascade Forest (daF…
In medical real-world study (RWS), how to fully utilize the fragmentary and scarce information in model training to generate the solid diagnosis results is a challenging task. In this work, we introduce a novel multi-instance neural network, AMI-Net+, to train and predict from the incomplete and extremely imbalanced da…
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.
Spectral clustering for directed graphs using likelihood estimation.
problem Clustering directed graphs with edge directions.
method Maximum likelihood estimation on stochastic block models.
result Significant performance gains over existing methods.
Log-Aesthetic Curves: Similarity Geometry, Integrable Discretization and Variational Principlesnlin.SI
In this paper, we consider a class of plane curves called log-aesthetic curves and their generalization which are used in computer aided geometric design. We consider these curves in the framework of the similarity geometry and characterize them as invariant curves under the integrable flow on plane curves which is gov…
AAMDRL uses DRL to manage assets in noisy, changing environments.
problem Learning in noisy, self-adapting environments with sequential data.
method Augmented state information, one-period lag, walk forward analysis.
result AAMDRL outperforms traditional methods in asset management.
Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…
VAV method optimizes learning rate for faster, stable SGD convergence.
problem Optimizing learning rate for efficient and stable machine learning models.
method Energy-based self-adaptive learning rate with auxiliary variable .
result VAV method achieves faster convergence and superior stability with larger learning rates.
SAPAG attacks distributed learning by reconstructing true training data from gradients.
problem Privacy attacks on distributed learning systems through gradients.
method SAPAG uses a Gaussian kernel-based gradient difference distance measure.
result SAPAG can reconstruct training data on various DNNs and at different training phases.
Efficiently adapting to new environments and changes in dynamics is critical for agents to successfully operate in the real world. Reinforcement learning (RL) based approaches typically rely on external reward feedback for adaptation. However, in many scenarios this reward signal might not be readily available for the …
CRATOS clusters time series for efficient anomaly detection.
problem No clear boundary between normal and anomalous behaviors in time series.
method CRATOS clusters time series, then uses evolutionary algorithms to find best anomaly detection methods.
result Significantly reduces development and maintenance costs of anomaly detection.
WamOL uses PINNs to efficiently calibrate IVS from sparse data.
problem Calibrating time-dependent IVS from sparse market data.
method Physics-Informed Neural Networks (PINNs) with adaptive reweighting.
result WamOL outperforms in calibrating intraday IVS from uneven data.
Study improves self-driving safety in dynamic environments.
problem Safe self-driving in non-stationary urban settings.
method Neurosymbolic Meta-Reinforcement Lookahead Learning (NUMERLA).
result Self-driving agents can adapt safely in real-time.
Paper introduces timing-based adversarial attacks on DRL-based navigation systems.
problem Vulnerability of DRL-based navigation systems to adversarial attacks.
method Timing-based adversarial strategies using physical noise patterns.
result Adversarial timing attacks significantly degrade DRL-based navigation performance.
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.
SAIL learns from sub-optimal demonstrations to improve sample efficiency in sparse reward tasks.
problem Reducing sample complexity in sparse-rewarded tasks.
method Self-Adaptive Imitation Learning (SAIL) that exploits sub-optimal demonstrations and efficient exploration.
result Significantly improved sample efficiency and better final performance across various tasks.
SA-REMBO adapts to nonstationary high-dimensional optimization.
problem Bayesian Optimization in high-dimensional spaces is limited by the curse of dimensionality and rigidity of global assumptions.
method SA-REMBO uses multiple random Gaussian embeddings and an index variable to adaptively select the best embedding for the optimization problem.
result SA-REMBO outperforms traditional REMBO and other low-rank BO methods across synthetic and real-world benchmarks.
Proposes GIL for semi-supervised graph classification.
problem Semi-supervised classification of graph data with limited labeled nodes.
method Graph Inference Learning framework that learns node label inference from graph topology.
result Significantly improves semi-supervised node classification performance.
ReRe detects anomalies in real-time for time series data.
problem Real-time anomaly detection for time series data requires human intervention or domain knowledge and high computation complexity.
method ReRe uses two lightweight LSTM models to predict and determine anomalies based on historical data and adaptive thresholds.
result ReRe detects anomalies in real-time without requiring human intervention or domain knowledge.