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

66132198264 · Jun 202019922001200920172026
48 results for reversible instance normalization

Enhanced time series forecasting with improved trend and seasonal components.

problem Challenges in real-world time series forecasting, especially in multivariate applications.
method Individual decomposition of trend and seasonal components, using different approaches for each.
result Significant reduction in error values, around 10% MSE average reduction across benchmarks.

This paper presents a normalization mechanism called Instance-Level Meta Normalization (ILM~Norm) to address a learning-to-normalize problem. ILM~Norm learns to predict the normalization parameters via both the feature feed-forward and the gradient back-propagation paths. ILM~Norm provides a meta normalization mechanis…

2019-04-06abs ↗pdf ↗

Unified framework for efficient trans-dimensional Bayesian inference using VI and NFs.

problem Efficient trans-dimensional Bayesian inference with reduced computational cost.
method Variational inference with normalizing flows to train transport proposals.
result Our approach minimizes reverse KL divergence and reduces computational cost.

We investigate a hybrid quantum-classical solution method to the mean-variance portfolio optimization problems. Starting from real financial data statistics and following the principles of the Modern Portfolio Theory, we generate parametrized samples of portfolio optimization problems that can be related to quadratic b…

2018-10-19abs ↗pdf ↗

Improved KL divergence estimators for normalizing flows lead to faster convergence and better approximations.

problem Estimating KL divergences for normalizing flows efficiently and accurately.
method Path-gradient estimators for reverse and forward KL divergences.
result Path-gradient estimators lead to faster convergence and better approximation results.

Estimates Markov chain mixing time from a single trajectory.

problem Estimating mixing time of Markov chains from a single trajectory.
method Contraction with respect to total variation, inspired by Wolfer's contraction coefficient.
result Improved confidence intervals and instance-dependent rates for estimating Markov chains.

Classifies orientation-reversing homeomorphisms of even periods on surfaces.

problem Classifying orientation-reversing homeomorphisms of even periods on surfaces.
method Following the approach of [1] and correcting errors in [1] for the case of periods multiple of 4.
result Classification for orientation-reversing homeomorphisms of periods multiple of 4.

We introduce graph normalizing flows: a new, reversible graph neural network model for prediction and generation. On supervised tasks, graph normalizing flows perform similarly to message passing neural networks, but at a significantly reduced memory footprint, allowing them to scale to larger graphs. In the unsupervis…

2019-05-30abs ↗pdf ↗

Study shows TD(0) with linear approx. converges for reversible Markov chains.

problem TD(0) divergence with off-policy and function approximation.
method Analyzes standard TD(0) with reversible Markov chains, adapting stochastic approximation framework.
result Establishes convergence with probability one for projected Bellman error = 0.

mfBm models and forecasts volatility with different Hurst exponents and correlations.

problem Modeling and forecasting volatility with varying Hurst exponents and correlations.
method Multivariate fractional Brownian motion (mfBm) with component-wise Hurst exponents, novel estimation method, time-reversibility test.
result mfBm reduces forecasting errors compared to a one-dimensional model and outperforms HAR model.

Adaptive feature normalization improves model robustness to extraneous variables.

problem Degrading model performance due to extraneous variables in deep learning.
method Adaptive feature normalization using instance normalization instead of batch normalization.
result Adaptive normalization leads to significant performance gains across different datasets and architectures.

The paper proposes methods to extract and analyze individual variable information from complex dependencies.

problem Analyzing and understanding complex dependencies between multiple variables.
method Reversible normalization and iterative dependency reduction to extract individual information, and use it for direct mutual information and multi-feature Granger causality analysis.
result Decoupling of variables to analyze their individual information and direct mutual information transfers.

Data-driven anomaly detection methods typically build a model for the normal behavior of the target system, and score each data instance with respect to this model. A threshold is invariably needed to identify data instances with high (or low) scores as anomalies. This presents a practical limitation on the applicabili…

2019-05-29abs ↗pdf ↗

Method uses normalizing flows to efficiently sample from complex target densities.

problem Sampling from complex target densities with zero values in regions of transformation.
method Normalizing flows to address exploding reverse Kullback-Leibler divergence.
result Demonstrated efficient sampling from multi-mode complex density function.

Anomaly detection has numerous applications and has been studied vastly. We consider a complementary problem that has a much sparser literature: anomaly description. Interpretation of anomalies is crucial for practitioners for sense-making, troubleshooting, and planning actions. To this end, we present a new approach c…

2017-08-20abs ↗pdf ↗

In 3D space forms, a lens minimizes volume for a fixed surface area.

problem Finding the shape with minimal volume for a given surface area in 3D space forms.
method Proving a sharp reverse isoperimetric inequality for λλ-convex bodies.
result The λλ-convex lens minimizes volume for a fixed surface area in 3D space forms.

Flow-based deep generative models learn data distributions by transforming a simple base distribution into a complex distribution via a set of invertible transformations. Due to the invertibility, such models can score unseen data samples by computing their exact likelihood under the learned distribution. This makes fl…

2019-06-17abs ↗pdf ↗

Choosing a reference group in Oaxaca-Blinder decomposition can reverse conclusions.

problem The choice of reference group in Oaxaca-Blinder decomposition can lead to different conclusions.
method The study uses the Oaxaca-Blinder decomposition to investigate how the choice of reference group affects the results.
result The Oaxaca-Blinder decomposition can yield different conclusions based on the choice of reference group.

The process of un-reduction, a sort of reversal of reduction by the Lie group symmetries of a variational problem, is explored in the setting of field theories. This process is applied to the problem of curve matching in the plane, when the curves depend on more than one independent variable. This situation occurs in a…

2015-08-21abs ↗pdf ↗

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In their seminal paper on braid-cryptography, Ko, Lee et al. proposed the {\it cycling …

2007-04-19abs ↗pdf ↗

Recent semi-supervised anomaly detection methods that are trained using small labeled anomaly examples and large unlabeled data (mostly normal data) have shown largely improved performance over unsupervised methods. However, these methods often focus on fitting abnormalities illustrated by the given anomaly examples on…

2019-10-30abs ↗pdf ↗

A new method uses MCMC-assisted normalizing flows for efficient Bayesian sampling.

problem Sampling from complex posterior distributions in Bayesian statistics.
method Training a normalizing flow using direct KL divergence and MCMC assistance.
result The method improves sampling efficiency for complicated posterior distributions.

SNPLA uses normalizing flows for efficient inference in implicit models.

problem Efficient inference in implicit models with complex likelihood and posterior learning.
method Sequential Neural Posterior and Likelihood Approximation (SNPLA) algorithm using normalizing flows.
result SNPLA achieves competitive performance with faster posterior draws compared to MCMC methods.

Quantum tech speeds up financial risk assessment.

problem Improving credit valuation adjustments using quantum mechanics.
method Developed a quantum algorithm using Bayesian quantum amplitude estimation and engineered likelihood functions.
result Significant speedup in quantum computations for CVA over classical methods.