Dr. of Crosswise reduces over-parametrization in neural networks.
problem Reduction of over-parametrization in neural networks.
method Introduces a new operand for rapid computation in neural networks framework.
result Reduces over-parametrization in neural networks.
Reservoir computing is a neural network approach for processing time-dependent signals that has seen rapid development in recent years. Physical implementations of the technique using optical reservoirs have demonstrated remarkable accuracy and processing speed at benchmark tasks. However, these approaches require an e…
Paper uses deep learning to detect cyclone rapid intensification.
problem Detecting rare cyclone rapid intensification events.
method Deep learning, ensemble learning, and data augmentation frameworks.
result Data augmentation improves rapid intensification detection.
We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that t…
New proof shows rapid mixing for random walks on nilmanifolds.
problem Proving rapid mixing for random walks on nilmanifolds.
method Proved rapid mixing for almost all random walks generated by m translations on nilmanifolds under mild assumptions.
result For several classical classes of nilmanifolds, m=2 suffices for rapid mixing.
Quantum computing speeds up neural network training and retraining.
problem Inefficient classical training and retraining of neural networks.
method Adiabatic quantum computing to optimize Kolmogorov-Arnold Networks using Bezier curves.
result Quantum optimization achieves 100x faster retraining compared to classical methods.
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.
Constructs index for elliptic operators using rapidly decaying kernels.
problem Index of elliptic operators in Fréchet algebra.
method Uses heat operators and heat kernel asymptotics.
result Index can be represented by an idempotent involving heat operators.
Since Giles introduced the multilevel Monte Carlo path simulation method [18], there has been rapid development of the technique for a variety of applications in computational finance. This paper surveys the progress so far, highlights the key features in achieving a high rate of multilevel variance convergence, and su…
New method detects TC imagery patterns for rapid intensity change.
problem Detecting upcoming rapid intensity changes in TC satellite imagery.
method Nonparametric test of association between images and event labels using neural networks and bootstrap.
result Identifies archetypes of infrared imagery associated with elevated rapid intensification risk.
This paper reviews feature selection methods using swarm intelligence.
problem Reducing dimensionality in high-dimensional datasets.
method Comparative analysis of swarm intelligence-based feature selection methods.
result Evaluation of strengths and weaknesses of swarm intelligence-based methods.
Scalable solution for interpreting complex data-driven models.
problem Interpreting black box models and handling large datasets.
method Streaming neighborhood graph construction, topology computation, and data aggregation.
result Interactive exploration of high-dimensional data.
RAPID identifies transients in days, improving classification accuracy over time.
problem Early identification and classification of astronomical transients.
method Deep recurrent neural network with Gated Recurrent Units (GRUs).
result Average AUC of 0.95 and 0.98 at early and late epochs, respectively.
We study a notion of a Lipschitz, permutation-invariant "centroid" for triples of points in mapping class groups MCG(S), which satisfies a certain polynomial growth bound. A consequence (via work of Drutu-Sapir or Chatterji-Ruane) is the Rapid Decay Property for MCG(S).
DeltaGrad rapidly retrain models with minimal data changes.
problem Rapid retraining of machine learning models with minimal data changes.
method DeltaGrad algorithm based on cached training information.
result DeltaGrad compares favorably to state-of-the-art methods.
Rapid mixing of Langevin dynamics on Riemannian manifolds
problem Mixing time of Langevin dynamics on Riemannian manifolds
method Relation between Langevin processes in domain and image
result Achievable polynomial mixing times
Paper proposes diagnostics for error and variance estimation in randomized matrix computations.
problem Safe use of randomized matrix algorithms in applications.
method Leave-one-out error estimator and jackknife resampling method.
result Provides rapid diagnostics to assess quality of randomized matrix computations.
CNN model predicts fluvial floods quickly and accurately.
problem Real-time flood prediction is computationally demanding.
method Deep Convolutional Neural Network (CNN) trained on 2D hydraulic model outputs.
result CNN model outperforms SVR in predicting flood inundation.
With the rapid growth of the data volume and the fast increasing of the computational model complexity in the scenario of cloud computing, it becomes an important topic that how to handle users' requests by scheduling computational jobs and assigning the resources in data center. In order to have a better perception of…
EdgeAI aims to deploy deep learning on IoT devices.
problem Deep learning's high computational demands on IoT devices.
method Addressing data-independent deployment and communication-aware distributed inference.
result New directions to enable deep learning on IoT devices.
GluonCV and GluonNLP simplify deep learning for CV and NLP.
problem Lack of easy-to-use deep learning tools for CV and NLP.
method Developed modular APIs and pre-trained models for rapid prototyping.
result Facilitates rapid prototyping and reproducible research in CV and NLP.
AI helps forecasters understand TC convective evolution before intensification.
problem Challenges in extracting scientific insights from complex TC data.
method Combining AI prediction algorithms and classical statistical inference.
result Identifies patterns in TC convective structure leading to intensification.
This study presents a rapid multiple incremental and decremental mechanism based on Weight-Error Curves (WECs) for support-vector analysis. Recursion-free computation is proposed for predicting the Lagrangian multipliers of new samples. This study examines Ridge Support Vector Models, subsequently devising a recursion-…
NIPA aims to translate brain learning mechanisms into scalable Bayesian inference.
problem Scalable Bayesian inference for large-scale statistical machine learning problems.
method Neural-inspired algorithm combining model-based, model-free, and episodic-control modules.
result Advances Bayesian methods and facilitates their application to deep learning.
Predicting and improving player retention is crucial to the success of mobile Free-to-Play games. This paper explores the problem of rapid retention prediction in this context. Heuristic modeling approaches are introduced as a way of building simple rules for predicting short-term retention. Compared to common classifi…
IRCUR accelerates RPCA by using CUR decomposition for efficient low rank estimation.
problem Dimension reduction in robust principal component analysis.
method IRCUR employs CUR decomposition to update the low rank component efficiently.
result IRCUR achieves significant computational efficiency compared to existing algorithms.
New minimal surfaces grow area very quickly.
problem Understanding minimal surfaces with rapid area growth.
method Examples of minimal immersions in Euclidean space.
result Proper minimal surfaces with rapid area growth found.
A new method learns FCMs from noisy data quickly and robustly.
problem Learning large-scale FCMs with noisy data is time-consuming and lacks robustness.
method Transformed learning problem to convex optimization with least-squares and maximum entropy terms.
result The method is rapid, robust, and performs well on synthetic and real-world datasets.
Study on rapid policy changes in reinforcement learning.
problem Rapid change of greedy policy in reinforcement learning.
method Empirical study and ablation analysis.
result Policy churn is a beneficial form of implicit exploration.
In this work, sequence-to-sequence (seq2seq) models, originally developed for language translation, are used to predict the temporal evolution of complex, multi-physics computer simulations. The predictive performance of seq2seq models is compared to state transition models for datasets generated with multi-physics cod…
Machine learning classifies polymer links with high accuracy.
problem Classifying knots and links in polymer melts and biological systems.
method Feedforward neural network trained on writhe density matrix.
result 97% accuracy in classifying six prime links across temperatures and lengths.
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.
We investigate unsupervised pre-training of deep architectures as feature generators for "shallow" classifiers. Stacked Denoising Autoencoders (SdA), when used as feature pre-processing tools for SVM classification, can lead to significant improvements in accuracy - however, at the price of a substantial increase in co…
We study distributed stochastic convex optimization under the delayed gradient model where the server nodes perform parameter updates, while the worker nodes compute stochastic gradients. We discuss, analyze, and experiment with a setup motivated by the behavior of real-world distributed computation networks, where the…
In this paper, a rapid and high accurate numerical method for pricing discrete single and double barrier knock-out call options is presented. According to the well-known Black-Scholes framework, the price of option in each monitoring date could be calculate by computing a recursive integral formula upon the heat equati…
We study a novel spline-like basis, which we name the "falling factorial basis", bearing many similarities to the classic truncated power basis. The advantage of the falling factorial basis is that it enables rapid, linear-time computations in basis matrix multiplication and basis matrix inversion. The falling factoria…
PES method reduces bias in gradient estimation for unrolled graphs.
problem High variance and bias in gradient estimation for unrolled computation graphs.
method Divide graph into unrolls, apply ES update, accumulate correction terms.
result PES provides unbiased, low-variance gradient estimates.
Python package for fast simulation-based inference.
problem Intractable likelihood functions in Bayesian inference.
method Uses neural networks as surrogate models for Bayesian inference.
result Highly efficient and user-friendly for constructing SBI estimators.
Optimization algorithms and Monte Carlo sampling algorithms have provided the computational foundations for the rapid growth in applications of statistical machine learning in recent years. There is, however, limited theoretical understanding of the relationships between these two kinds of methodology, and limited unde…
RAPID efficiently samples SVDD subsets for better anomaly detection.
problem Efficiently sampling SVDD subsets for large datasets.
method Formulated as an optimization problem, RAPID selects samples that approximate the full SVDD decision boundary.
result RAPID outperforms competitors in classification accuracy, sample size, and runtime.
To improve the efficiency of Monte Carlo estimation, practitioners are turning to biased Markov chain Monte Carlo procedures that trade off asymptotic exactness for computational speed. The reasoning is sound: a reduction in variance due to more rapid sampling can outweigh the bias introduced. However, the inexactness …
Paper tackles hidden game problem in AI alignment and language games.
problem Hidden game problem in AI alignment and language games.
method Developed a composition of regret minimization techniques to discover and exploit hidden structures.
result Achieved optimal external and swap regret bounds for rapid convergence to correlated equilibria.
Quantum computing speeds up multi-period asset allocation.
problem High computational complexity in classic computing for multi-period asset allocation.
method Applied quantum computing to simulate multi-asset portfolio using historic data.
result Quantum computing offers significant advantages over classical computing in finance.
We describe a mechanism by which artificial neural networks can learn rapid adaptation - the ability to adapt on the fly, with little data, to new tasks - that we call conditionally shifted neurons. We apply this mechanism in the framework of metalearning, where the aim is to replicate some of the flexibility of human …
Framework improves ML flood mapping generalization.
problem Improving machine learning models' ability to generalize to new conditions.
method Dimensionless, multi-scale features constrained by the Buckingham Π theorem.
result Model outperformed dimensional features, improving AUC in unmapped areas.
ELM struggles with real data, new methods improve performance and speed.
problem Low convergence of SVD in ELM for real-life large data.
method Replaced SVD with 5 methods: lower upper triangularization, Hessenberg decomposition, Schur decomposition, modified Gram Schmidt algorithm, and Householder reflection.
result Hessenberg decomposition for training pace, Householder reflection for performance in EEG-based brain-computer interface.
PIELM uses deep learning to solve PDEs quickly and accurately.
problem Solving partial differential equations (PDEs) efficiently and accurately.
method Physics Informed Extreme Learning Machine (PIELM) for solving PDEs.
result PIELM matches or exceeds the accuracy of Physics Informed Neural Networks (PINNs) on various problems.
Deep learning model predicts tropical cyclone intensification using satellite images.
problem Accurately predicting rapid intensification of tropical cyclones.
method Attention-based deep learning model using satellite images.
result Deep learning models outperform traditional methods in RI prediction.