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.

169,291 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Feb 199419922001200920182026
48 results for regular variations

Hidden regular variation defines a subfamily of distributions satisfying multivariate regular variation on E=[0,]d\{(0,0,...,0)}\mathbb{E} = [0, \infty]^d \backslash \{(0,0, ..., 0) \} and models another regular variation on the sub-cone E(2)=E\i=1dLi\mathbb{E}^{(2)} = \mathbb{E} \backslash \cup_{i=1}^d \mathbb{L}_i, where Li\mathbb{L}_i is the $i…

2010-01-27abs ↗pdf ↗

Improved sampling method using regularized Stein Variational Gradient Flow.

problem Improving the accuracy of sampling methods in machine learning.
method Proposed Regularized Stein Variational Gradient Flow to interpolate between SVGD and Wasserstein Gradient Flow.
result Established theoretical properties and provided preliminary numerical evidence of improved performance.

Study reveals the regularization effect of variational distributions in VAEs.

problem Understanding the regularization role of variational distributions in VAEs.
method Analyzed the role of variational family in VAEs and studied the regularization effect on local geometry.
result Uncovered the implicit regularizer in the ββ-VAE objective and proposed a deterministic autoencoding objective.

The paper tackles variational regularization for manifold-valued data in inverse problems.

problem Inverse problems for manifold-valued data with indirect measurements.
method TV and TGV regularization for manifold-valued data, well-posedness analysis, numerical algorithms.
result Experimental results demonstrate the potential of the proposed schemes.

The paper explores parabolic regularity in geometric variational analysis.

problem Developing calculus rules and computation formulas for second-order generalized differential constructions.
method Introducing and applying the concept of parabolic regularity to geometric aspects of second-order variational analysis.
result Established new calculus rules and computation formulas for second-order generalized differential constructions.

New concept of sparse regular variation for better understanding of extreme events.

problem Characterizing the dependence structure of extreme events in multivariate settings.
method Introducing sparse regular variation based on Euclidean projection onto the simplex.
result Sparse regular variation and regular variation are equivalent under mild assumptions.

I propose a variational approach to maximum pseudolikelihood inference of the Ising model. The variational algorithm is more computationally efficient, and does a better job predicting out-of-sample correlations than L2L_2 regularized maximum pseudolikelihood inference as well as mean field and isolated spin pair appro…

2014-09-24abs ↗pdf ↗

Hidden regular variation is a sub-model of multivariate regular variation and facilitates accurate estimation of joint tail probabilities. We generalize the model of hidden regular variation to what we call hidden domain of attraction. We exhibit examples that illustrate the need for a more general model and discuss de…

2011-10-04abs ↗pdf ↗

Study examines stability of image-reconstruction algorithms using variational regularization.

problem Stability and robustness of image-reconstruction algorithms in medical imaging.
method Review and novel stability results for p\ell_p-regularized linear inverse problems, focusing on p(1,)p\in(1,\infty).
result Guarantees Lipschitz continuity for small pp and Hölder continuity for larger pp in Lp(Ω)L_p(Ω) function spaces.

Estimates Gaussian location model with ridge regularization, comparing variational and spectral methods.

problem Estimating parameters in Gaussian location model with regularization.
method Ridge-regularized log-density-ratio estimation, variational and spectral approaches.
result Regularized variational estimator has lower risk with many observations, spectral estimator with fewer observations.

This work prevents variational autoencoders from collapsing by adding an auxiliary decoder.

problem Variational autoencoders can collapse into autodecoders, losing semantic information.
method Adding an auxiliary decoder to regularize the latent space.
result Auxiliary decoders increase semantic information in the latent space and reconstructions.

We find the maximum regularization parameter for total-variation denoising.

problem Finding the maximum regularization parameter for anisotropic total-variation denoising.
method Established a closed form expression for the one-dimensional case and an upper-bound for the two-dimensional case using the pseudo-inverse of the divergence.
result The maximum regularization parameter is crucial for optimal parameter tuning and can be computed efficiently.

The paper studies the smoothness of critical points of variational integrals on Hessian spaces.

problem The study focuses on the regularity of critical points of variational integrals defined on Hessian spaces.
method The approach involves solving a fourth order nonlinear equation and analyzing the Hessian of the critical points.
result Smooth critical points with bounded Hessian are shown to be smooth provided their Hessian has small BMO.

The paper introduces variational characterizations for local entropy and heat regularization in deep learning.

problem Understanding and optimizing loss regularizations in deep learning.
method Introducing variational characterizations and a two-step optimization scheme based on iterative shift and best Gaussian approximation in Kullback-Leibler divergence.
result The optimization schemes for local entropy and heat regularized loss differ only over the argument of the Kullback-Leibler divergence used for best Gaussian approximation.

Study on geometric variational problems for existence, regularity, and uniqueness of solutions.

