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

17345168 · May 202619922001200920172026
48 results for gentle algebra

Mutation graph of support τ-tilting modules over skew-gentle algebras is connected.

problem Understanding the structure of support τ-tilting modules over skew-gentle algebras.
method Introducing mutation of maximal rigid objects and using exchange triangles to define mutations of support τ-tilting modules.
result The mutation graph of support τ-tilting modules over a skew-gentle algebra is connected.

Classifies objects in graded skew-gentle algebras using geometric models.

problem Classifying indecomposable objects in the derived category of graded skew-gentle algebras.
method Introduces new geometric models (punctured marked surfaces and binary surfaces) to classify objects.
result Integrates geometric models to classify objects in the derived category of graded skew-gentle algebras.

Quantum states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

We study the cluster categories arising from marked surfaces (with punctures and non-empty boundaries). By constructing skewed-gentle algebras, we show that there is a bijection between tagged curves and string objects. Applications include interpreting dimensions of Ext1\operatorname{Ext}^1 as intersection numbers of ta…

2013-10-31abs ↗pdf ↗

Study braid group actions on exceptional sequences using branched coverings.

problem Transitivity of braid group action on full exceptional sequences.
method Relate exceptional sequences to branched coverings, apply Birman--Hilden theory.
result Counterexamples to Bondal--Polishchuk conjecture on braid group transitivity.

This paper is a gentle introduction to some recent results involving the theory of gerbes over orbifolds for topologists, geometers and physicists. We introduce gerbes on manifolds, orbifolds, the Dixmier-Douady class, Beilinson-Deligne orbifold cohomology, Cheeger-Simons orbifold cohomology and string connections.

2004-02-19abs ↗pdf ↗

Introduces new gradient-based methods for machine learning problems.

problem New challenges in machine learning due to decision-making and multi-agent problems.
method Gradient-based optimization and variational inequalities.
result Shifts focus from pattern recognition to decision-making and multi-agent problems.

This post introduces model calibration and evaluation measures, highlighting issues with a common measure.

problem Ensuring model confidence accurately reflects true outcomes.
method Explains common calibration definition, ECE, and its drawbacks.
result New evaluation measures needed for comprehensive model calibration.

Statistical learning theory provides the theoretical basis for many of today's machine learning algorithms. In this article we attempt to give a gentle, non-technical overview over the key ideas and insights of statistical learning theory. We target at a broad audience, not necessarily machine learning researchers. Thi…

2008-10-27abs ↗pdf ↗

Blockchain is a distributed database that keeps a chronologically-growing list (chain) of records (blocks) secure from tampering and revision. While computerisation has changed the nature of a ledger from clay tables in the old days to digital records in modern days, blockchain technology is the first true innovation i…

2016-12-06abs ↗pdf ↗

Nonnegative Matrix Factorization (NMF) was first introduced as a low-rank matrix approximation technique, and has enjoyed a wide area of applications. Although NMF does not seem related to the clustering problem at first, it was shown that they are closely linked. In this report, we provide a gentle introduction to clu…

2015-07-12abs ↗pdf ↗

Modeling structure in complex networks using Bayesian non-parametrics makes it possible to specify flexible model structures and infer the adequate model complexity from the observed data. This paper provides a gentle introduction to non-parametric Bayesian modeling of complex networks: Using an infinite mixture model …

2013-12-20abs ↗pdf ↗

Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that arise in quantum physics and random matrix theory. In contrast to traditional structured models like Markov random fields, which become intractable and hard to approximate in the presence of negative correlations, DPPs offer efficie…

2012-07-25abs ↗pdf ↗

Geometric formulation of 4D supergravity for mathematicians.

problem Geometric characterization of U-duality group in 4D supergravity.
method Geometric formulation based on Riemannian submersion and symplectic vector bundle.
result Characterization of electromagnetic duality transformations as a short exact sequence of automorphism groups.

This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical mechanics. On the way we prove various (old and new) facts about knots. We rela…

2006-08-07abs ↗pdf ↗

