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

2845678511,134 · Jun 202019922001200920172026
48 results for local pseudorandom generators

New framework improves text watermark detection under imperfect pseudorandomness.

problem Structured dependence in generated text from language models causes Type I error control issues.
method Hierarchical two-layer partition, minimal units, non-asymptotic efficiency measure, minimax hypothesis testing.
result Closed-form optimal rules for watermark detection under imperfect pseudorandomness.

New findings show learning deeper neural networks is hard even with Gaussian inputs and non-degenerate weights.

problem The computational complexity of learning neural networks, especially deeper ones.
method Smoothed analysis framework and local pseudorandom generators.
result Learning depth-3 ReLU networks under Gaussian input distribution is hard even if weight matrices are non-degenerate.

Generation of pseudorandom numbers from different probability distributions has been studied extensively in the Monte Carlo simulation literature. Two standard generation techniques are the acceptance-rejection and inverse transformation methods. An alternative approach to Monte Carlo simulation is the quasi-Monte Carl…

2014-03-22abs ↗pdf ↗

Arora, Barak, Brunnermeier, and Ge showed that taking computational complexity into account, a dishonest seller could strategically place lemons in financial derivatives to make them substantially less valuable to buyers. We show that if the seller is required to construct derivatives of a certain form, then this pheno…

2010-06-02abs ↗pdf ↗

New findings suggest minimax optimality doesn't guarantee distribution learning for GANs.

problem Understanding when GANs can truly learn the underlying distribution.
method Using cryptographic assumptions and ReLU network generators, the paper shows that achieving minimax optimality is insufficient for distribution learning.
result Achieving minimax optimality is insufficient for distribution learning in the usual statistical sense.

Quantum speedup for Monte Carlo integration reduces integrand calls.

problem Reducing the number of calls to the integrand subroutine in high-dimensional Monte Carlo integration.
method Combining nested quantum amplitude estimation with pseudorandom numbers for separable integrands.
result Significant reduction in the number of integrand calls for high-dimensional integration.

The paper shows how shared random seeds can reduce variance in machine learning evaluations.

problem The statistical structure of comparative evaluation under shared random seeds is not well understood.
method An extended learning-based multi-agent economic simulator was used to demonstrate the effects of shared random seeds on variance reduction.
result Pairing seeds can reduce variance in machine learning evaluations, especially when outcomes are positively correlated at the seed level.

Estimates proportions of LLM-generated text in mixed documents.

problem Estimating the proportion of text generated by a pre-specified LLM in mixed documents.
method Developed estimators for two observation regimes: full observation and pivotal reduction, and established sample complexity bounds.
result Full observation estimators require fewer samples than pivotal reduction estimators.

Study on estimating Gumbel--Max watermark proportions in edited documents.

problem Estimating the proportion of a document generated from a watermarked LLM.
method Comparison of full observation and pivotal reduction observation regimes; development of estimators and information-theoretic lower bounds.
result Full observation yields a substantially smaller sample complexity compared to pivotal reduction.

New framework to understand and exploit curvature in deep learning loss landscapes.

problem Understanding and optimizing the loss landscape in deep learning models.
method New conceptual framework and techniques to estimate and exploit curvature of expected loss changes.
result Alice algorithm optimizes training by incorporating curvature terms and step bounds.

New concept of epiplexity quantifies useful information from data.

problem Understanding useful information content from data without unlimited computational capacity.
method Introducing epiplexity, a measure of information computationally bounded observers can learn.
result Epiplexity captures useful information content, not just randomness.

A reflexion space is generalization of a symmetric space introduced by O. Loos. We generalize locally symmetric spaces to local reflexion spaces in the similar way. We investigate, when local reflexion spaces are equivalently given by a locally flat Cartan connection of certain type.

2012-07-01abs ↗pdf ↗

We investigate (local) automorphisms of parabolic geometries that generalize geodesic symmetries. We show that many types of parabolic geometries admit at most one generalized geodesic symmetry at a point with non-zero harmonic curvature. Moreover, we show that if there is exactly one symmetry at each point, then the p…

2016-07-07abs ↗pdf ↗

Localized deformation of scalar curvature and mean curvature on manifolds.

problem Deforming scalar curvature and mean curvature on compact manifolds with boundary.
method Proving localized surjection of scalar curvature and mean curvature map, handling non-variational linearized problem.
result Localized deformations of scalar curvature and mean curvature on compact manifolds are possible.

Study proves positivity of quasi-local masses in general relativity using spinors.

problem Proving the positivity of quasi-local masses in general relativity.
method Using spinors and solving Dirac equation on compact Riemannian manifolds with boundary conditions.
result Gravitational mass bounded by a spacelike topological 2-sphere is non-negative, vanishing only in Minkowski space.

This work extends locally conformal analysis to multi-Hamiltonian settings, providing new geometric structures and Hamiltonian dynamics.

problem Globalization problem in multi-Hamiltonian formalisms due to incompatibilities on chart overlaps.
method Investigation of locally conformally Nambu--Poisson and locally conformally generalized Poisson manifolds, constructing Hamiltonian-type evolution equations.
result Unified framework for classical, Nambu--Poisson, and generalized Poisson manifolds within a locally conformal context.

We explain the meaning of local symmetries in physics.

