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

53105158210 · Jun 202019922001200920172026
48 results for Dudley Entropy Integral

This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.

problem Ensuring the performance of complex-valued neural networks on unseen data.
method Theoretical derivation using Maurey Sparsification Lemma and Dudley Entropy Integral, empirical validation on various datasets.
result The spectral complexity of weight matrices is a significant factor in the generalization ability of complex-valued neural networks.

Study shows depth improves generalization in deep learning models.

problem Understanding why and when depth improves generalization in deep learning.
method Implementation-agnostic state-transition model to analyze depth and generalization.
result Identifies geometric and semigroup mechanisms that keep entropy contribution saturated or polynomial, clarifying depth's statistical advantage.

We consider the problem of online nonparametric regression with arbitrary deterministic sequences. Using ideas from the chaining technique, we design an algorithm that achieves a Dudley-type regret bound similar to the one obtained in a non-constructive fashion by Rakhlin and Sridharan (2014). Our regret bound is expre…

2015-02-26abs ↗pdf ↗

The paper develops generalization bounds for deep compound Gaussian neural networks.

problem Developing theoretical guarantees for the performance of deep neural networks.
method Novel generalization error bounds using a compound Gaussian prior and Dudley's integral.
result Theoretical bounds show generalization error scales O(nln(n))\mathcal{O}(n\sqrt{\ln(n)}) in signal dimension and O((NetworkSize)3/2)\mathcal{O}((Network Size)^{3/2}) in network size.

Improved neural network reconstruction from sparse measurements with theoretical guarantees.

problem Improving neural network performance in sparse signal reconstruction from few measurements.
method Combining iterative reconstruction algorithms with neural networks, analyzing generalization properties, and deriving a generalization bound.
result Theoretical guarantees for neural network reconstruction from compressive linear measurements, with generalization error scaling logarithmically in the number of layers and linearly in the number of measurements.

Extends Optimal Transport to multiple agents, aiming for equitable and optimal distribution.

problem Sharing costs or goods equitably among multiple agents with different preferences.
method Minimizes the maximum transportation cost or maximizes the minimum utility.
result Provides a new algorithm faster than standard linear programming.

We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coeffic…

2011-03-14abs ↗pdf ↗

The paper analyzes how machine learning models perform under covariate shift, especially when the feature shift in xx is larger than that in yy.

problem Performance of machine learning models under covariate shift with heterogeneous feature changes.
method Empirical risk minimization (ERM) over functions f+gf+g, fit on a training distribution, evaluated on a test distribution with covariate shift.
result ERM is more resilient to heterogeneous covariate shifts when the class FF is simpler than GG.

Paper proves integrability and entropy compactness for Kähler potentials with uniform log-log threshold.

problem Integrability and entropy compactness for Kähler potentials with specific density.
method Skoda-Zeriahi type integrability theorem and log-log threshold detection.
result Positivity of integrability threshold and entropy compactness for uniform log-log threshold.

The paper proves a quantitative rigidity result for spaces with specific curvature bounds.

problem Understanding the rigidity of spaces with almost maximal volume entropy.
method Analyzing Riemannian manifolds and RCD\operatorname{RCD}-spaces with specific curvature conditions.
result Spaces with almost maximal volume entropy are closely related to hyperbolic space forms.

This study uses Tsallis entropy to analyze diversification and integration in Italian stock market companies.

problem Examining the industrial structure and market reactions of cross-shareholding networks.
method Developed Tsallis entropy approach to model diversification and integration using copulas.
result Entropy analysis reveals insights into market polarisation and fairness.

The study shows almost maximal volume entropy rigidity for certain manifolds with integral Ricci curvature.

problem Volume entropy rigidity for manifolds with lower integral Ricci curvature bound.
method Analyzing manifolds with specific integral Ricci curvature bounds, diameter, and volume entropy.
result The universal cover of the manifold is close to a hyperbolic space form under certain conditions.

As we have proved in [L], the geodesic flows associated with the flat metrics on T^2 minimize the polynomial entropy. In this paper, we show that, among the geodesic flows that are Bott integrable and dynamically coherent, the geodesic flows associated to flat metrics are local strict minima for the polynomial entropy.…

2012-07-20abs ↗pdf ↗

A relation between the conformal anomaly and the logarithmic term in the entanglement entropy is known to exist for CFT's in even dimensions. In odd dimensions the local anomaly and the logarithmic term in the entropy are absent. As was observed recently, there exists a non-trivial integrated anomaly if an odd-dimensio…

2016-01-24abs ↗pdf ↗

For any toric automorphism with only real eigenvalues a Riemannian metric with an integrable geodesic flow on the suspension of this automorphism is constructed. A qualitative analysis of such a flow on a three-solvmanifold constructed by the authors in math.DG/9905078 is done. This flow is an example of the geodesic f…

1999-11-24abs ↗pdf ↗

The entropy-degree theorem applies to Alexandrov spaces with curvature constraints.

problem Geometric obstructions and volume bounds in singular spaces.
method Developed new degree theorem for Alexandrov spaces using integral currents.
result Entropy-volume minimization prevents metric singularities in Gromov-Hausdorff limits.

