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

119238357476 · Jun 202019922001200920172026
48 results for logarithmic complexity

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.

We pursue the study of holomorphic Cartan geometry with singularities. We introduce the notion of logarithmic Cartan geometry on a complex manifold, with polar part supported on a normal crossing divisor. In particular, we show that the push-forward of a Cartan geometry constructed using a finite Galois ramified coveri…

2019-07-30abs ↗pdf ↗

We shall introduce the notion of CC^\infty logarithmic symplectic structures on a differentiable manifold which is an analog of the one of logarithmic symplectic structures in the holomorphic category. We show that the generalized complex structure induced by a CC^\infty logarithmic symplectic structure has unobstruc…

2015-01-14abs ↗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 ↗

Research examines correlations of complex logarithms of lattice points, showing level repulsion and Poissonian behavior.

problem Analyzing correlations of complex logarithms of lattice points.
method Proving existence of pair correlation functions and examining behavior at various scalings.
result Level repulsion observed at linear scaling, Poissonian behavior at sublinear scalings.

Paper shows FB and FC are equally hard up to logarithmic factors.

problem Comparing fixed budget and fixed confidence approaches in best-arm identification.
method Proposes FC2FB, a meta algorithm converting FC to FB.
result FC sample complexity is an upper bound for FB sample complexity up to logarithmic factors.

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.

Proves non-positivity of Hirzebruch form on stable weights and connects to flat logarithmic connections.

problem Non-positivity of Hirzebruch form on stable weights
method Kempf--Ness and frame-potential inequality
result Zero locus of Hirzebruch form on stable weights corresponds to flat logarithmic connections

We prove a global residual formula in terms of logarithmic indices for one-dimensional holomorphic foliations, with isolated singularities, and logarithmic along normal crossing divisors. We also give a formula for the total sum of the logarithmic indices if the singular set of the foliation is contained in the invaria…

2018-09-19abs ↗pdf ↗

Applying logarithmic transformations along 2-tori, we construct a generalized complex structure J_n with n type changing luci for every n0n\geq 0 on genus 1-Lefschetz fibrations with a cusp neighborhood, which include elliptic surfaces with non-zero euler characteristic. Applying a technique of broken Lefschetz fibrati…

2013-05-17abs ↗pdf ↗

Near-logarithmic regret per switch achieved for mixable/exp-concave losses.

problem Online optimization of mixable loss functions with dynamic environments.
method Online mixture framework using static solvers and hyper-expert creations.
result Near-logarithmic regret per switch with sub-polynomial complexity.

Study Higgs bundles on curves with punctures, extending spectral correspondence.

problem Classify Higgs bundles on punctured curves with logarithmic structures.
method Logarithmic Hecke compactification, spectral conditions, and sheaf classification.
result Logarithmic spectral correspondence extended to punctured curves.

Normal forms and moduli stacks for flat connections on complex manifolds.

problem Understanding singular flat connections on complex manifolds.
method Introducing homogeneous Lie groupoids and studying their representation theory to prove normal form theorems and moduli space structures.
result Moduli spaces of singular flat connections admit the structure of algebraic quotient stacks.

Formula for sections on complex manifolds with non-isolated components.

problem Localization of sections on complex manifolds with non-isolated zero varieties.
method Logarithmic Bott localization formula, current-theoretic formulation.
result Established a formula for sections on compact complex manifolds with non-isolated components.

The paper proves a logarithmic partial derivative lemma and applies it to several geometric problems.

problem Proving a logarithmic partial derivative lemma for compact Kähler manifolds.
method Developed a new ˉ\partial\bar{\partial}-type lemma for logarithmic differential forms.
result Confirmed a conjecture by X. Wan and derived several geometric applications.

Proves a Baum--Bott formula for foliations by curves with logarithmic terms.

problem Analyzing singularities and smoothness in foliations by curves.
method Logarithmic Baum--Bott residues for foliated triples (X,F,D)(X, \mathcal{F}, D), relating to Poincaré's Problem and GSV indices.
result Logarithmic Baum--Bott residues generalize Aleksandrov logarithmic index for vector fields on hypersurfaces.

Transformers capture combinatorial tasks with bounded error and logarithmic sample dependence.

problem Capturing complex combinatorial tasks with bounded error and sample efficiency.
method Formal definition of algorithmic capture, empirical analysis of infinite-width transformers, upper bounds on computational complexity.
result Transformers exhibit an inductive bias favoring simpler algorithmic procedures over higher complexity ones.

The paper analyzes the statistical cost of tuning kernel hyperparameters in robust regression.

