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

Trend · papers per month

7.5%15.0%22.5%30.0% · Sep 199419922001200920172026
48 results for automatic continuity

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.

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.

Let M be a compact manifold, possibly with boundary. We show that the group of homeomorphisms of M has the automatic continuity property: any homomorphism from Homeo(M) to any separable group is necessarily continuous. This answers a question of C. Rosendal. If N is a submanifold of M, the group of homeomorphisms of M …

2015-01-12abs ↗pdf ↗

CL methods improve monolingual ASR models across new tasks without forgetting past data.

problem Catastrophic Forgetting in monolingual ASR models when adapting to new domains or accents.
method Implement and compare various Continual Learning methods for monolingual ASR.
result Best CL method reduces performance gap by over 40% with minimal past data.

In this paper we investigate whether electroencephalography (EEG) features can be used to improve the performance of continuous visual speech recognition systems. We implemented a connectionist temporal classification (CTC) based end-to-end automatic speech recognition (ASR) model for performing recognition. Our result…

2019-12-16abs ↗pdf ↗

Minimal topology on surface homeomorphisms proven.

problem Proving the compact-open topology is minimal for surface homeomorphisms.
method Combining Hausdorff group topology properties and automatic continuity results.
result Compact-open topology is unique Hausdorff separable group topology on surface homeomorphisms.

This paper develops variational continual learning (VCL), a simple but general framework for continual learning that fuses online variational inference (VI) and recent advances in Monte Carlo VI for neural networks. The framework can successfully train both deep discriminative models and deep generative models in compl…

2017-10-29abs ↗pdf ↗

This paper describes a reference architecture for self-maintaining systems that can learn continually, as data arrives. In environments where data evolves, we need architectures that manage Machine Learning (ML) models in production, adapt to shifting data distributions, cope with outliers, retrain when necessary, and …

2019-03-12abs ↗pdf ↗

Improves risk and variability measures continuity and consistency.

problem Improving the continuity and consistency of risk and variability measures.
method Analyzes convex and order bounded above functionals on Frechet lattices and Orlicz spaces.
result Order-continuous, law-invariant functionals on Orlicz spaces are strongly consistent everywhere.

We present a framework for learning disentangled and interpretable jointly continuous and discrete representations in an unsupervised manner. By augmenting the continuous latent distribution of variational autoencoders with a relaxed discrete distribution and controlling the amount of information encoded in each latent…

2018-03-31abs ↗pdf ↗

Study shows compact mapping class groups of infinite type surfaces are never perfect.

problem Characterizing the perfection of mapping class groups of infinite type surfaces.
method Analyzing the closure of compactly supported mapping class groups and Torelli groups, examining their abelianizations.
result The abelianization of the closure of compactly supported mapping class groups contains uncountable direct sums of rationals.

In this paper we explore continuous silent speech recognition using electroencephalography (EEG) signals. We implemented a connectionist temporal classification (CTC) automatic speech recognition (ASR) model to translate EEG signals recorded in parallel while subjects were reading English sentences in their mind withou…

2020-02-06abs ↗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 ↗

This paper proposes a method to safely adjust exploration in RL to satisfy constraints.

problem Unsafe exploration in reinforcement learning violates constraints on controlled object states.
method Automatic adjustment of exploration inputs and variance-covariance matrix for safety.
result The method guarantees satisfaction of joint chance constraints with specified probability.

