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,096 papers · 148 categories

Trend · papers per month

69138207276 · Jun 202019922001200920182026
48 results for normal component

We prove that among all Kollár components obtained by plt blow ups of a klt singularity o(X,D)o \in (X, D), there is at most one that is (log-)K-semistable. We achieve this by showing that if such a Kollár component exists, it uniquely minimizes the normalized volume function introduced in [Li15a] among all divisorial valu…

2016-04-19abs ↗pdf ↗

Gradient Boosted Normalizing Flows improve flexibility of NFs without increasing complexity.

problem Improving flexibility of normalizing flows without increasing complexity.
method Gradient Boosting applied to normalizing flows to create a mixture model structure.
result GBNFs outperform non-boosted NFs and produce better results with simpler components.

FredNormer improves time series forecasting by adapting to frequency domain patterns.

problem Current normalization methods struggle with non-stationary time series due to their time-domain approach.
method FredNormer analyzes frequency components, adapts weights, and improves robustness.
result FredNormer boosts forecasting accuracy by 33.3% on ETTm2 dataset.

A new method improves posterior approximation for complex distributions.

problem Difficulty in capturing multimodal and heavy-tailed posteriors with standard normalizing flows.
method StiCTAF: stick-breaking mixture base with component-wise tail adaptation.
result Improved tail recovery and better mode coverage compared to benchmarks.

Clustering of data sets is a standard problem in many areas of science and engineering. The method of spectral clustering is based on embedding the data set using a kernel function, and using the top eigenvectors of the normalized Laplacian to recover the connected components. We study the performance of spectral clust…

2014-04-29abs ↗pdf ↗

This report aims at giving a general overview on the classification of the maximal subgroups of compact Lie groups (not necessarily connected). In the first part, it is shown that these fall naturally into three types: (1) those of trivial type, which are simply defined as inverse images of maximal subgroups of the cor…

2006-05-31abs ↗pdf ↗

The study improves bounds on pseudo-Anosov maps and certifies minimum and accumulation points of normalized dilatations.

problem Understanding the set of normalized dilatations of fully-punctured pseudo-Anosov maps.
method Improving bounds on the number of tetrahedra in veering triangulations and using computational means.
result Certified that the minimum element of the set of normalized dilatations is μ2μ^2 and the minimum accumulation point is μ4μ^4.

Generative model identifies temporal count data components with regime-dependent contributions.

problem Modeling temporal count data with regime-dependent dynamics.
method Generative framework combining regime-adaptive dynamics with Poisson log-normal emissions.
result Established identifiability of the model and revealed co-variation patterns and regime shifts.

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.

We present sharp tail asymptotics for the density and the distribution function of linear combinations of correlated log-normal random variables, that is, exponentials of components of a correlated Gaussian vector. The asymptotic behavior turns out to depend on the correlation between the components, and the explicit s…

2013-09-12abs ↗pdf ↗

We developed a new approach for the analysis of physiological time series. An iterative convolution filter is used to decompose the time series into various components. Statistics of these components are extracted as features to characterize the mechanisms underlying the time series. Motivated by the studies that show …

2015-04-23abs ↗pdf ↗

Looped transformers with LN converge to power method for principal component prediction.

problem Understanding how transformers learn algorithmic procedures.
method Study of principal component prediction with looped linear transformers and layer normalization.
result Gradient descent trains looped transformers with LN to implement the power method for principal component prediction.

Dimofte, Gaiotto and Gukov introduced a powerful invariant, the 3D-index, associated to a suitable ideal triangulation of a 3-manifold with torus boundary components. The 3D-index is a collection of formal power series in q1/2q^{1/2} with integer coefficients. Our goal is to explain how the 3D-index is a generating serie…

2016-04-10abs ↗pdf ↗

Clustering evaluation measures are frequently used to evaluate the performance of algorithms. However, most measures are not properly normalized and ignore some information in the inherent structure of clusterings. We model the relation between two clusterings as a bipartite graph and propose a general component-based …

2012-06-27abs ↗pdf ↗

Counted essential surfaces in a knot's exterior, finding a unique pattern.

problem Counting essential surfaces in a knot's exterior.
method Counted essential surfaces by genus, using Euler totient function. Showed normal surfaces are connected by counting their components. Used Agol, Hass, and Thurston's tools to convert component counting into orbit counting.
result Found a unique pattern in the number of essential surfaces by genus.