problem Finding the best interpolant from a class of kernels with unknown hyperparameters under adversarial noise.
method Finite-sample guarantees, subsampling guarantee for linear regression, ε-net argument for discretizing kernel parameterizations.
result Hyperparameter optimization increases sample complexity by just a logarithmic factor, compared to known parameters.

GOCPD detects change points by maximizing the probability of two independent models.

problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.

In this paper, we investigate representations of At(N)\operatorname{At}(N), the Atiyah algebroids of a holomorphic line bundles NN over a complex manifold YY. In particular, we relate At(N)\operatorname{At}(N)-modules with logarithmic connections through two functors. On the one hand, we use these functors to the define in…

2015-05-18abs ↗pdf ↗

Optimal ReLU networks can memorize any separable set of points with a small number of parameters.

problem The optimal number of parameters required to memorize a set of points using ReLU networks.
method Construction of ReLU networks with specific bit complexity to memorize points satisfying a mild separability assumption.
result Optimal ReLU networks can memorize any separable set of points with a number of parameters that is ildeO(N) ilde{O}(\sqrt{N}).

Study hypothesis testing under quantized samples with communication constraints, achieving near-optimal sample complexity.

problem Optimizing hypothesis testing with quantized samples and communication constraints.
method Developed a polynomial-time algorithm achieving near-optimal sample complexity under communication constraints.
result Achieved near-optimal sample complexity under communication constraints, with a logarithmic factor increase over unconstrained setting.

Paper analyzes and improves KL-regularized RL for LLMs with logarithmic regret.

problem Improving efficiency of RL fine-tuning for large language models.
method Optimism-based KL-regularized online contextual bandit algorithm with novel regret analysis.
result Achieves an O(ηlog(NRT)dR)\mathcal{O}\big(η\log (N_{\mathcal R} T)\cdot d_{\mathcal R}\big) logarithmic regret bound.

We introduce blow-up and blow-down operations for generalized complex 4-manifolds. Combining these with a surgery analogous to the logarithmic transform, we then construct generalized complex structures on nCP2 # m \bar{CP2} for n odd, a family of 4-manifolds which admit neither complex nor symplectic structures unless…

2008-06-05abs ↗pdf ↗

Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.

problem Optimal unimodal transformation of univariate model scores under linear loss functions.
method Proposes a sequential approach to estimate the optimal rectangular fit for observed samples with each new sample.
result Sequential approach achieves optimal efficiency with logarithmic time complexity per iteration.

Improved GNN simulation of WL test with exponentially lower complexity.

problem Improving the complexity of simulating the Weisfeiler-Lehman test with GNNs.
method Exponentially lower complexity simulation of WL test using GNNs with polylogarithmic parameters and O(log n) bits feature vectors.
result Near-optimal construction with logarithmic lower bounds for feature vector length and neural network size.

Let (X,D)(X, D) be a logarithmic pair, and let hh be a singular metric on the tangent bundle, smooth on the open part of XX. We give sufficient conditions on the curvature of hh for the logarithmic and the standard cotangent bundles to be big. As an application, we give a metric proof of the bigness of logarithmic cota…

2016-06-17abs ↗pdf ↗

This work improves the convergence theory of diffusion models for generating samples from complex distributions.

problem Improving theoretical understanding of diffusion models, particularly their convergence analysis.
method Developed an instance-dependent convergence rate that adapts to the smoothness of target distributions.
result Established an iteration complexity of min{d,d2/3L1/3,d1/3L}ε2/3\min\{d,d^{2/3}L^{1/3},d^{1/3}L\}\varepsilon^{-2/3} for generating high-quality samples.

Study shows sample complexity for learning optimal policies in SSP with generative model.

problem Learning optimal policies in Stochastic Shortest Path problems.
method Derive and prove lower and upper bounds on sample complexity.
result Lower bound of Ω(SAB3/(cminε2))Ω(SAB_{\star}^3/(c_{\min}ε^2)) samples for general case, and up to logarithmic factors for bounded hitting time condition.

Paper constructs an invariant for a specific type of complex manifolds.

problem Analyzing an invariant for a specific class of complex manifolds.
method Using equivariant analytic torsion, the paper constructs an invariant for irreducible holomorphic symplectic manifolds with antisymplectic involution.
result A formula for the complex Hessian of the logarithm of the invariant is provided.

New algorithm reduces online logistic regression regret without exponential constant.

problem Improper learning in online logistic regression with logarithmic regret.
method Regularized empirical risk minimization with surrogate losses.
result Regret scaling as O(B log(Bn)) with low computational complexity.

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.