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.
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.
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.
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.
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.
We present RAPID (Real-time Automated Photometric IDentification), a novel time-series classification tool capable of automatically identifying transients from within a day of the initial alert, to the full lifetime of a light curve. Using a deep recurrent neural network with Gated Recurrent Units (GRUs), we present th…
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.
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.
Neural networks have been successfully applied in applications with a large amount of labeled data. However, the task of rapid generalization on new concepts with small training data while preserving performances on previously learned ones still presents a significant challenge to neural network models. In this work, w…
There has been rapid progress recently on the application of deep networks to the solution of partial differential equations, collectively labelled as Physics Informed Neural Networks (PINNs). In this paper, we develop Physics Informed Extreme Learning Machine (PIELM), a rapid version of PINNs which can be applied to s…
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 …
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.
Exact solutions reveal how unbalanced initializations promote rapid feature learning in neural networks.
problem Understanding how neural networks efficiently extract features from data.
method Deriving exact solutions to a minimal model of neural networks transitioning between lazy and rich learning regimes.
result Unbalanced layer-specific initialization variances and learning rates determine the degree of feature learning.
RAPTOR-GEN accelerates digital twin development for biopharmaceuticals.
problem Lack of agility in rapid, on-demand production of biotherapeutics due to bioprocess complexity.
method Bayesian learning framework based on a multi-scale probabilistic knowledge graph (pKG) and stochastic differential equations (SDE).
result RAPTOR-GEN accelerates intelligent digital twin development from sparse and heterogeneous experimental data.
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).
Machine Learning (ML) and Deep Learning (DL) innovations are being introduced at such a rapid pace that model owners and evaluators are hard-pressed analyzing and studying them. This is exacerbated by the complicated procedures for evaluation. The lack of standard systems and efficient techniques for specifying and pro…
Rapid identification of bacteria is essential to prevent the spread of infectious disease, help combat antimicrobial resistance, and improve patient outcomes. Raman optical spectroscopy promises to combine bacterial detection, identification, and antibiotic susceptibility testing in a single step. However, achieving cl…
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…
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
ARCADe detects anomalies in a sequence of tasks with limited data.
problem Learning a sequence of anomaly detection tasks with only normal class examples.
method Formulated as a meta-learning problem, ARCADe addresses catastrophic forgetting and overfitting.
result ARCADe outperforms baselines on three datasets.
Dr. of Crosswise proposes a new architecture to reduce over-parametrization in Neural Networks. It introduces an operand for rapid computation in the framework of Deep Learning that leverages learned weights. The formalism is described in detail providing both an accurate elucidation of the mechanics and the theoretica…
Deep learning dynamics and NTK evolution studied through diverse measures.
problem Understanding the training dynamics of deep neural networks and their loss landscapes.
method Phenomenological analysis of training dynamics in multiple architectures and datasets.
result Training dynamics exhibit a chaotic initial transient followed by a stable phase, with the NTK evolving to match full network performance.
Agents struggle with solving tasks in new environments, but new models improve performance.
problem Rapid task-solving in novel environments.
method Developed EPNs to enable deep RL agents to plan over gathered knowledge.
result EPNs enable deep RL agents to excel at RTS, outperforming baselines by factors of 2-3.
Meta-Dynamic models learn shared neural dynamics across tasks.
problem Learning latent dynamics from neural recordings across different tasks.
method Captures variabilities on a low-dimensional manifold to meta-learn dynamics.
result Meta-Dynamic models can rapidly learn latent dynamics from new recordings.
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…
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.
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.
Obtaining magnetic resonance images (MRI) with high resolution and generating quantitative image-based biomarkers for assessing tissue biochemistry is crucial in clinical and research applications. How- ever, acquiring quantitative biomarkers requires high signal-to-noise ratio (SNR), which is at odds with high-resolut…
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.
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.
Improves numerical solution of ill-conditioned linear systems for machine learning.
problem Wastefulness and instability in solving ill-conditioned linear systems.
method autonugget combines Richardson extrapolation to determine the solution of the ill-conditioned system, improving accuracy over a single nugget.
result Improves accuracy of numerical solution of ill-conditioned linear systems.
In this paper we present an algorithm for rapid Bayesian analysis that combines the benefits of nested sampling and artificial neural networks. The blind accelerated multimodal Bayesian inference (BAMBI) algorithm implements the MultiNest package for nested sampling as well as the training of an artificial neural netwo…
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.
Study shows rapid decay of Hitchin metric from semi-flat metric on Higgs bundles.
problem Analyzing the asymptotic behavior of the Hitchin metric on moduli spaces of Higgs bundles.
method Examined the decay rate of the difference between Hitchin and semi-flat metrics on smooth spectral curves.
result Exponential decay of the difference between Hitchin and semi-flat metrics as t approaches infinity.
Part-of-speech (POS) tagging is a fundamental component for performing natural language tasks such as parsing, information extraction, and question answering. When POS taggers are trained in one domain and applied in significantly different domains, their performance can degrade dramatically. We present a methodology f…
Develops a new calculus for studying operators on principal bundles.
problem Investigates G-equivariant operators on principal bundles over manifolds. method Introduces Borel-Weil calculus to analyze G-equivariant (pseudo)differential operators. result Explicit conditions for rapid mixing in dynamical systems and spectral theory results for sub-elliptic Laplacians.
ReCAP adapts to dynamic financial markets by segmenting and combining policy vectors.
problem Inefficient traditional PM approaches in non-stationary financial markets.
method Integrates continual learning into PM, segmenting regimes and adapting policies.
result Consistently outperforms baselines in real-world financial datasets.
We propose a tensor neural network (t-NN) framework that offers an exciting new paradigm for designing neural networks with multidimensional (tensor) data. Our network architecture is based on the t-product (Kilmer and Martin, 2011), an algebraic formulation to multiply tensors via circulant convolution. In this $t…
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.
Deep learning predicts RNA degradation from crowdsourced data.
problem Predicting RNA degradation to improve thermostability.
method Crowdsourced machine learning competition on Kaggle.
result 41% of predictions matched experimental data, and models generalized to longer RNA molecules.
We study the geometry of infinitely presented groups satisfying the small cancelation condition C'(1/8), and define a standard decomposition (called the criss-cross decomposition) for the elements of such groups. We use it to prove the Rapid Decay property for groups with the stronger small cancelation property C'(1/10…
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.
Polynomial growth bounds for eigenfunctions on non-compact spaces.
problem Growth of eigenfunctions on non-compact spaces with Gaussian weight.
method Analyzing non-compact manifolds with Gaussian weight and drift Laplacian.
result Showed same polynomial growth bounds as Euclidean space for general tensors.
A low-cost, robust, and simple mechanism to measure hemoglobin would play a critical role in the modern health infrastructure. Consistent sample acquisition has been a long-standing technical hurdle for photometer-based portable hemoglobin detectors which rely on micro cuvettes and dry chemistry. Any particulates (e.g.…
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.
Survey of DRO, a robust optimization framework.
problem Risk-aversion and chance-constrained optimization challenges.
method Distributionally robust optimization (DRO) framework.
result DRO's growing importance in operations research and statistics.
DONNA rapidly finds optimal neural networks across diverse spaces.
problem Efficient scaling and handling of diverse architectural search-spaces in NAS.
method Three-phase pipeline: accuracy predictor, rapid evolutionary search, and optimal model finetuning.
result 100x faster than MNasNet in finding state-of-the-art architectures on-device.