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

59117176234 · Jun 202019922001200920172026
48 results for activation density

There is a large body of work on convergence rates either in passive or active learning. Here we outline some of the results that have been obtained, more specifically in a nonparametric setting under assumptions about the smoothness and the margin noise. We also discuss the relative merits of these underlying assumpti…

2019-02-08abs ↗pdf ↗

We extend neural networks with fractional and mixed activation functions for better function approximation.

problem Limitations in approximating higher-order smooth functions in complex spaces.
method Incorporating fractional exponents in activation functions and defining new density functions.
result Improved accuracy and broader applicability of neural network approximation theory.

Neural network accuracy improves with denser training samples.

problem Improving neural network accuracy on unseen test samples.
method Bounding empirical training error smoothed across activation regions and using it to discard high-risk test samples.
result Discarding high-risk test samples based on error bounds improves prediction accuracy by up to 20%.

CMDRNN predicts user location using WiFi fingerprints with deep learning.

problem Predicting user activity with WiFi fingerprints is challenging due to high dimensionality.
method Combines CNN, RNN, and MDN to model high-dimensional time-series data.
result CMDRNN effectively predicts user location using WiFi fingerprints.

We introduce the stochastic multiplicative point process modelling trading activity of financial markets. Such a model system exhibits power-law spectral density S(f) ~ 1/f**beta, scaled as power of frequency for various values of beta between 0.5 and 2. Furthermore, we analyze the relation between the power-law autoco…

2004-12-28abs ↗pdf ↗

Earlier we proposed the stochastic point process model, which reproduces a variety of self-affine time series exhibiting power spectral density S(f) scaling as power of the frequency f and derived a stochastic differential equation with the same long range memory properties. Here we present a stochastic differential eq…

2006-06-14abs ↗pdf ↗

ActiveCQ improves causal quantity estimation with active learning and Gaussian Processes.

problem Estimating causal quantities requires large datasets, which are costly.
method Unified framework using Gaussian Processes and conditional mean embeddings for distribution estimation. Derived principled acquisition strategies based on information gain and total variance reduction.
result Framework significantly outperforms baselines in sample efficiency across various causal quantities.

Understanding how spatial configurations of economic activity emerge is important when formulating spatial planning and economic policy. A simple model was proposed by Simon, who assumed that firms grow at a rate proportional to their size, and that new divisions of firms with certain probabilities relocate to other fi…

2012-04-30abs ↗pdf ↗

Adaptive quadrature improves Bayesian inference through active learning.

problem Efficiently estimating posterior densities in Bayesian inference.
method Sequential node selection using acquisition functions, combining interpolative surrogate models and quadrature rules.
result Positive estimation of marginal likelihood with improved accuracy.

Anomalies are intuitively easy for human experts to understand, but they are hard to define mathematically. Therefore, in order to have performance guarantees in unsupervised anomaly detection, priors need to be assumed on what the anomalies are. By contrast, active learning provides the necessary priors through approp…

2018-05-23abs ↗pdf ↗

WiGS improves active learning for regression by dynamically selecting informative samples.

problem Reducing labeling costs in regression tasks.
method Formulated as a reinforcement learning problem, WiGS adapts the exploration-investigation balance.
result WiGS outperforms static methods in accuracy and labeling efficiency, especially in irregular data density.

Gaussian Mixture Models (GMM) have found many applications in density estimation and data clustering. However, the model does not adapt well to curved and strongly nonlinear data. Recently there appeared an improvement called AcaGMM (Active curve axis Gaussian Mixture Model), which fits Gaussians along curves using an …

2015-02-06abs ↗pdf ↗

Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only Lipschitz conditions rather than strict architectural constraints are needed for enforci…

2019-06-06abs ↗pdf ↗

This study optimizes covariate density and propensity score for efficient ATE estimation.

