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

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for normal generators

The study finds abundant normal generators for mapping class groups.

problem Understanding normal generation in mapping class groups.
method Analyzing restrictions on invariant subsurfaces and Teichmüller spaces.
result Reducible mapping classes can normally generate mapping class groups based on their asymptotic translation lengths.

Study on generalized quasi-Einstein structures in contact geometry.

problem Characterizing and understanding generalized quasi-Einstein structures in contact geometry.
method Investigation of properties, existence, and characterizations of generalized quasi-Einstein normal metric contact pair manifolds.
result Normal metric contact pair manifolds with generalized quasi-constant curvature are generalized quasi-Einstein manifolds.

One of the challenges in the study of generative adversarial networks is the instability of its training. In this paper, we propose a novel weight normalization technique called spectral normalization to stabilize the training of the discriminator. Our new normalization technique is computationally light and easy to in…

2018-02-16abs ↗pdf ↗

We say A is a quasi-normal subgroup of the group G if the commensurator of A in G is all of G. We develop geometric versions of commensurators in finitely generated groups. In particular, g is an element of the commensurator of A in G iff the Hausdorff distance between A and gA is finite. We show that a quasi-normal su…

2009-12-29abs ↗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.

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 ↗

Topological normal generation proved for mapping class groups of certain surfaces.

problem Proving topological normal generation for mapping class groups of surfaces.
method Analyzing the end space of surfaces and using topological normal closure properties.
result Topological normal generation is equivalent to uniquely self-similar for surfaces with countable end space.

Normalization layers control deep neural network capacity, improving stability and generalization.

problem Excessive capacity in deep neural networks leads to overfitting and poor generalization.
method Developed a theoretical framework to explain normalization's role in capacity control.
result Normalization layers reduce the Lipschitz constant exponentially, smoothing the loss landscape and enhancing generalization.

We provide a simple criterion for an element of the mapping class group of a closed surface to have normal closure equal to the whole mapping class group. We apply this to show that every nontrivial periodic mapping class that is not a hyperelliptic involution is a normal generator for the mapping class group when the …

2018-05-09abs ↗pdf ↗

Fractal Flow enhances normalizing flows with interpretable latent space and hierarchical modeling.

problem High-dimensional density estimation and generative modeling challenges.
method Integrates topic modeling (LDA) and fractal strategy into normalizing flows.
result Achieves latent clustering, controllable generation, and superior estimation accuracy.

The study explores normal generators for mapping class groups and their properties.

problem Understanding normal generators for mapping class groups of surfaces.
method Examined the relation between normal generation and asymptotic translation lengths on Teichmüller space and curve graph.
result Discussed several open questions related to normal generators.

This paper revisits the Bayesian CMA-ES and provides updates for normal Wishart. It emphasizes the difference between a normal and normal inverse Wishart prior. After some computation, we prove that the only difference relies surprisingly in the expected covariance. We prove that the expected covariance should be lower…

2019-04-02abs ↗pdf ↗

Variational inference relies on flexible approximate posterior distributions. Normalizing flows provide a general recipe to construct flexible variational posteriors. We introduce Sylvester normalizing flows, which can be seen as a generalization of planar flows. Sylvester normalizing flows remove the well-known single…

2018-03-15abs ↗pdf ↗

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.

This paper analyzes how normalization layers improve neural network training.

problem Improving generalization performance and training speed of neural networks.
method Global convergence analysis of two-layer neural networks with ReLU activations and Weight Normalization.
result Introduction of normalization layers changes the optimization landscape, enabling faster convergence.

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 ↗

Calculation of the log-normalizer is a major computational obstacle in applications of log-linear models with large output spaces. The problem of fast normalizer computation has therefore attracted significant attention in the theoretical and applied machine learning literature. In this paper, we analyze a recently pro…

2015-06-12abs ↗pdf ↗

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 ↗

We introduce the notion of a ribbon-clasp surface-link, which is a generalization of a ribbon surface-link. We generalize the notion of a normal form on embedded surface-links to the case of immersed surface-links and prove that any (immersed) surface-link can be described in a normal form. It is known that an embedded…

2016-02-25abs ↗pdf ↗

The study restricts normal subgroups of Kähler groups, proving specific cases and general restrictions.

problem Characterizing normal subgroups of Kähler groups.
method Analyzing embeddings and conjugation actions of surface groups and one-ended hyperbolic groups.
result Restrictions on normal subgroups of Kähler groups, including virtual direct products and surface group properties.

Defines and analyzes generalized normal ruled surfaces of curves in 3D space.

problem Understanding the geometry of generalized normal ruled surfaces.
method Calculates Gaussian and mean curvatures to determine surface properties and examines curve conditions.
result Determines when surfaces are flat or minimal and identifies specific curve types.

A new method learns latent space normalizing flow for approximate inference in generator models.

problem Approximate inference in generator models with complex posterior distributions.
method Jointly learns latent space normalizing flow and generator model using MCMC-based maximum likelihood.
result The short-run Langevin flow approximates the posterior and aligns with the normalizing flow prior.

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …

2016-06-02abs ↗pdf ↗

A key component of most neural network architectures is the use of normalization layers, such as Batch Normalization. Despite its common use and large utility in optimizing deep architectures, it has been challenging both to generically improve upon Batch Normalization and to understand the circumstances that lend them…

2019-06-09abs ↗pdf ↗

Many statistical models are given in the form of non-normalized densities with an intractable normalization constant. Since maximum likelihood estimation is computationally intensive for these models, several estimation methods have been developed which do not require explicit computation of the normalization constant,…

2019-05-15abs ↗pdf ↗

Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following results: 1) a minimal triangulation of a closed irreducible or a bounded hyperbolic 3-…

2006-06-05abs ↗pdf ↗

The paper generalizes rectifying and normal curves in Lorentzian n-space.

problem Characterizing and classifying gg-rectifying and gg-normal curves in Lorentzian n-space.
method Introducing a gg-position vector field and defining gg-rectifying and gg-normal curves based on this field.
result Comprehensive characterization and classification of gg-rectifying and gg-normal curves.

Paper introduces Categorical Normalizing Flows for better handling of categorical data.

problem Limited application of normalizing flows on categorical data due to lack of intrinsic order.
method Categorical Normalizing Flows use continuous transformations to model latent relations in categorical data, optimizing both continuous representation and model likelihood.
result GraphCNF, a permutation-invariant generative model, outperforms state-of-the-art on molecule generation.

Study of spacelike submanifolds with umbilical lightlike normals in Lorentzian spacetimes.

problem Geometric and topological constraints on codimension-two spacelike submanifolds.
method Analysis of submanifolds with umbilical lightlike normal directions, using geometric and topological constraints.
result Any such submanifold is contained in a lightlike hypersurface, which is totally umbilical if the lightlike normal direction is umbilical.

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 ↗

An automorphism αα of a group GG is normal if it fixes every normal subgroup of GG setwise. We give an algebraic description of normal automorphisms of relatively hyperbolic groups. In particular, we prove that for any relatively hyperbolic group GG, Inn(G)Inn(G) has finite index in the subgroup Autn(G)Aut_n(G) of normal au…

2008-09-14abs ↗pdf ↗