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

25.0%50.0%75.0%100.0% · May 199319922001200920172026
48 results for normality conditions

PL-MCMC samples from normalizing flows' conditional distributions.

problem Sampling from complex conditional distributions learned by normalizing flows.
method Metropolis-Hastings implementation of PL-MCMC.
result PL-MCMC asymptotically samples from exact conditional distributions.

Improved lattice field theory simulations with local-Autoregressive Conditional Normalizing Flow.

problem Efficiently sampling lattice field theories with computational challenges.
method Integrates locality into autoregressive conditional normalizing flows.
result Autocorrelation times improved by orders of magnitude for φ4φ^{4} theory on a 2D lattice.

A new method models individual survival curves using conditional normalizing flows.

problem Precise per-individual predictions in survival analysis.
method Conditional normalizing flows for flexible and individualized survival distributions.
result Efficient estimation of individual survival curves without overfitting.

We propose a theoretical framework for thinking about score normalization, which confirms that normalization is not needed under (admittedly fragile) ideal conditions. If, however, these conditions are not met, e.g. under data-set shift between training and runtime, our theory reveals dependencies between scores that c…

2017-09-28abs ↗pdf ↗

New model predicts radiative properties of nanoparticle layers with high accuracy and uncertainty.

problem Predicting radiative properties of nanoparticle embedded layers accurately and with uncertainty.
method Conditional normalizing flows learn conditional distributions of optical outputs given input parameters.
result The model achieves high predictive accuracy and reliable uncertainty estimates.

Efficiently computes optimal transport maps and Wasserstein barycenters using conditional normalizing flows.

problem Computing optimal transport maps and Wasserstein barycenters in high-dimensional spaces.
method Uses conditional normalizing flows to approximate distributions and solve the primal problem.
result Shows computational feasibility for hundreds of input distributions and yields accurate results.

A method for estimating signal distributions from inverse problems using normalizing flows.

problem Estimating the distribution of the underlying signal from observations in inverse problems.
method A framework for approximate inference on a pre-trained unconditional flow model, using a composition of two flow models for stable variational inference.
result Our method produces high-quality samples with uncertainty quantification and can be amortized for zero-shot inference.

This study improves state estimation for nonlinear systems using conditional normalizing flows.

problem Performance degradation of traditional filtering algorithms in nonlinear systems with non-Gaussian uncertainty.
method Uses conditional normalizing flows with MLP, transformer, or state-space models for state and parameter estimation.
result Optimal-transport-inspired kinetic loss mitigates overparameterization in flows.

CNFs model conditional densities efficiently and avoid mode collapse.

problem Capturing strong correlations between output dimensions in structured prediction tasks.
method Conditional normalizing flows (CNFs) with a likelihood-based objective.
result CNFs achieve competitive performance in super-resolution and vessel segmentation tasks.

We address representational challenges in normalizing flows, particularly depth and conditioning issues.

problem Challenges in training normalizing flows, including vanishing/exploding gradients and poor conditioning.
method Analyzes representational aspects of depth and conditioning in normalizing flows, proving theoretical bounds and investigating phenomena.
result Proves that shallow affine coupling networks are universal approximators in Wasserstein distance if ill-conditioning is allowed.

New framework explains normalizing flows' power and limitations.

problem Understanding the expressive power and limitations of normalizing flows.
method Theoretical framework for well-conditioned coupling-based normalizing flows and volume-preserving flows.
result RealNVP is distributionally universal, but volume-preserving flows are not.

The theory of frames normal for general connections on differentiable bundles is developed. Links with the existing theory of frames normal for covariant derivative operators (linear connections) in vector bundles are revealed. The existence of bundle coordinates normal at a given point and/or along injective horizonta…

2004-05-01abs ↗pdf ↗

Unified framework for shrinkage, thresholding, and regularization in normal mean estimation and linear regression.

problem Estimation of normal mean in multivariate settings with correlated observations.
method Approximate risk minimization over a functional class of shrinkage-thresholding rules.
result Unified estimator NOMAD for shrinkage, thresholding, and regularization.

Batch Normalization (BN) is a common technique used to speed-up and stabilize training. On the other hand, the learnable parameters of BN are commonly used in conditional Generative Adversarial Networks (cGANs) for representing class-specific information using conditional Batch Normalization (cBN). In this paper we pro…

2018-06-01abs ↗pdf ↗

We consider higher dimensional generalisations of normal almost contact structures, the so called f.pk-structures where parallelism spans a Lie algebra g (f.pk-g-structures). Two types of these structures are discussed. In the first case, we construct an almost complex structure on a product manifold mirroring K-struct…

2016-09-27abs ↗pdf ↗

Yau's Affine Normal Descent optimizes smooth unconstrained problems with geometrically adapted directions.

