Research
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

22446688 · Jun 202019922001200920172026
48 results for automatic

Classifies when homeomorphism groups of stable surfaces have automatic continuity.

problem Determining when homeomorphism groups of stable surfaces are continuous.
method Developed a general framework to prove automatic continuity for homeomorphism groups, applied to stable surfaces and Stone spaces.
result Classification of stable surfaces with respect to automatic continuity of their homeomorphism groups.

The theory of automatic groups is developed, including properties and practical algorithms.

problem Proving and understanding automatic groups and their properties.
method Historical introduction, definitions, basic properties, proofs for specific groups, software development, practical algorithms, and open problems.
result Automatic, biautomatic, and combable groups are defined and their properties are derived.

Classifies surfaces for pure mapping class groups with automatic continuity.

problem Determining surfaces for which pure mapping class groups have automatic continuity.
method Completely classified orientable infinite-type surfaces and specific cases of surfaces with finite ends.
result Classification of surfaces for automatic continuity of pure mapping class groups.

Automatic differentiation---the mechanical transformation of numeric computer programs to calculate derivatives efficiently and accurately---dates to the origin of the computer age. Reverse mode automatic differentiation both antedates and generalizes the method of backwards propagation of errors used in machine learni…

2014-04-28abs ↗pdf ↗

Method uses Seq2Seq learning to automatically generate recovery commands for ICT systems.

problem Manual decision-making for recovery commands is time-consuming and error-prone.
method Seq2Seq neural network model trained on past logs and commands.
result The model can estimate accurate recovery commands from new failures.

Develops a mathematical model for automatic differentiation in machine learning.

problem Current automatic differentiation lacks a simple mathematical model for machine learning.
method Articulates relationships between program differentiation and nonsmooth functions, provides a class of functions and nonsmooth calculus.
result Shows how nonsmooth calculus applies to stochastic approximation methods and evidence of artificial critical points.

agtboost speeds up gradient tree boosting with automatic complexity adjustment.

problem Speeding up and simplifying gradient tree boosting computations.
method Adaptive gradient tree boosting with automatic complexity adjustment and feature importance.
result Significant decrease in computation time and simplification of model complexity.

Making sense of a dataset in an automatic and unsupervised fashion is a challenging problem in statistics and AI. Classical approaches for {exploratory data analysis} are usually not flexible enough to deal with the uncertainty inherent to real-world data: they are often restricted to fixed latent interaction models an…

2018-07-24abs ↗pdf ↗

Super-efficient automatic differentiation outperforms analytic methods in min-min optimization.

problem Optimizing functions defined as a minimum using iterative algorithms.
method Comparing automatic differentiation to analytic gradient estimation methods.
result Automatic differentiation yields an asymptotic error close to the square of the optimization error, demonstrating super-efficiency.

D-Adaptation automatically sets optimal learning rates without manual tuning.

problem Optimizing learning rates for efficient convergence in machine learning.
method D-Adaptation, which asymptotically achieves optimal learning rates without back-tracking or additional evaluations.
result D-Adaptation automatically matches hand-tuned learning rates across diverse problems.

GP model for time series forecasting with priors.

problem Automatic selection of optimal kernels and reliable estimation of hyperparameters.
method Fixed composition of kernels, automatic relevance determination (ARD), empirical Bayes priors.
result GP model is more accurate than state-of-the-art models.

The performance of automatic speech recognition systems(ASR) degrades in the presence of noisy speech. This paper demonstrates that using electroencephalography (EEG) can help automatic speech recognition systems overcome performance loss in the presence of noise. The paper also shows that distillation training of auto…

2019-03-02abs ↗pdf ↗

This paper describes the data collection effort that is part of the project Sprekend Nederland (The Netherlands Talking), and discusses its potential use in Automatic Accent Location. We define Automatic Accent Location as the task to describe the accent of a speaker in terms of the location of the speaker and its hist…

2016-02-08abs ↗pdf ↗

Variational inference is a scalable technique for approximate Bayesian inference. Deriving variational inference algorithms requires tedious model-specific calculations; this makes it difficult to automate. We propose an automatic variational inference algorithm, automatic differentiation variational inference (ADVI). …

2015-06-10abs ↗pdf ↗

Meta-SAC automatically tunes SAC's entropy temperature for better exploration.