problem Understanding the meaning of local symmetries in physics.
method We argue that general covariance and gauge principles are principles of epistemic access to physical laws, leading to ontological insights.
result Relationality is a core notion in gauge field theory, encoded by local symmetries.

We show that every Sasakian manifold in dimension 2k+12k+1 is locally generated by a free real function of 2k2k variables. This function is a Sasakian analogue of the Kähler potential for Kähler geometry. It is also shown that every locally Sasakian-Einstein manifold in 2k+12k+1 dimensions is generated by a locally Kähler-…

2000-05-08abs ↗pdf ↗

Localized diffusion models reduce training complexity by exploiting low-dimensional structure.

problem Training diffusion models is computationally expensive due to the curse of dimensionality.
method Localized neural networks and localized score matching loss to estimate low-dimensional score functions.
result Localized diffusion models can circumvent the curse of dimensionality with reduced sample complexity.

Generalizing the notion of local φφ-symmetry of Takahashi, in the present paper, we introduce the notion of local φφ-semisymmetry of a Sasakian manifold along with its proper existence and characterization. We also study the notion of local Ricci (resp., projective, conformal) φφ-semisymmetry of a Sasakian manifold …

2013-02-08abs ↗pdf ↗

The paper connects machine learning interpretability with learning theory.

problem Performance and explanation generalization in local machine learning models.
method Theoretical analysis and empirical validation of local approximation explanations.
result Theoretical bounds on test-time accuracy and explanation generalization.

We introduce the notion of a local torus action modeled on the standard representation (for simplicity, we call it a local torus action). It is a generalization of a locally standard torus action and also an underlying structure of a locally toric Lagrangian fibration. For a local torus action, we define two invariants…

2007-10-11abs ↗pdf ↗

We provide a formulation for Local Support Vector Machines (LSVMs) that generalizes previous formulations, and brings out the explicit connections to local polynomial learning used in nonparametric estimation literature. We investigate the simplest type of LSVMs called Local Linear Support Vector Machines (LLSVMs). For…

2013-09-14abs ↗pdf ↗

Improved Local SGD convergence for general convex objectives with bounded second-order heterogeneity.

problem Understanding when and why Local SGD outperforms alternatives in distributed optimization.
method Established improved convergence guarantees for Local SGD on general convex objectives under bounded second-order heterogeneity.
result Upper bounds for Local SGD are nearly tight, providing a sharper convergence theory.

This thesis treats two main topics: calibrated symplectic foliations, and local Lie groupoids. Calibrated symplectic foliations are one possible generalization of taut foliations of 3-manifolds to higher dimensions. Their study has been popular in recent years, and we collect several interesting results. We then show h…

2018-04-04abs ↗pdf ↗

We classify connected Lie groups which are locally isomorphic to generalized Heisenberg groups. For a given generalized Heisenberg group NN, there is a one-to-one correspondence between the set of isomorphism classes of connected Lie groups which are locally isomorphic to NN and a union of certain quotients of noncom…

2006-10-23abs ↗pdf ↗

The paper generalizes Hodge theory to semisimple local systems and proves a geometric Decomposition theorem.

problem Generalizing Hodge theory to semisimple local systems.
method Establishing a canonical isomorphism and proving a global invariant cycle theorem.
result A new geometric proof of the Decomposition theorem for semisimple local systems.

In this paper, we show that the Chen-Nester-Tung (CNT) quasi-local energy is closely related to the Wang-Yau (WY) quasi-local mass. As a particular example, we compute the second variation of the CNT quasi-local energy for axially symmetric Kerr-like spacetimes with axially symmetric embeddings at the obvious critical …

2016-04-18abs ↗pdf ↗

This (quasi-)survey addresses the quasi-isometry classification of locally compact groups, with an emphasis on amenable hyperbolic locally compact groups. This encompasses the problem of quasi-isometry classification of homogeneous negatively curved manifolds. A main conjecture provides a general description; an extend…

2012-12-10abs ↗pdf ↗

Local equivalence found between certain solitons and generalized Kähler-Ricci solitons.

problem Understanding and constructing generalized Kähler-Ricci solitons.
method Establishing local equivalence and extending to complete GKRS under natural conditions.
result Local classification and construction of new examples in all dimensions, especially in four dimensions.

Derives Selberg trace formula on Riemann surfaces and generalizes to other spaces.

problem Deriving and generalizing the Selberg trace formula.
method Supersymmetric localization principle and path integral derivation.
result Derives Selberg trace formula on arbitrary compact Riemann surfaces and generic compact locally symmetric spaces.

A statistical test controls false positives in anomaly localization using diffusion models.

problem Uncertainty and bias in generative models for anomaly localization.
method Selective inference to quantify significance and control false positives.
result The method effectively controls false positive detection rates.

The paper proves a generalized Lefschetz duality for a specific type of manifold.

problem Proving the hard Lefschetz duality for a new class of manifolds.
method Generalizing Kähler identities to prove the duality for locally conformally almost Kähler manifolds.
result The hard Lefschetz duality is established for locally conformally almost Kähler manifolds.

Study compares and unifies finiteness properties of locally compact groups.

problem Understanding finiteness properties of locally compact groups.
method Comparing and unifying three families of finiteness properties: type CnC_n, coarse (n1)(n-1)-connectedness, and type FnF_n.
result All three families lead to the same notion for locally compact groups.