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

Trend · papers per month

336698131 · May 202619922001200920172026
48 results for log VOAs

Study reveals connection between torus links and logarithmic VOAs.

problem Understanding the relationship between torus links and logarithmic VOAs.
method Proposed a geometric method to compute the singlet character of (s,t)(s,t)-log VOA.
result The singlet character of (s,t)(s,t)-log VOA at the root of unity coincides with the Kashaev invariant and exhibits quantum modularity.

Characters from logarithmic VOAs linked to torus link invariants.

problem Understanding characters of logarithmic vertex operator algebras.
method Relating characters to coloured Jones invariants of torus links.
result Characters of logarithmic VOAs are limits of coloured Jones invariants of torus links.

New algorithm constructs characters of rational VOAs from knot complements.

problem Constructing characters of rational VOAs from knot complements.
method 3D N=2\mathcal{N}=2 gauge theories, Dimofte-Gaiotto-Gukov construction, 3D N=4\mathcal{N}=4 rank-0 SCFT, topological twist.
result New Nahm-sum-like expressions for Virasoro minimal model characters.

We introduce two KK-theories, one for vector bundles whose fibers are modules of vertex operator algebras, another for vector bundles whose fibers are modules of associative algebras. We verify the cohomological properties of these KK-theories, and construct a natural homomorphism from the VOA K-theory to the associa…

2004-03-31abs ↗pdf ↗

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.

In this paper, we prove that the zero-locus of any global holomorphic log-one-form on a projective log-smooth pair (X,D)\left(X,D\right) of log-general type must be non-empty. Applying this result, we give an answer to the algebraic hyperbolicity part of Shafarevich's conjecture, with the generic fiber being Kawamata-log-…

2017-11-15abs ↗pdf ↗

We consider active learning with logged data, where labeled examples are drawn conditioned on a predetermined logging policy, and the goal is to learn a classifier on the entire population, not just conditioned on the logging policy. Prior work addresses this problem either when only logged data is available, or purely…

2018-02-25abs ↗pdf ↗

Establishes log-concavity estimates for convex domains' first Dirichlet eigenfunctions.

problem Quantifying the Hessian of log-concave eigenfunctions on convex domains.
method Analyzes log-concavity properties of the first Dirichlet eigenfunction on convex domains.
result Obtains quantitative estimates for the Hessian of logu\log u.

Study confirms boundedness of certain singularities in log Fano geometry.

problem Boundedness of log Fano cone singularities and minimal log discrepancies.
method Analyzing local volumes and minimal log discrepancies of Kollár components.
result Boundedness of K-semistable log Fano cone singularities confirmed in dimension three.

Study improves sampling from non-log-concave distributions using Fisher information.

problem Sampling from non-log-concave distributions with high Fisher information guarantees.
method Proximal sampler with RGO implementation, leveraging log-concave sampling results.
result Improved complexity guarantee in relative Fisher information for non-log-concave sampling.

New algorithms improve convergence rates for non-log-concave sampling and log-partition estimation.

problem Efficiently sampling from non-log-concave distributions and estimating their log-partition function.
method Analysis of information-based complexity, study of polynomial-time sampling algorithms.
result Optimal rates for sampling and log-partition estimation sometimes exceed those for optimization.

Defines log Floer cohomology for symplectic surfaces with a degenerate part.

problem Extending Floer cohomology to degenerate symplectic structures.
method Definition of log Floer cohomology for oriented log symplectic surfaces.
result Log Floer cohomology is invariant under isotopies and isomorphic to log de Rham cohomology for a single Lagrangian.

Using stable log maps, we introduce log twisted differentials extending the notion of abelian differentials to the Deligne-Mumford boundary of stable curves. The moduli stack of log twisted differentials provides a compactification of the strata of abelian differentials. The open strata can have up to three connected c…

2016-10-17abs ↗pdf ↗

Constructs Kahler-Einstein metrics near isolated log canonical singularities.

problem Constructing metrics near singularities in complex geometry.
method Constructs Kahler-Einstein metrics with negative scalar curvature near isolated log canonical singularities.
result Metrics are complete near the singularity if the underlying space has complex dimension 2 or if the singularity is smoothable.

We study topological properties of log-symplectic structures and produce examples of compact manifolds with such structures. Notably we show that several symplectic manifolds do not admit log-symplectic structures and several log-symplectic manifolds do not admit symplectic structures, for example #m CP^2 # n bar(CP^2)…

2013-03-26abs ↗pdf ↗

We consider the problem of learning a general graph G=(V,E)G=(V,E) using edge-detecting queries, where the number of vertices V=n|V|=n is given to the learner. The information theoretic lower bound gives mlognm\log n for the number of queries, where m=Em=|E| is the number of edges. In case the number of edges mm is also given t…

2018-03-28abs ↗pdf ↗

New lower bounds for sampling from log-concave distributions in higher dimensions.

problem Proving lower bounds for sampling from log-concave distributions in higher dimensions.
method Multiscale construction inspired by geometric measure theory and reduction to block Krylov algorithms.
result Query lower bounds for sampling from log-concave distributions in higher dimensions are established.

