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,657 papers · 148 categories

Trend · papers per month

2655317961,061 · Jun 202019922001200920172026
48 results for automatic generation

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.

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.

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 ↗

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.

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 ↗

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 ↗

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 ↗

Python package automates causal parameter estimation using Riesz regression.

problem Efficient estimation of causal and structural parameters.
method Automatic DML and generalized Riesz regression framework.
result Automatic construction of balancing link functions for generalized Riesz regression.

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.

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.

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.

SAFE automates feature engineering for industrial tasks efficiently and scalably.

problem Efficiency and scalability of automatic feature engineering methods for industrial tasks.
method SAFE (Scalable Automatic Feature Engineering) method, which provides excellent efficiency and scalability.
result SAFE method provides prominent efficiency and competitive effectiveness in industrial tasks.

This paper works out fair values of stock loan model with automatic termination clause, cap and margin. This stock loan is treated as a generalized perpetual American option with possibly negative interest rate and some constraints. Since it helps a bank to control the risk, the banks charge less service fees compared …

2010-05-09abs ↗pdf ↗

A method makes particle filters differentiable without altering their forward pass.

problem Compatibility issues between particle filters and automatic differentiation.
method Introduces a correction to particle weights using the stop-gradient operator.
result Automatic differentiation produces good estimators for gradients and second-order derivatives.

RAD estimates gradients with less memory, faster than small batch sizes.

problem Training deep models with stochastic gradient descent requires exact gradients, but they are not needed.
method Developed a framework for randomized automatic differentiation (RAD) to compute unbiased gradient estimates with reduced memory.
result RAD converges in fewer iterations than using a small batch size for feedforward networks and similar number for recurrent networks.

CoLA automates efficient numerical linear algebra for complex matrix structures.

problem Efficiently solving large-scale linear algebra problems with complex matrix structures.
method Combining linear operator abstraction with compositional dispatch rules.
result Automatic and efficient numerical algorithms for various linear algebra operations.

A new method for automatic gradient tree boosting using information theory.

problem Automatic selection of tree complexity and number in gradient boosting.
method Optimism of greedy leaf splitting procedure modeled as a Cox-Ingersoll-Ross process, leading to an information criterion for model selection.
result The method achieves significant speedups (10-1400) compared to xgboost without sacrificing predictive power.

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.

This paper introduces a spline-based method for nonparametric ADVI that handles complex posterior distributions.

problem Learning complex posterior distributions with skewness, multimodality, and bounded support.
method Develops a spline-based nonparametric approximation approach for ADVI.
result Establishes the asymptotic consistency of the derived lower bound for importance weighted autoencoder.

MARS automatically selects tensor decomposition ranks, improving performance in neural network tasks.

problem Determining optimal decomposition ranks in tensor decompositions.
method MARS uses binary masks to learn optimal tensor structure during training via relaxed MAP estimation.
result MARS achieves better results than previous methods in various tasks.

Multiple generalized additive models (GAMs) are a type of distributional regression wherein parameters of probability distributions depend on predictors through smooth functions, with selection of the degree of smoothness via L2L_2 regularization. Multiple GAMs allow finer statistical inference by incorporating explana…

2018-09-25abs ↗pdf ↗

Automatically identifies RRLyrae stars from VVV survey data.

problem Classifying RRLyrae stars from a large dataset of light curves.
method Developed an automatic ML-based procedure to identify RRLs, using features like period and intensity, and pseudo-colors.
result Constructed an ensemble classifier with Recall of 0.48 and Precision of 0.86 over 15 tiles.