The entropy of a hypersurface is a geometric invariant that measures complexity and is invariant under rigid motions and dilations. It is given by the supremum over all Gaussian integrals with varying centers and scales. It is monotone under mean curvature flow, thus giving a Lyapunov functional. Therefore, the entropy…

2012-05-09abs ↗pdf ↗

The paper proves lower bounds for Gaussian-weighted curvature integrals of self-shrinkers.

problem Proving lower bounds for Gaussian-weighted \(L^2\)-curvature integrals of self-shrinkers.
method Combining normal coordinate functions with weighted Poincaré inequalities and first-eigenvalue estimates.
result Explicit lower bounds in terms of entropy for closed self-shrinkers, leading to curvature gaps.

Proposes integrating global and local entropy for more reliable LLMs.

problem Uncertainty in large language models (LLMs) leads to unreliable predictions.
method Measures global uncertainty from hidden-state matrices and local uncertainty from tokens, combining them via a multiplicative gate.
result Global-Local Uncertainty (GLU) outperforms unsupervised baselines across multiple models and benchmarks.

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational O(2) symmetry in a subspace orthogonal to a singular surface ΣΣ so that the surfa…

2013-06-17abs ↗pdf ↗

Let MM be a compact Riemannian manifold without boundary and V:MRV:M\to \mathbb R a smooth function. Denote by PtP_t and dμ=eVdx{\rm d}μ=e^V\,{\rm d} x the semigroup and symmetric measure of the second order differential operator L=Δ+VL=Δ+\nabla V\cdot\nabla. For some suitable convex function Φ:IRΦ:{\mathcal I}\to\mathbb R define…

2015-01-08abs ↗pdf ↗

ED-VAE improves VAEs by explicitly including entropy components in ELBO.

problem Limitations of traditional VAEs with ELBO in generating high-quality samples and interpreting latent spaces.
method Introduces ED-VAE, a re-formulation of ELBO that includes entropy and cross-entropy components.
result Significantly enhances model flexibility and improves interpretability and generative performance.

Convolution operations designed for graph-structured data usually utilize the graph Laplacian, which can be seen as message passing between the adjacent neighbors through a generic random walk. In this paper, we propose PAN, a new graph convolution framework that involves every path linking the message sender and recei…

2019-04-24abs ↗pdf ↗

The holographic description in the presence of gravitational Chern-Simons term is studied. The modified gravitational equations are integrated by using the Fefferman-Graham expansion and the holographic stress-energy tensor is identified. The stress-energy tensor has both conformal anomaly and gravitational or, if re-f…

2005-09-20abs ↗pdf ↗

Geometrically constructs twist-field correlation functions in CFT.

problem Understanding entanglement entropy in quantum systems.
method Using Cauchy-Hadamard renormalization of Polyakov anomaly integral on surfaces with conical singularities.
result Provides a purely mathematical interpretation of entanglement entropy results.

We show the flexibility of the metric entropy and obtain additional restrictions on the topological entropy of geodesic flow on closed surfaces of negative Euler characteristic with smooth non-positively curved Riemannian metrics with fixed total area in a fixed conformal class. Moreover, we obtain a collar lemma, a th…

2019-02-08abs ↗pdf ↗

A new CoVaR framework integrates expert views using entropy pooling.

problem Risk assessment and spillover effects from diverse expert views.
method Entropy pooling method to integrate expert views and compute general CoVaR.
result General CoVaR shows linear relationships with expectations and differences in expectations, and nonlinear dependencies with variance, quantiles, and correlation.

A qq-Gaussian measure is a generalization of a Gaussian measure. This generalization is obtained by replacing the exponential function with the power function of exponent 1/(1q)1/(1-q) (q1q\neq 1). The limit case q=1q=1 recovers a Gaussian measure. For 1q<31\leq q <3, the set of all qq-Gaussian densities over the real line …

2020-02-06abs ↗pdf ↗

The paper studies Q-curvature and volume entropy on manifolds, proving polynomial growth polyharmonic function finiteness and rigidity.

problem Investigating Q-curvature and volume entropy on conformally flat manifolds.
method Introducing a new volume entropy, establishing identities, and proving rigidity results.
result Each polynomial growth polyharmonic function on such manifolds is of finite dimension, and the Cohn-Vossen inequality achieves equality under specific conditions.

The dual Minkowski problem for even data asks what are the necessary and sufficient conditions on an even prescribed measure on the unit sphere for it to be the qq-th dual curvature measure of an origin-symmetric convex body in Rn\mathbb{R}^n. A full solution to this is given when 1<q<n1 < q < n. The necessary and suffic…

2017-03-18abs ↗pdf ↗

The article examines entropy-information inequalities for continuous-time Markov chains under curvature-dimension conditions.

problem Proving Li-Yau inequalities and modified logarithmic Sobolev inequalities for reversible Markov chains.
method Introducing the CDΥ(κ,F)CD_Υ(κ,F) condition and deriving entropy-information inequalities.
result Derives functional inequalities relating entropy to Fisher information.

Information theory provides principled ways to analyze different inference and learning problems such as hypothesis testing, clustering, dimensionality reduction, classification, among others. However, the use of information theoretic quantities as test statistics, that is, as quantities obtained from empirical data, p…

2012-11-11abs ↗pdf ↗