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

Trend · papers per month

24487296 · May 202619922001200920172026
48 results for principal logarithm

Logarithmic connections on principal bundles over normal varieties are studied.

problem Existence and properties of logarithmic connections on principal bundles over normal varieties.
method Introducing logarithmic connections, showing equivalence to covariant derivatives, and proving existence conditions.
result Existence of logarithmic connections on principal bundles over normal varieties is equivalent to certain conditions on the associated vector bundles and adjoint bundles.

Study of logarithms in SVD-closed subgroups of unitary group.

problem Understanding logarithms in SVD-closed subgroups of unitary groups.
method Analysis of generalized principal logarithms and minimizing geodesics.
result Set of generalized principal logarithms is a disjoint union of diffeomorphic subsets.

Characterizes the local diffeomorphism structure of the exponential in the set of skew-symmetric matrices.

problem Characterizing the local diffeomorphism structure of the exponential in the set of skew-symmetric matrices.
method Introduce the diffeomorphic logarithm of special orthogonal matrices and an efficient algorithm.
result The region containing the principal logarithm has a special multiplicity structure.

Study logarithmic flat connections on principal bundles using Lie groupoids.

problem Classify flat connections on principal bundles with logarithmic singularities.
method Use tools from Lie groupoid theory to classify representations and establish van Kampen theorems.
result Obtain a functorial Riemann-Hilbert correspondence for logarithmic connections.

The paper establishes a Poisson Poincaré-Dulac theorem for Poisson-flat connections.

problem Analyzing Poisson-flat connections with logarithmic poles.
method Defining an Euler-Poisson principal part and residue theory, establishing a Poisson Poincaré-Dulac theorem.
result Any logarithmic Poisson-flat connection is holomorphically gauge equivalent to a pure Euler-Poisson normal form.

Logarithmic connections on complex manifolds with trivial tangent bundle.

problem Finding logarithmic connections on complex manifolds with specific properties.
method Analyzing holomorphic Cartan geometries and their connections.
result Logarithmic connections preserve holomorphic Cartan geometries.

In the framework of Abstract Differential Geometry, we show that to a given principal sheaf and a representation of its stuctural sheaf in AnA^n, where A is a sheaf of associative, commutative, unital algebras (over R or C), we associate a vector sheaf. Moreover, under some natural assumptions on the compatibility of t…

1998-10-13abs ↗pdf ↗

Local connection forms provide a very useful tool for handling connections on principal bundles, because they ignore any complexities of the total space and, essentially, involve only two fundamental features of the structure group, namely the adjoint representation and the left (logarithmic) differential. The main res…

2013-05-28abs ↗pdf ↗

Paper optimizes private PCA for covariance estimation in statistics.

problem Private estimation of covariance matrices and principal components.
method Developed differentially private estimators for spiked covariance model.
result Established minimax rates of convergence for principal components and covariance matrix estimation.

Algorithm learns optimal coordination for strategic agents in uncertain settings.

problem Optimizing rewards for strategic agents with private types and actions.
method Combines delaying mechanism, reward angle estimation, and LinUCB algorithm.
result Near optimal regret bound of O~(T)\tilde{O}(\sqrt{T}) for learning optimal policy.

This paper provides theoretical guarantees for SPCA using the Elastic Net.

problem Lack of theoretical guarantees for the SPCA algorithm.
method Revisited and improved the SPCA algorithm of Zou et al. (2006) using the Elastic Net.
result Both algorithms can recover the principal subspace consistently under mild conditions.

Gradient descent recovers principal components of overparametrized asymmetric matrices without explicit regularization.

problem Asymmetric matrix factorization under overparametrization with minimal rank assumptions.
method Vanilla gradient descent with small random initialization and proper early stopping.
result Gradient descent produces the best low-rank approximation without explicit regularization.

We examine the large systole problem, which concerns compact hyperbolic Riemannian surfaces whose systole, the length of the shortest noncontractible loops, grows logarithmically in genus. The generalization of a construction of Buser and Sarnak by Katz, Schaps, and Vishne, which uses principal "congruence" subgroups o…

2012-06-13abs ↗pdf ↗

A new method for efficiently computing derivatives of skew-symmetric matrix exponentials.

problem Efficient computation of derivatives for skew-symmetric matrices.
method Characterization of invertibility, construction of nearby logarithm, and efficient implementation.
result Explicit formulae for differentiation and its inverse of skew-symmetric matrix exponentials.

We consider the two logarithmic strain measures\[ω_{\rm iso}=\|\mathrm{dev}_n\log U\|=\|\mathrm{dev}_n\log \sqrt{F^TF}\|\quad\text{ and }\quad ω_{\rm vol}=|\mathrm{tr}(\log U)|=|\mathrm{tr}(\log\sqrt{F^TF})|\,,\]which are isotropic invariants of the Hencky strain tensor logU\log U, and show that they can be uniquely char…

2015-05-08abs ↗pdf ↗

Kernel principal component analysis (KPCA) provides a concise set of basis vectors which capture non-linear structures within large data sets, and is a central tool in data analysis and learning. To allow for non-linear relations, typically a full n×nn \times n kernel matrix is constructed over nn data points, but this…

2015-12-16abs ↗pdf ↗

New geometric framework for positive semidefinite matrices of fixed rank.

problem Statistical analysis of positive semidefinite matrices of fixed rank.
method Introducing a manifold S(n,p)S(n,p)^{*} with Riemannian geometry and Lie group structure.
result Analytical closed forms for geodesics and Fréchet means.

Paper addresses eigenvector perturbation in small eigen-gap scenarios.

problem Fine-grained behavior of eigenvectors in the presence of small eigen-gaps.
method Develops de-biased estimators for linear functions of an unknown eigenvector.
result Achieves minimax lower bounds for a family of scenarios, even with small eigen-gaps.

