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

246492738984 · Jun 202019922001200920172026
48 results for bases

This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.

problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.

We derive Gaussian approximations for random forest predictions using region-based stabilization.

problem Improving the accuracy of random forest predictions for Poisson process data.
method Region-based stabilization and Malliavin-Stein method for multivariate Gaussian approximation.
result Established Gaussian approximation bounds for random forest predictions under Poisson process.

Overparameterized models generalize well in offline contextual bandits, but policy-based algorithms struggle.

problem The performance gap between value-based and policy-based algorithms in offline contextual bandits with overparameterized models.
method Analysis of action-stability in objectives and formal proofs of regret bounds.
result The performance gap is due to action-stability of objectives, with value-based objectives being stable and policy-based objectives unstable.

Introduces LoCA regret to evaluate model-based RL methods.

problem Lack of consistent metrics to evaluate model-based RL methods.
method Inspired by neuroscience, introduces LoCA regret to measure model-based behavior.
result LoCA regret can identify model-based behavior and assess how close methods are to optimal model-based behavior.

Starting from the requirement that risk measures of financial portfolios should be based on their losses, not their gains, we define the notion of loss-based risk measure and study the properties of this class of risk measures. We characterize loss-based risk measures by a representation theorem and give examples of su…

2011-10-07abs ↗pdf ↗

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 ↗

Improved hypothesis testing and change-point detection using diffusion-based methods.

problem Limited power of score-based hypothesis tests and change-point detection.
method Extending score-based Fisher divergence to diffusion-divergence by multiplying score functions with a matrix-valued function or weight matrix.
result Theoretical quantification and demonstration of optimal performance of diffusion-based algorithms.