problem Geometric variational problems, focusing on existence, regularity, and uniqueness of solutions.
method Formulated in Federer and Fleming's theory of currents, discussed the existence theory, and presented core ideas of the (interior) regularity theory for area-minimizing currents and optimal transport paths. Two original results on generic uniqueness of solutions were presented.
result Generic uniqueness of solutions for both Plateau's problem and optimal branched transport problem.

Proposes a variational approach to shallow neural networks, bypassing optimization.

problem Theoretical understanding and optimization of shallow neural networks.
method Replaces discrete training with a continuum variational surrogate, proving global well-posedness and regularity.
result Optimal parameter density can be obtained by solving a single linear system, achieving O(1/N)O(1/N) generalization error.

Bayesian priors and penalties are equivalent in variational inference.

problem Understanding the relationship between Bayesian priors and penalties in variational inference.
method Characterizing the regularizers that can arise in variational inference and providing a systematic way to compute the prior corresponding to a given penalty.
result Equivalence between Bayesian priors and penalties in variational inference.

Unified variational inference framework reveals GAN's limitations and proposes improvements.

problem Limitations of GAN training and lack of completeness in loss function.
method Reinterpretation of variational inference and revealing special cases of GAN, VAE, etc.
result Proposes a regularization term to improve GAN training stability.

This paper improves VAEs with regularization for better image reconstruction.

problem Improving image reconstruction quality in Variational Autoencoders.
method Least square loss function with regularization for better approximation of data.
result Least square loss function leads to better reconstructed images and faster training.

New insights into tail behavior of heavy-tailed random vectors and processes.

problem Understanding tail behavior of aggregates of heavy-tailed random vectors.
method Analyzing multivariate regularly varying random vectors and Lévy processes.
result More than one large jump can determine tail behavior of aggregates.

Paper proposes Walsh-Hadamard Variational Inference for efficient approximate inference in large models.

problem Over-regularization in variational inference for large models.
method Walsh-Hadamard factorization strategies to reduce parameterization, accelerate computations, and increase posterior expressiveness.
result Efficient approximate inference achieved in over-parameterized models.

Introduces REVE, a regularization scheme that compresses class conditioned entropy.

problem Improving generalization performance of deep learning models.
method Identifies a variable responsible for final prediction, compresses class conditioned entropy, introduces a variational upper bound, and integrates a tractable loss into training.
result Demonstrates the efficiency of REVE on various neural networks and datasets.

Study improves oracle inequality for tree graphs using total variation regularization.

problem Improving oracle inequality for tree graphs with total variation regularization.
method Generalized Fused Lasso result to tree graphs, using harmonic mean of distances.
result Proved a lower bound on compatibility constant for total variation penalty.

Proposes a method to emulate sparse priors using L1 regularization without complex transformations.

problem Sparse priors in under-determined estimation problems.
method Parameter transform to emulate sparse priors under L2 regularization.
result L1 regularization can be achieved with a remapping of parameters under normal priors.

Variational Laplace improves Bayesian neural network performance without sampling.

problem Improving Bayesian neural network performance and calibration.
method Develops a new variational Laplace method for BNNs, exploiting curvature of likelihood.
result Variational Laplace outperforms standard VI methods in test performance and calibration.

Extends Campanato theory to multi-valued functions for geometric variational problems.

problem Regularity of multi-valued functions in geometric variational problems.
method Adapting Campanato's ideas to multi-valued functions, proving regularity theorems.
result Established regularity for multi-valued harmonic functions and stationary integral varifolds.

New framework explains deep neural networks using variational spline theory.

problem Understanding functions learned by deep neural networks.
method Developed a variational framework and function space.
result Deep ReLU networks are solutions to regularized data fitting problems over the proposed function space.

Study compares L1 and VG sparsity priors in inverse problems.

problem Sparse regularization in inverse problems with incomplete or corrupted measurements.
method Compared L1 regularization with Variational Garrote (VG), a probabilistic method approximating L0 sparsity.
result VG often achieves lower minimum generalization error and improved stability in strongly underdetermined regimes.

Batch normalization with regularization turns deterministic autoencoders into generative models.

problem Creating generative models from deterministic autoencoders.
method Using batch normalization as a source of non-determinism and adding entropic regularization.
result Deterministic autoencoders can be transformed into generative models with similar performance to variational autoencoders.

New method prevents neural network breakdown by combining trimmed loss and variation regularization.

problem Outlier contamination in neural network training.
method Integrates transformed trimmed loss and higher-order variation regularization.
result Ensures robustness to outlier contamination with a high functional breakdown point.

The paper develops a multi-kernel method with sparsity constraint for regression.

problem Developing a robust regression method with sparsity constraints.
method Banach-space formulation, generalized total-variation regularization, multi-kernel expansion, adaptive kernel positions, 1\ell_1 penalty on coefficients.
result The method achieves sparsity in the kernel coefficients, reducing the number of active kernels to the number of data points.