problem Exploration-exploitation dilemma in reinforcement learning.
method Meta-SAC uses metagradient and a novel meta objective to automatically adjust SAC's entropy temperature.
result Meta-SAC outperforms SAC-v2 by 10% on the humanoid-v2 task.

Proposes an automatic cyclical scheduling for gradient-based discrete sampling.

problem Gradient-based sampling in high-dimensional models can get stuck in local modes.
method Cyclical step size and balancing schedules with automatic hyperparameter tuning.
result Proves non-asymptotic convergence and inference guarantees for general discrete distributions.

In this paper we study automatically recognized trends and investigate their statistics. To do that we introduce the notion of a wavelength for time series via cross correlation and use this wavelength to calibrate the 1-2-3 trend indicator of Maier-Paape [Automatic One Two Three, Quantitative Finance, 2013] to automat…

2014-09-18abs ↗pdf ↗

This paper proposes automatic tuning of Bayesian Optimization's acquisition function.

problem Optimizing black-box functions with noisy, expensive evaluations and hyperparameter tuning.
method Exploring heuristics to automatically tune acquisition functions in Bayesian Optimization.
result Demonstrates effectiveness of heuristics in automatic Bayesian Optimization.

The paper analyzes sports commentary to automatically recognize events and extract insights.

problem Automatically recognizing and categorizing major actions in sports events from commentary.
method Used multiple Natural Language Processing techniques for classification and sentiment analysis.
result Identified insights from analyzing live sport commentaries and classifying major actions.

We use AD to compute gradients for complex functionals in stochastic model calibration.

problem Computing gradients for functions involving expectations in stochastic models.
method Automatic Adjoint Differentiation and parallelization.
result Faster and easier to implement approaches for gradient computation.

AutoFIS automatically selects important feature interactions for CTR prediction models.

problem Manual feature interaction design is inefficient and prone to noise.
method Two-stage algorithm: search stage relaxes feature interactions to continuous parameters, re-train stage refines model performance.
result AutoFIS significantly improves CTR and CVR of FM-based models.

This work presents an approach to automatically induction for non-greedy decision trees constructed from neural network architecture. This construction can be used to transfer weights when growing or pruning a decision tree, allowing non-greedy decision tree algorithms to automatically learn and adapt to the ideal arch…

2018-11-26abs ↗pdf ↗

In this note, we report the back propagation formula for complex valued singular value decompositions (SVD). This formula is an important ingredient for a complete automatic differentiation(AD) infrastructure in terms of complex numbers, and it is also the key to understand and utilize AD in tensor networks.

2019-09-04abs ↗pdf ↗

Generative adversarial network system improves ECG arrhythmia classification.

problem Improving automatic ECG arrhythmia classification accuracy.
method Generative adversarial network with patient-specific normal beats and generated abnormal beats.
result Superior overall classification performance for SVEB and VEB on MIT-BIH arrhythmia database.

Automatically generates a deep RL curriculum for faster and more stable learning.

problem How to automatically generate a curriculum for deep RL agents.
method Interprets curriculum generation as an inference problem, learning task distributions progressively.
result Curricula significantly improve learning performance across various environments and deep RL algorithms.

Learn to automatically plug domain-specific modules into a common network.

problem Learning inflexibility and computational intensiveness in multi-domain learning.
method Neural Architecture Search (NAS) for data-driven adapter plugging and structure design.
result NAS-driven MDL model achieves comparable performance to existing approaches.

We consider options that pay the complexity deficiency of a sequence of up and down ticks of a stock upon exercise. We study the price of European and American versions of this option numerically for automatic complexity, and theoretically for Kolmogorov complexity. We also consider run complexity, which is a restricte…

2015-05-14abs ↗pdf ↗

New deep learning method validated across multiple sleep staging databases.

problem Improving automatic sleep scoring accuracy across different datasets.
method Ensemble of local models using deep learning for automatic sleep staging.
result Good general performance compared to human experts and state-of-the-art methods.

A recurring problem when building probabilistic latent variable models is regularization and model selection, for instance, the choice of the dimensionality of the latent space. In the context of belief networks with latent variables, this problem has been adressed with Automatic Relevance Determination (ARD) employing…

2015-05-28abs ↗pdf ↗