We leverage a streaming architecture based on ELK, Spark and Hadoop in order to collect, store, and analyse database connection logs in near real-time. The proposed system investigates outliers using unsupervised learning; widely adopted clustering and classification algorithms for log data, highlighting the subtle var…

2018-12-01abs ↗pdf ↗

Dividing deep learning models for consistent anomaly detection in changing log data.

problem Anomaly detection methods fail when log data types change, leading to false negatives.
method Divide deep learning models based on log data correlation and extract correlations.
result Continues anomaly detection accuracy even when log data changes.

Log-symplectic structures are Poisson structures that are determined by a symplectic form with logarithmic singularities. We construct moduli spaces of curves with values in a log-symplectic manifold. Among the applications, we classify symplectically ruled log-symplectic 44 manifolds (both orientable and non-orientab…

2017-11-29abs ↗pdf ↗

Logsy detects anomalies in logs using a novel classification-based approach.

problem Anomaly detection in unstructured logs is challenging due to limited model generalization.
method Logsy learns log representations by distinguishing normal and anomaly logs using a classification-based approach with an attention-based encoder and hyperspherical loss function.
result Logsy improves anomaly detection performance by 0.25 in F1 score compared to previous methods.

The study finds effective lower bounds for spectra of random surfaces and bundles.

problem Determining the spectrum of Laplacian on random surfaces and bundles.
method Analysis of random covering surfaces and unitary bundles over finite-area non-compact hyperbolic surfaces.
result With high probability, the spectrum of random surfaces and bundles has no eigenvalues below a certain threshold.

The Links-Gould polynomial of alternating knots is shown to be log-concave and positive.

problem Verifying the positivity and log-concavity of the Links-Gould polynomial for alternating knots.
method Formulated a conjecture and verified it computationally for all 51.3 million knots with up to 19 crossings.
result All but 544 knots satisfy a stronger log-concavity condition.

This paper proves a curvature entropy inequality for non-symmetric convex bodies.

problem Proving a curvature entropy inequality for non-symmetric convex bodies.
method Demonstrated the log-Minkowski inequality of curvature entropy for general convex bodies in 2D.
result Equivalence of cone-volume measure uniqueness, log-Minkowski volume inequality, and curvature entropy inequality for general convex bodies in 2D.

Characterizes toroidal and semi-toric compactifications as log minimal models and applies to weak K-moduli.

problem Characterizing and applying toroidal and semi-toric compactifications to weak K-moduli.
method Characterizes toroidal and semi-toric compactifications as log minimal models and applies to weak K-moduli.
result Different proof of a theorem of Alexeev-Engel on weak K-moduli compactifications.

Log-symplectic structures are Poisson structures ππ on X2nX^{2n} for which nπ\bigwedge^n π vanishes transversally. By viewing them as symplectic forms in a Lie algebroid, the bb-tangent bundle, we use symplectic techniques to obtain existence results for log-symplectic structures on total spaces of fibration-like maps…

2016-06-01abs ↗pdf ↗

Motivated by the study of Fano type varieties we define a new class of log pairs that we call asymptotically log Fano varieties and strongly asymptotically log Fano varieties. We study their properties in dimension two under an additional assumption of log smoothness, and give a complete classification of two dimension…

2013-08-12abs ↗pdf ↗

The paper proves conditions for existence of constant scalar curvature Kähler metrics with cone singularities.

problem Existence of constant scalar curvature Kähler metrics with cone singularities.
method Log KK-polystability and GG-uniform log KK-stability are established.
result Uniform log KK-stability is achieved for normal varieties.

Böröczky, Lutwak, Yang and Zhang recently proved the log-Brunn-Minkowski inequality which is stronger than the classical Brunn-Minkowski inequality for two origin-symmetric convex bodies in the plane. This paper establishes the log-Brunn-Minkowski, log-Minkowski, LpL_p-Minkowski and LpL_p-Brunn-Minkowski inequalities f…

2018-10-13abs ↗pdf ↗

Counterexample disproves log canonical Beauville--Bogomolov decomposition.

problem Disproving the log canonical Beauville--Bogomolov decomposition.
method Constructing a specific log canonical, K-trivial variety with non-birational fibers.
result Provides a counterexample to the Beauville--Bogomolov decomposition in the log canonical setting.

Zigzag sampling algorithm efficiently samples from strongly log-concave distributions with low computational cost.

problem Sampling from strongly log-concave distributions efficiently and with low computational complexity.
method Zigzag sampling algorithm with warm start assumption, focusing on gradient evaluations.
result Achieves ε error in chi-square divergence with computational cost of O(κ²d^(1/2)(log(1/ε))^(3/2)) gradient evaluations.

A new VIS approach improves log-likelihood estimation in latent variable models.

problem Challenges in achieving high log-likelihood with VI for complex posterior distributions.
method Uses forward χ2χ^2 divergence to optimize proposal distribution for better log-likelihood estimation.
result Consistently outperforms state-of-the-art baselines in log-likelihood and parameter estimation.