Using adiabatic limits of Eta invariants, Rho invariants of the total space of a fiber bundle are investigated. One concern is to formulate the aspects of local index theory for families of Dirac operator in terms of the odd signature operator, and place known results in a context which permits the treatment of Rho inv…

2009-07-21abs ↗pdf ↗

The paper develops a method for optimal projection selection in high-dimensional classification.

problem High-dimensional classification with latent variable structure.
method Formulates a latent-variable model and proposes a computationally efficient classifier.
result Explicit rates of convergence for excess risk of the proposed classifier are derived and shown to be optimal.

Fourier PCA is Principal Component Analysis of a matrix obtained from higher order derivatives of the logarithm of the Fourier transform of a distribution.We make this method algorithmic by developing a tensor decomposition method for a pair of tensors sharing the same vectors in rank-11 decompositions. Our main appli…

2013-06-25abs ↗pdf ↗

Low-precision streaming PCA estimates the leading eigenvector with limited precision.

problem Estimating the leading eigenvector in a streaming setting with limited precision.
method Oja's algorithm with linear and nonlinear stochastic quantization.
result A batched version of the quantized variants achieves the lower bound on quantization error up to logarithmic factors.

Study real logarithms of semi-simple matrices, focusing on differential structure.

problem Understanding the differential structure of real logarithms of semi-simple matrices.
method Examines the differential structure of real logarithms of semi-simple matrices under specific matrix types.
result Characterizes the differential structure of real logarithms of semi-simple matrices.

Study excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.

problem Bounding invariant hypersurfaces and testing log canonicity of singularities.
method Introduce excess logarithmic residues, prove residue formula, derive Poincaré-type bound, and use them to recover log discrepancies.
result Componentwise logarithmic residues of a lifted foliation along the exceptional divisor recover log discrepancies of singularities.

Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite, number of loss functions. In this paper, we propose a novel Riemannian extension of the Euclidean stochastic variance reduced gradient algorithm (R-SVRG) to a compact manifold search space. To this e…

2016-05-24abs ↗pdf ↗

We present a new method to solve certain ˉ\bar{\partial}-equations for logarithmic differential forms by using harmonic integral theory for currents on Kahler manifolds. The result can be considered as a ˉ\bar{\partial}-lemma for logarithmic forms. As applications, we generalize the result of Deligne about closedness…

2017-07-31abs ↗pdf ↗

The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability space…

2007-09-09abs ↗pdf ↗

Logarithmic separation profile in hyperbolic groups shows hierarchical structure.

problem Understanding hierarchical structure in hyperbolic groups with logarithmic separation.
method Proving groups with logarithmic separation split over cyclic groups and providing counterexamples.
result Not all groups with hierarchical structure have logarithmic separation profile.

Paper uses ABP method to prove logarithmic Sobolev inequalities on curved spaces.

problem Proving logarithmic Sobolev inequalities on manifolds with nonnegative curvature.
method Employing the ABP method developed by Brendle.
result Sharp L2L^2 and LpL^p logarithmic Sobolev inequalities established.

The paper constructs a Saito basis for a specific class of divisors and applies it to logarithmic Poisson geometry.

problem Investigating a class of non-quasi-homogeneous free divisors and their logarithmic vector fields.
method Explicitly constructing a Saito basis for the module of logarithmic vector fields and applying it to logarithmic Poisson geometry.
result The construction of the Saito basis and the Lie-Rinehart algebra structure on the sheaf of logarithmic 1-forms.

In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers in the radical of the restricted quantum group at root of unity. A relation bet…

2014-06-05abs ↗pdf ↗

Study of conformal logarithmic Laplacian on sphere, connecting Yamabe problems and Sobolev spaces.

problem Yamabe-type problems and Sobolev spaces on the sphere.
method Detailed spectral analysis, conformal invariance, and Hilbert space introduction.
result Established precise connection between sphere and \(\mathbb{R}^N\) logarithmic Laplacian.

Paper finds necessary condition for logarithmic Minkowski problem in higher dimensions.

problem Logarithmic Minkowski problem in higher dimensions.
method Established a necessary condition through generalization and refinement of previous work.
result Generalizes and refines necessary condition for logarithmic Minkowski problem.

We construct helicoid-like embedded minimal disks with axes along self-similar curves modeled on logarithmic spirals. The surfaces have a self-similarity inherited from the curves and the nature of the construction. Moreover, inside of a "logarithmic cone", the surfaces are embedded.

2014-04-28abs ↗pdf ↗

Bandit algorithms struggle with consistent performance and robustness.

problem Achieving consistent and robust performance in stochastic multi-armed bandit settings.
method Analyzing regret minimization trade-offs and proposing distribution-oblivious algorithms.
result Logarithmic regret is inconsistent and super-logarithmic regret is necessary for consistent learning.

Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.

problem Characterize measures generated by electrostatic p-capacity.
method Solves the discrete logarithmic Minkowski problem for 1 < p < n.
result Solves the discrete logarithmic Minkowski problem for measures in general position.

We generalize Demailly's construction of projective jet bundles and strictly negatively curved pseudometrics on them to the logarithmic case. We establish this logarithmic generalization explicitly via coordinates, just as Noguchi's generalization of the jets used by Green-Griffiths. As a first application, we give a m…

2000-01-17abs ↗pdf ↗

Logarithmic Sobolev inequality proven for non-compact self-shrinkers.

problem Establishing a logarithmic Sobolev inequality for non-compact self-shrinkers.
method Using Alexandrov-Bakelman-Pucci (ABP) method to prove the inequality for Euclidean space, then applying this method to non-compact self-shrinkers.
result Optimal logarithmic Sobolev inequality for complete, non-compact, properly embedded self-shrinkers.