problem Efficiently estimating average treatment effects (ATEs) with minimal variance.
method Adaptive experiment optimizing both covariate density and propensity score.
result Proposed method minimizes the semiparametric efficiency bound for ATE estimation.

Research shows deep generative models' likelihoods are unreliable for anomaly detection.

problem Anomaly detection using deep generative models' likelihoods is unreliable.
method Examined the behavior of distribution densities through reparametrization.
result The likelihoods used for anomaly detection rely on strong and implicit hypotheses.

Survey of Monte Carlo methods for noisy, costly densities in reinforcement learning and ABC.

problem Dealing with intractable, costly, and noisy densities in real-world scenarios.
method Classification and description of Monte Carlo methodologies using surrogate models.
result Unified scheme and numerical comparisons of different methodologies.

Recovering edge activities from node activity data in temporal networks.

problem Recovering lost edge activity data from aggregated node activity data in temporal networks.
method Analyzing the relationship between edge activity and node activity data, using both theoretical and empirical methods to show recovery is possible and under what conditions.
result Recovery of edge activities from node activities is possible with surprising accuracy, even when network density increases.

The classical Universal Approximation Theorem holds for neural networks of arbitrary width and bounded depth. Here we consider the natural `dual' scenario for networks of bounded width and arbitrary depth. Precisely, let nn be the number of inputs neurons, mm be the number of output neurons, and let ρρ be any nonaff…

2019-05-21abs ↗pdf ↗

Signals consisting of a sequence of pulses show that inherent origin of the 1/f noise is a Brownian fluctuation of the average interevent time between subsequent pulses of the pulse sequence. In this paper we generalize the model of interevent time to reproduce a variety of self-affine time series exhibiting power spec…

2003-03-05abs ↗pdf ↗

A new framework for flexible neural network receptive fields.

problem Adaptive and flexible receptive fields in neural networks.
method Density-embedding layers that replace affine transformations with scalar products of input and density functions.
result Density-embedding layers can adaptively tune receptive fields and are computationally efficient.

This paper provides a neural approach to represent option implied information.

problem Link between implied density and volatility for arbitrage-free modeling.
method Minimalist perspective on implied volatility, neural representation with arbitrage constraints.
result Shallow feedforward network with a single hidden layer effectively approximates implied density and volatility.

A new method selects a representative subsample for efficient kernel density estimation.

problem Selecting a representative subsample without model assumptions.
method Optimal transport techniques for model-free subsampling with an efficient algorithm.
result The selected subsample can be used for efficient density estimation with derived convergence rates and optimal bandwidth.

Active Learning (AL) is increasingly important in a broad range of applications. Two main AL principles to obtain accurate classification with few labeled data are refinement of the current decision boundary and exploration of poorly sampled regions. In this paper we derive a novel AL scheme that balances these two pri…

2012-10-16abs ↗pdf ↗

Proposes a method to estimate time-dependent probability density functions using binary classifiers.

problem Estimating time-dependent probability density functions of stochastic processes.
method Trains a time-dependent binary classifier to discriminate between realizations of a stochastic process at two nearby time instants.
result Explicitly models and accurately reconstructs complex time-dependent, multi-modal, and near-degenerate densities.

A general Boltzmann machine with continuous visible and discrete integer valued hidden states is introduced. Under mild assumptions about the connection matrices, the probability density function of the visible units can be solved for analytically, yielding a novel parametric density function involving a ratio of Riema…

2017-12-20abs ↗pdf ↗

FourNet approximates financial transition densities using Fourier transforms.

problem Approximating transition densities in finance with high accuracy.
method FourNet is a novel FFNN with Gaussian activation, learning from characteristic functions.
result FourNet can approximate transition densities arbitrarily well with finite neurons.

We present a nonlinear stochastic differential equation (SDE) which mimics the probability density function (PDF) of the return and the power spectrum of the absolute return in financial markets. Absolute return as a measure of market volatility is considered in the proposed model as a long-range memory stochastic vari…

2009-01-07abs ↗pdf ↗