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

count % of corpus

7 results for “E-polynomials”

Representation varieties of twisted Hopf linksmath.GT

Study representation varieties of twisted Hopf links using combinatorial and Hodge theory.

problem Representation theory of Hopf link complements with n twists.

method Combinatorial problem and equivariant Hodge theory.

result Close formulas for E-polynomials of representation and character varieties for ranks 2 and 3.

representation varieties Hopf links SL_r(C)E-polynomials combinatorial

2022-02-14abs ↗pdf ↗

Metallic Structures on Differentiable Manifoldsmath.DG

In this paper, we study metallic structures, i.e. polynomial structures with the structure polynomial $Q\left( J\right) =J^{2}-aJ-bI$ on manifolds using the metallic ratio, which is a generalization of the Golden proportion. We investigate for integrability and parallelism conditions of metallic structures. Also, we gi…

2018-07-11abs ↗pdf ↗

Character varieties of torus linksmath.GT

Study the geometry of torus link character varieties, finding unexpected relations.

problem Understanding the geometry of torus link character varieties.

method Developed an intrinsic stratification to relate the geometry with torus knots, computed E-polynomial for SL2(C) and SL3(C).

result Unexpected relation with the number of strands of the link.

torus links character varieties moduli spaces algebraic groups stratification

2024-02-19abs ↗pdf ↗

Subsampled Ensemble Can Improve Generalization Tail Exponentiallymath.OC

New ensemble method improves model stability exponentially.

problem Improving model stability for discontinuous base learners.

method Selecting the most frequently generated model from subsamples.

result Exponentially decaying tails for excess risk.

ensemble learning model stability subsampled ensembling excess risk tail decay

2024-05-23abs ↗pdf ↗

Improved Sleeping Bandits with Stochastic Actions Sets and Adversarial Rewardscs.LG

New algorithm reduces sleeping bandits' regret to O(sqrt(T)).

problem Improving sleeping bandits with stochastic actions and adversarial rewards.

method Inspired by EXP3, new algorithm with

O(\sqrt{T})

regret.

result Achieves

O(\sqrt{T})

regret, improving over existing

O(T^{2/3})

sleeping bandits EXP3 regret minimization stochastic actions adversarial rewards

2020-04-14abs ↗pdf ↗

A Note on Non-Negative

L_1

-Approximating Polynomialsstat.ML

Non-negative $L_1$ -approximating polynomials for Gaussian distributions are proven for certain classes of sets.

problem Existence of non-negative

L_1

-approximating polynomials for Gaussian distributions.

method Proving the existence of degree-

k

non-negative polynomials that approximate indicator functions of sets with Gaussian surface area in

L_1

-norm.

result Proves the existence of non-negative

L_1

-approximating polynomials for certain classes of sets with Gaussian surface area.

non-negative polynomials Gaussian distributions L1 approximation Gaussian surface area indicator functions

2026-05-08abs ↗pdf ↗

Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methodscs.LG

New framework analyzes effectiveness of neural network-based combinatorial problem solvers.

problem Analyzing neural network-based methods for combinatorial optimization problems.

method Introducing a theoretical framework to assess the effectiveness of solution-samplers using policy-gradient methods.

result Positive theoretical answer to the existence of expressive, tractable, and benign optimization landscapes for combinatorial problems.

combinatorial optimization neural networks policy-gradient methods gradient descent vanishing gradients

2023-10-08abs ↗pdf ↗