In this paper we investigate continuous speech recognition using electroencephalography (EEG) features using recently introduced end-to-end transformer based automatic speech recognition (ASR) model. Our results demonstrate that transformer based model demonstrate faster training compared to recurrent neural network (R…

2019-12-31abs ↗pdf ↗

A method for setting up an automatic curriculum for reinforcement learning tasks.

problem Improving sample efficiency in multi-task reinforcement learning.
method Propose a goal proposal module that prioritizes goals maximizing epistemic uncertainty of the Q-function.
result Significant performance gains over current methods in 13 multi-goal robotic tasks and 5 navigation tasks.

Automatically differentiable estimation for BLP model reduces bias in demand estimation.

problem Estimating the BLP model with reduced bias and improved performance.
method Phrasing BLP as an automatically differentiable moment function, using CUE for estimation, and incorporating MCMC credible intervals.
result CUE estimation shows lower bias but higher MAE compared to 2S-GMM, with MCMC providing closest empirical coverage.

Automatic neural architecture design has shown its potential in discovering powerful neural network architectures. Existing methods, no matter based on reinforcement learning or evolutionary algorithms (EA), conduct architecture search in a discrete space, which is highly inefficient. In this paper, we propose a simple…

2018-08-22abs ↗pdf ↗

In this paper we introduce various techniques to improve the performance of electroencephalography (EEG) features based continuous speech recognition (CSR) systems. A connectionist temporal classification (CTC) based automatic speech recognition (ASR) system was implemented for performing recognition. We introduce tech…

2019-11-24abs ↗pdf ↗

In this paper we demonstrate end-to-end continuous speech recognition (CSR) using electroencephalography (EEG) signals with no speech signal as input. An attention model based automatic speech recognition (ASR) and connectionist temporal classification (CTC) based ASR systems were implemented for performing recognition…

2019-06-17abs ↗pdf ↗

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.

Stochastic variational inference offers an attractive option as a default method for differentiable probabilistic programming. However, the performance of the variational approach depends on the choice of an appropriate variational family. Here, we introduce automatic structured variational inference (ASVI), a fully au…

2020-02-03abs ↗pdf ↗

New framework discovers non-affine continuous symmetries in neural networks.

problem Lack of efficient methods for detecting non-affine continuous symmetries in neural networks.
method Computational framework for discovering infinitesimal generators of multi-parameter group actions.
result Framework can discover non-affine continuous symmetries in neural networks.

This paper introduces a general Bayesian non- parametric latent feature model suitable to per- form automatic exploratory analysis of heterogeneous datasets, where the attributes describing each object can be either discrete, continuous or mixed variables. The proposed model presents several important properties. First…

2017-07-26abs ↗pdf ↗

The paper defines cross-section continuity for angular momentum definitions and finds the CWY definition valid.

problem Defining angular momentum at null infinity and ensuring its continuity across different cross-sections.
method Introducing cross-section continuity as a criterion and proving it for specific angular momentum definitions.
result The Chen-Wang-Yau definition of angular momentum satisfies cross-section continuity, while the Compere-Nichols modification does not.

The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not p…

2020-01-22abs ↗pdf ↗

A new method learns quantization boundaries in continuous space using tessellation.

problem Mapping between discrete and continuous distributions is difficult.
method Constructs normalizing flows on convex polytopes with exact likelihood evaluations.
result Improves likelihood evaluation and quantization learning across various data modalities.

Bayesian decision theory outlines a rigorous framework for making optimal decisions based on maximizing expected utility over a model posterior. However, practitioners often do not have access to the full posterior and resort to approximate inference strategies. In such cases, taking the eventual decision-making task i…

2019-02-02abs ↗pdf ↗

This work compresses sequences by treating them as continuous-time processes, enabling efficient discretization.

problem Efficient compression of sequences, especially with deep learning models that scale with sequence length.
method Treat sequences as continuous-time processes, learn efficient discretization, and decode at different time intervals.
result Automatic bit rate reductions in video and motion capture sequences using learned discretization.

In this paper, a neural architecture search (NAS) framework is proposed for 3D medical image segmentation, to automatically optimize a neural architecture from a large design space. Our NAS framework searches the structure of each layer including neural connectivities and operation types in both of the encoder and deco…

2019-06-13abs ↗pdf ↗

Implicit Q-learning and SARSA adjust step-sizes automatically, improving stability and performance.

problem Numerical instability and slow progress in Q-learning and SARSA due to step-size calibration.
method Reformulate iterative updates as fixed-point equations, scaling step-sizes inversely with feature norms.
result Implicit methods maintain stability over broader step-size ranges and achieve comparable convergence rates.

Storchastic improves stochastic AD for complex models in RL and VI.

problem Handling intractable expectations in RL and VI.
method Introduces Storchastic, a framework for AD of stochastic computation graphs with various gradient estimation methods.
result Provable unbiasedness and variance reduction for higher-order gradients.

In this paper, we propose a new feature extraction technique for program execution logs. First, we automatically extract complex patterns from a program's behavior graph. Then, we embed these patterns into a continuous space by training an autoencoder. We evaluate the proposed features on a real-world malicious softwar…

2018-04-10abs ↗pdf ↗

Efficient algorithms for contextual bandits with smooth regret in continuous action spaces.

problem Efficient learning in large or continuous action spaces.
method Smooth regret notion and efficient algorithms for general function approximation.
result Statistically and computationally efficient algorithms for contextual bandits with smooth regret.

Exact Bayesian inference for discrete models using probability generating functions.

problem Discrete statistical models with infinite support and continuous priors.
method Probabilistic programming language with automatic differentiation and probability generating functions.
result Genfer tool provides exact solutions for a wide range of inference problems.