problem Optimizing smooth unconstrained problems with geometrically adapted directions.
method Yau's Affine Normal Descent (YAND) uses the equi-affine normal of level-set hypersurfaces as search directions.
result YAND converges globally under standard smoothness assumptions and locally quadratically near nondegenerate minimizers.

In this article, we first describe a normal form of real-analytic, Levi-nondegenerate submanifolds of CNC^N of codimension d \ge 1 under the action of formal biholomorphisms, that is, of perturbations of Levi-nondegenerate hyperquadrics. We give a sufficient condition on the formal normal form that ensures that the n…

2017-05-11abs ↗pdf ↗

Differentiable sorting and rank normalization are incompatible, with specific conditions for admissibility.

problem Incompatibility between differentiable sorting and rank normalization.
method Formalized admissibility through monotone invariance, batch independence, and rank-space stability conditions.
result Different gap-sensitive and batchwise relaxations of rank normalization violate the conditions for admissibility.

Unified framework for understanding and optimizing training acceleration.

problem Challenges in optimizing training with regularization and acceleration techniques.
method Explains how AdaGrad, RMSProp, and Adam accelerate training, and derives a generalization for L1L_1-regularization.
result Derives a unified mathematical framework for understanding and optimizing training acceleration.

A spacelike surface S immersed in a 4-dimensional Lorentzian manifold will be said to be umbilical along a direction N normal to S if the second fundamental form along N is proportional to the first fundamental form of S. In particular, S is pseudo-umbilical if it is umbilical along the mean curvature vector field H, a…

2011-11-29abs ↗pdf ↗

InfoCNF improves conditional image generation by optimizing latent code partitioning and solver error tolerances.

problem Efficiently conditioning CNFs on high-dimensional latent codes for conditional image generation.
method InfoCNF partitions latent space into class-specific and shared codes, and uses gating networks to optimize ODE solver error tolerances.
result InfoCNF improves test accuracy on CIFAR10 while reducing NFEs and maintaining comparable likelihood scores.

In this paper, we study normal complex contact metric manifolds and we get some general results on them. Moreover, we obtained the general expression of the curvature tensor field for arbitrary vector fields. Furthermore, we show that the necessary and succient conditions to be normal a complex contact metric manifold.…

2015-10-13abs ↗pdf ↗

New normalization condition for sub-Riemannian connections.

problem Normalizing connections on sub-Riemannian manifolds.
method Formulated in terms of Cartan connections, depends on curvature's first degree of homogeneity.
result A compatible partial affine connection can be uniquely extended to a full affine connection and a grading of the tangent bundle.

This paper proposes a semi-conditional normalizing flow model for semi-supervised learning. The model uses both labelled and unlabeled data to learn an explicit model of joint distribution over objects and labels. Semi-conditional architecture of the model allows us to efficiently compute a value and gradients of the m…

2019-05-01abs ↗pdf ↗

Extends corner structure study to general case, constructs normal Trans-Sasakian structures.

problem Extending corner structure study to general case without conditions.
method Extends corner structure to general case, constructs Trans-Sasakian structures from non-normal corner structures.
result Constructs normal Trans-Sasakian structures from non-normal corner structures.

Study of unitary and groupoid orbits of normal operators, focusing on manifold structures and spectral conditions.

problem Understanding the manifold structures of orbits of normal operators under different norm topologies.
method Unified treatment of unitary and groupoid orbits, using moment maps and conditional expectations.
result Differentiable structures for orbits and necessary spectral conditions for norm closure and submanifold properties.

New algorithm tackles nonconvex machine learning problems with adaptive normalization and independent sampling.

problem Nonconvex machine learning problems with generalized-smoothness.
method Adaptive gradient normalization, independent sampling, and gradient clipping.
result Achieves an O(ε^(-4)) sample complexity for fast convergence.

The study defines and analyzes semi-invariant submanifolds in complex contact metric manifolds.

problem Characterizing semi-invariant submanifolds in complex contact metric manifolds.
method Definition and derivation of relations, integrability conditions of distributions.
result Obtained useful relations and integrability conditions for semi-invariant submanifolds.

The paper improves the empirical bootstrap method for non-normal estimators.

problem Theoretical properties of empirical bootstrap for non-asymptotically normal estimators.
method Establishing limiting distribution, deriving consistency conditions, proposing alternative methods.
result The empirical bootstrap method can be asymptotically consistent under stability conditions.

The paper studies special surfaces in 4D space forms with specific geometric properties.

problem Investigating biconservative surfaces with flat normal bundles in 4D space forms.
method Analyzing compatibility conditions, prescribing flat connection, and determining specific surface properties.
result Existence and characterization of biconservative Weingarten surfaces with flat normal bundles.