State-of-the-art solutions in the areas of "Language Modelling & Generating Text", "Speech Recognition", "Generating Image Descriptions" or "Video Tagging" have been using Recurrent Neural Networks as the foundation for their approaches. Understanding the underlying concepts is therefore of tremendous importance if we …

2019-11-23abs ↗pdf ↗

The Ma-Trudinger-Wang curvature --- or cross-curvature --- is an object arising in the regularity theory of optimal transportation. If the transportation cost is derived from a Hamiltonian action, we show its cross-curvature can be expressed in terms of the associated Jacobi fields. Using this expression, we show the l…

2009-08-31abs ↗pdf ↗

New neural network criterion connects RH to minimization problem.

problem Riemann Hypothesis (RH) about zeta function zeros.
method Revisits and extends Nyman-Beurling criterion linking RH to neural networks.
result Establishes connection between RH and minimization problem involving neural networks.

The first part of this text is a gentle exposition of some basic constructions and results in the extended prequantum theory of Chern-Simons-type gauge field theories. We explain in some detail how the action functional of ordinary 3d Chern-Simons theory is naturally localized ("extended", "multi-tiered") to a map on t…

2013-01-11abs ↗pdf ↗

This book provides a gentle introduction to the study of arithmetic subgroups of semisimple Lie groups. This means that the goal is to understand the group SL(n,Z) and certain of its subgroups. Among the major results discussed in the later chapters are the Mostow Rigidity Theorem, the Margulis Superrigidity Theorem, R…

2001-06-09abs ↗pdf ↗

The adaptive processing of graph data is a long-standing research topic which has been lately consolidated as a theme of major interest in the deep learning community. The snap increase in the amount and breadth of related research has come at the price of little systematization of knowledge and attention to earlier li…

2019-12-29abs ↗pdf ↗

This monograph presents the main complexity theorems in convex optimization and their corresponding algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural optimization and stochastic optimization. Our presentation of black-box optimizati…

2014-05-20abs ↗pdf ↗

A novel approach models rating transitions using Lie groups and Deep Learning.

problem Modeling rating transitions with geometric properties and stochastic processes.
method Introducing Itô-SDEs on Lie groups, using TimeGAN for calibration, and examining rating matrix properties.
result The geometric approach using Lie groups and Deep Learning generates a good fit for rating transitions.

Quality-Diversity algorithms explore multiple high-performing solutions in a search space.

problem Finding multiple high-performing solutions in complex optimization problems.
method Evolutionary computation approach focusing on behavioral space and holistic solution distribution.
result Quality-Diversity algorithms provide a comprehensive view of high-performing solutions in a search space.

New approach to deeper graph neural networks to avoid performance degradation.

problem Performance degradation of graph neural networks when going deeper.
method Decoupling representation transformation and propagation in graph convolution operations.
result Deeper graph neural networks can be used to learn graph node representations from larger receptive fields.

This paper introduces compositional data analysis for financial ratios, improving industry-level analysis.

problem Statistical issues with standard financial ratios at industry level.
method Compositional data analysis techniques for financial ratios.
result Improved analysis of financial ratios using compositional data methods.

Conformal prediction provides distribution-free uncertainty quantification for black-box models.

problem Uncertainty quantification for high-risk machine learning applications.
method Conformal prediction creates valid uncertainty sets without distributional assumptions.
result Sets contain the ground truth with a specified probability, e.g., 90%.

New algebraic structure derived from Hopf algebra and Drinfel'd twist.

problem Developing a new algebraic structure from existing mathematical concepts.
method Extending LL_\infty-algebra to a Hopf algebra, twisting with Drinfel'd twist, and identifying Hopf morphisms and braided morphisms.
result Braided LL_\infty-algebra is derived from the process.

New statistical guarantee improves conformal predictors for small datasets.

problem Uncertainty quantification for small datasets in surrogate models.
method Proposed a new statistical guarantee for conformal predictors, converging to standard CP for large datasets.
result The new guarantee offers relevant information about coverage for small data sizes, improving applicability.