The success of kernel-based learning methods depend on the choice of kernel. Recently, kernel learning methods have been proposed that use data to select the most appropriate kernel, usually by combining a set of base kernels. We introduce a new algorithm for kernel learning that combines a {\em continuous set of base …

2011-12-20abs ↗pdf ↗

Simple model-based reinforcement learning outperforms model-free methods in complex tasks.

problem Lagging performance of model-based reinforcement learning agents in non-trivial environments.
method Combining soft value estimates with stochastic value gradients.
result Simple model-based agents achieve state-of-the-art results in a high-dimensional humanoid control task.

Improves graph-based active learning for non-Gaussian models.

problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.

A neural network model minimizes region-based free energy for faster inference in MRFs.

problem Efficient inference in complex Markov random fields (MRFs).
method Region-based Energy Neural Network (RENN) that directly minimizes region-based free energy.
result RENN outperforms other methods in marginal distribution estimation, partition function estimation, and MRF learning.

In this paper, we develop and explore deep anomaly detection techniques based on the capsule network (CapsNet) for image data. Being able to encoding intrinsic spatial relationship between parts and a whole, CapsNet has been applied as both a classifier and deep autoencoder. This inspires us to design a prediction-prob…

2019-07-15abs ↗pdf ↗

Proposes new methods for interpreting document classification models.

problem Interpretation fragility of attention-based neural networks.
method Corpus-level and concept-based explanation methods using attention weights.
result Extracts semantically meaningful keywords and concepts for model predictions.

Study batch reinforcement learning methods for personalized medical treatments.

problem Batch reinforcement learning for personalized medical treatments.
method Direct policy learning and model-based learning approaches.
result Model-based learning is impossible with finite model classes but feasible with relaxed conditions.

New method combines gradient optimization with constraint-based techniques for causal discovery.

problem Causal discovery from observational data, especially with small sample sizes.
method Differentiable dd-separation scores using percolation theory and soft logic for gradient-based optimization of conditional independence constraints.
result Empirical evaluations show robust performance in low-sample regimes, surpassing traditional methods.

Gradient-based MCMC for discrete spaces improves sampling performance.

problem Sampling in discrete spaces using traditional methods is challenging.
method Introduced new discrete Metropolis-Hastings samplers inspired by MALA, with a novel preconditioning technique.
result Demonstrated strong empirical performance across various challenging sampling problems.

Domain adaptation is essential to enable wide usage of deep learning based networks trained using large labeled datasets. Adversarial learning based techniques have shown their utility towards solving this problem using a discriminator that ensures source and target distributions are close. However, here we suggest tha…

2019-07-24abs ↗pdf ↗

Sphere-bases for simplicial and cubical complexes are constructed and analyzed.

problem Constructing and analyzing geometric properties of sphere-bases for simplicial and cubical complexes.
method Algorithmically-specified family of k+1-simplices or k+1-cubes are used to form the boundaries of sphere-bases.
result Geometric properties of constructed sphere-bases are investigated.

EB-RANSAC uses energy-based model for robust estimation without complex sampling.

problem Robust estimation of parameters in noisy data.
method EB-RANSAC combines RANSAC's sampling scheme with an energy-based model, simplifying the process and reducing hyperparameter requirements.
result EB-RANSAC effectively solves linear regression and maximum likelihood estimation problems.

Knowledge bases contribute to many web search and mining tasks, yet they are often incomplete. To add missing facts to a given knowledge base, various embedding models have been proposed in the recent literature. Perhaps surprisingly, relatively simple models with limited expressiveness often performed remarkably well …

2018-10-17abs ↗pdf ↗

We review the utility-based valuation method for pricing derivative securities in incomplete markets. In particular, we review the practical approach to the utility-based pricing by the means of computing the first order expansion of marginal utility-based prices with respect to a small number of random endowments.

2010-03-30abs ↗pdf ↗

GATES improves neural architecture search by modeling operations as information transformation.

problem Improving predictor-based neural architecture search efficiency.
method GATES models operations as information transformation, covering both node and edge cell search spaces.
result GATES boosts sample efficiency and improves predictor performance.

We investigate the validity of the equivalence principle along paths in gravitational theories based on derivations of the tensor algebra over a differentiable manifold. We prove the existence of local bases, called normal, in which the components of the derivations vanish along arbitrary paths. All such bases are expl…

1997-09-20abs ↗pdf ↗

Unsupervised relation discovery aims to discover new relations from a given text corpus without annotated data. However, it does not consider existing human annotated knowledge bases even when they are relevant to the relations to be discovered. In this paper, we study the problem of how to use out-of-relation knowledg…

2019-04-19abs ↗pdf ↗

Model-based machine learning improves communication systems.

problem Improving symbol detection in communication receivers.
method Review and comparison of model-based and deep learning approaches, focusing on deep unfolding and DNN-aided hybrid algorithms.
result Different strategies of conventional deep architectures and hybrid algorithms show advantages and drawbacks.

Unified kernel-based methods improve nonlinear causal discovery.

problem Identifying nonlinear causal relationships between time series variables.
method Unified Kernel Principal Component Regression (KPCR) and Gaussian Process score-based model with Smooth Information Criterion.
result Improved performance in time series nonlinear causal discovery.

Magnitude-based pruning is one of the simplest methods for pruning neural networks. Despite its simplicity, magnitude-based pruning and its variants demonstrated remarkable performances for pruning modern architectures. Based on the observation that magnitude-based pruning indeed minimizes the Frobenius distortion of a…

2020-02-12abs ↗pdf ↗

We study the (2+2)(2+2)-Einstein warped product manifolds, where the scalar curvature of the Base is a multiple of the warping function, and we called this condition (inside a warped product manifold) ff-curvature-Base (RfBR_{f_B}).The aim of this paper is to check if there are Base-manifolds with non-flat metrics that sa…

2019-05-04abs ↗pdf ↗

Efficient momentum-based methods for reinforcement learning with improved sample complexity.

problem Efficient reinforcement learning algorithms for non-concave performance functions.
method Adaptive momentum-based policy gradient methods using variance reduction and importance sampling techniques.
result Both IS-MBPG and HA-MBPG reach the best known sample complexity of O(ε3)O(ε^{-3}) for finding an εε-stationary point.