Causal Component Analysis aims to recover latent variables with causal relationships.

problem Recover latent variables with causal relationships from observed mixtures.
method Introduces a likelihood-based approach using normalizing flows to estimate unmixing function and causal mechanisms.
result Demonstrates effectiveness through synthetic experiments in CauCA and ICA settings.

Study classifies mappings of bivariate normal densities, revealing three types with distinct geometric and statistical properties.

problem Understanding the properties of two-component bivariate normal mixtures.
method Classification via A\mathcal{A}-equivalence and statistical analysis.
result Three distinct types of mappings with specific geometric and statistical properties, and upper bounds for the number of modes.

A 1-bridge torus knot in a 3-manifold of genus 1\le 1 is a knot drawn on a Heegaard torus with one bridge. We give two types of normal forms to parameterize the family of 1-bridge torus knots that are similar to the Schubert's normal form and the Conway's normal form for 2-bridge knots. For a given Schubert's normal f…

2001-12-11abs ↗pdf ↗

Study compares two pseudo-Kähler structures on a specific mathematical component.

problem Comparing two pseudo-Kähler structures on the SL(3,R)\mathrm{SL}(3,\mathbb{R})-Hitchin component.
method Examined Rungi-Tamburelli's ωfω_f and Goldman's ωGω_G forms, and aligned Killing forms.
result Rungi-Tamburelli's semi-pseudo-Kähler structure is non-degenerate and matches another structure after normalization.

Sparse non-Gaussian component analysis (SNGCA) is an unsupervised method of extracting a linear structure from a high dimensional data based on estimating a low-dimensional non-Gaussian data component. In this paper we discuss a new approach to direct estimation of the projector on the target space based on semidefinit…

2011-06-01abs ↗pdf ↗

A new method reduces complexity of normalizing flows for MCMC preconditioning.

problem Improving sampling efficiency in MCMC algorithms for complex target distributions.
method Factorized preconditioning architecture combining a linear component and a conditional NF.
result Significantly better tail samples and higher effective sample sizes on various distributions.

TaskNorm improves meta-learning performance by rethinking batch normalization.

problem Challenges in batch normalization for meta-learning with deep networks.
method Developed TaskNorm, a novel approach to batch normalization for meta-learning.
result TaskNorm consistently improves meta-learning performance across various datasets and meta-learning approaches.

Empirical study finds IT project costs follow a power-law distribution, exposing risk underestimation.

problem IT project cost overruns are underestimated due to normal distribution assumptions.
method Analyzed 5,392 IT projects to examine cost overruns following a power-law distribution.
result IT project cost overruns follow a power-law distribution with a fat tail of extreme overruns.

This paper solves a Calderón problem for Beltrami fields on manifolds.

problem Reconstructing a 3D manifold from boundary measurements of Beltrami fields.
method Defined a normal-to-tangential map for Beltrami fields and used it to reconstruct the manifold.
result A real-analytic 3-manifold can be reconstructed from its normal-to-tangential map.

AP-CDE uses NF to estimate high-dimensional conditional densities, improving interpretability.

problem Estimating conditional densities for high-dimensional responses like images.
method Extends NF neural networks to handle high-dimensional yy with a latent zz.
result Improves interpretation of latent components, especially zPz_P.

The study characterizes and analyzes spacelike surfaces with a canonical normal null direction in Minkowski 4-space.

problem Characterizing and analyzing spacelike surfaces with a specific null direction in Minkowski space.
method Using geometric properties, Gauss map, and a nonlinear partial differential equation, the study characterizes and analyzes these surfaces.
result Characterizations and properties of spacelike surfaces with a canonical normal null direction are obtained.

Uncertainty-aware PCA preserves data uncertainty during dimensionality reduction.

problem Uncertainty in data affects traditional PCA methods, leading to inaccurate results.
method Generalizes PCA for multivariate probability distributions, respecting uncertainty.
result Uncertainty-aware PCA maintains data characteristics after projection.

Four improvements to Batch Normalization improve deep learning performance.

problem Improving Batch Normalization for better deep learning performance.
method Proposed improvements include reasoning about current examples, Ghost Batch Normalization, weight decay regularization, and a new normalization algorithm for small batch sizes.
result Performance gains across all batch sizes with no additional computation during training.