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

Trend · papers per month

0.6%1.2%1.8%2.4% · Mar 199819922001200920172026
48 results for level-k thinking

We introduce Threatened Markov Decision Processes (TMDPs) as an extension of the classical Markov Decision Process framework for Reinforcement Learning (RL). TMDPs allow suporting a decision maker against potential opponents in a RL context. We also propose a level-k thinking scheme resulting in a novel learning approa…

2019-08-22abs ↗pdf ↗

In several reinforcement learning (RL) scenarios, mainly in security settings, there may be adversaries trying to interfere with the reward generating process. In this paper, we introduce Threatened Markov Decision Processes (TMDPs), which provide a framework to support a decision maker against a potential adversary in…

2018-09-05abs ↗pdf ↗

Look-ahead reasoning helps predict strategic user behavior on learning platforms.

problem Optimization criteria on learning platforms do not reflect users' priorities.
method Formalized level-k thinking and contrasted collective and selfish behavior.
result Coordination benefits users but does not offer higher-level reasoning advantages in the long run.

Study on Chern-Simons theory at generic levels, revealing universal resurgent structure.

problem Analyzing Chern-Simons theory at generic levels with small boundary holonomy.
method Examined resurgent structure of state integral models on knot complements with generic discrete level.
result Resurgent structure is universal, independent of the level kk.

Let G be a compact, simple, simply connected Lie group. A theorem of Freed-Hopkins-Teleman identifies the level k fusion ring R_k(G) of G with the twisted equivariant K-homology at level k+h, where h is the dual Coxeter number. In this paper, we review this result using the language of Dixmier-Douady bundles. We show t…

2007-07-26abs ↗pdf ↗

Human inertial thinking schemes can be formed through learning, which are then applied to quickly solve similar problems later. However, when problems are significantly different, inertial thinking generally presents the solutions that are definitely imperfect. In such cases, people will apply creative thinking, such a…

2018-03-01abs ↗pdf ↗

We consider the Witten-Reshetikhin-Turaev invariants or Chern-Simons partition function at or around roots of unity q=e2πi1Kq=e^{2πi \frac{1}{K}} with rational level K=rsK=\frac{r}{s} where rr and ss are coprime integers. From the exact expression for the G=SU(2)G=SU(2) Witten-Reshetikhin-Turaev invariants of Seifert manifolds at…

2019-06-28abs ↗pdf ↗

We construct modular categories from Hecke algebras at roots of unity. For a special choice of the framing parameter, we recover the Reshetikhin-Turaev invariants of closed 3-manifolds constructed from the quantum groups U_q sl(N) by Reshetikhin-Turaev and Turaev-Wenzl, and from skein theory by Yokota. We then discuss …

1998-03-24abs ↗pdf ↗

Let G be a compact, simple and simply connected Lie group and $\A$ be an equivariant Dixmier-Douady bundle over G. For any fixed level k, we can define a G-C*-algebra $C_{\A^{k+h}}(G)$ as all the continuous sections of the tensor power $\A^{k+h}$ vanishing at infinity. A deep theorem by Freed-Hopkins-Teleman showed tha…

2014-04-18abs ↗pdf ↗

CausalGame benchmarks LLM agents' causal thinking in games.

problem Evaluating causal thinking in AI Scientists with LLMs.
method Interactive games with 14 scenarios incorporating selection bias, measurement error, and hidden confounders.
result None of the 30 LLM agents demonstrated reliable causal thinking, with the best model achieving only 68.0% survival.

Develops Hamiltonian quantization for complex Chern-Simons theory at even level k.

problem Quantum holonomies and representation theory in complex Chern-Simons theory.
method Combinatorial quantization and operator algebra construction.
result Physical Hilbert space identified and Fenchel-Nielsen representation demonstrated.

We use the 3d-3d correspondence together with the DGG construction of theories Tn[M]T_n[M] labelled by 3-manifolds M to define a non-perturbative state-integral model for SL(n,C) Chern-Simons theory at any level k, based on ideal triangulations. The resulting partition functions generalize a widely studied k=1 state-integ…

2014-09-02abs ↗pdf ↗

Popular culture has contemplated societies of thinking machines for generations, envisioning futures from utopian to dystopian. These futures are, arguably, here now-we find ourselves at the doorstep of technology that can at least simulate the appearance of thinking, acting, and feeling. The real question is: now what…

2019-08-30abs ↗pdf ↗

A new reinforcement learning method for robots thinking and moving simultaneously.

problem Concurrent control in robotic systems where actions must be decided while the system is still evolving.
method Continuous-time Bellman equations, discretization aware of system delays, and architectural extension to deep reinforcement learning.
result The method successfully handles tasks requiring simultaneous decision-making and action execution.

Let G be a compact, simply connected Lie group. We develop a `quantization functor' from pre-quantized quasi-Hamiltonian G-spaces at level k to the fusion ring (Verlinde algebra) R_k(G). The quantization Q(M) is defined as a push-forward in twisted equivariant K-homology. It may be computed by a fixed point formula, si…

2010-08-06abs ↗pdf ↗

We extend the coherent state transform (CST) of Hall to the context of the moduli spaces of semistable holomorphic vector bundles with fixed determinant over elliptic curves. We show that by applying the CST to appropriate distributions, we obtain the space of level k, rank n and genus one non-abelian theta functions w…

2002-06-25abs ↗pdf ↗

Model learns brevity by exposing to easy problems, improving efficiency without explicit length penalties.

problem Excessive verbosity in step-by-step reasoning models trained with RLVR.
method Retaining and up-weighting moderately easy problems as implicit length regularizers.
result Model generates solutions that are, on average, nearly twice as short without explicit length penalties.

Thinking LLMs struggle with stock prediction, especially as data complexity increases.

problem Evaluating the performance of 'thinking' LLMs in stock prediction, especially under varying levels of cross-sectional complexity.
method Rolling 48m/1m walk-forward evaluation, comparing direct LLMs, TLLMs, and classical learners on cross-sectional ranking loss, MSE, and backtests with transaction costs.
result TLLMs' ranking quality deteriorates as cross-sectional complexity grows, while direct LLMs remain stable.

DGP learns speech recognition by modeling complex relationships between utterances.

problem Modeling complex relationships in speech recognition without relational data.
method Bayesian nonparametric deep learning method (DGP) that generates infinite probabilistic graphs.
result DGP successfully infers relationships among utterances without relational data during training.

Recent progress in artificial intelligence (AI) has renewed interest in building systems that learn and think like people. Many advances have come from using deep neural networks trained end-to-end in tasks such as object recognition, video games, and board games, achieving performance that equals or even beats humans …

2016-04-01abs ↗pdf ↗

Simple model outperforms neural networks on language understanding tasks.

problem Neural networks struggle with creating novel expressions from familiar ones.
method Attention-inspired modification of a baseline model, focusing on sequential thinking and acting.
result Simple model achieves good performance on gSCAN tasks, validating the benchmark.

The success of deep neural networks has inspired many to wonder whether other learners could benefit from deep, layered architectures. We present a general framework called forward thinking for deep learning that generalizes the architectural flexibility and sophistication of deep neural networks while also allowing fo…

2017-05-20abs ↗pdf ↗

We give a geometric description of the fusion rules of the affine Lie algebra su(2)_k at a positive integer level k in terms of the k-th power of the basic gerbe over the Lie group SU(2). The gerbe can be trivialised over conjugacy classes corresponding to dominant weights of su(2)_k via a 1-isomorphism. The fusion-rul…

2009-09-01abs ↗pdf ↗

The coefficient of the logarithmic term in the entropy on even spheres is re-computed by the local technique of integrating the finite temperature energy density up to the horizon on static d--dimensional de Sitter space and thence finding the entropy by thermodynamics. Numeric evaluation yields the known answer i.e. (…

2010-09-20abs ↗pdf ↗

Breiman's paper sparked debate on the future of statistics and machine learning.

problem The tension between traditional statistical modeling and model-free machine learning approaches.
method Discussion of the implications of machine learning's success and the need for new inferential approaches.
result The importance of understanding 'why' and 'if' questions in machine learning is now recognized.

Chern-Simons and Reshetikhin-Turaev theories are shown equivalent for U(1) gauge group.

problem Equivalence between U(1)U(1) Chern-Simons and Reshetikhin-Turaev TQFTs.
method Proof of natural isomorphism between theories for finite quadratic modules.
result Extended (2+1)(2+1)-dimensional TQFTs are naturally isomorphic.

Research suggests using deep learning for better recommendation systems.

problem Recommender systems rely on proxies for A/B testing, leading to random success.
method Advocates for using deep learning to improve recommendation performance.
result Deep learning can potentially optimize reward in recommendation systems.

In this paper we study n-composition series of affine manifolds. One composition series are classified using gerbe theory. It is natural to think that n-composition series must be classified using n-gerbe theory. In the last section of this, we propose a notion of abelian n-gerbe theory

2001-05-24abs ↗pdf ↗

We introduce Deep Reasoning Networks (DRNets), an end-to-end framework that combines deep learning with reasoning for solving complex tasks, typically in an unsupervised or weakly-supervised setting. DRNets exploit problem structure and prior knowledge by tightly combining logic and constraint reasoning with stochastic…

2019-06-03abs ↗pdf ↗

The paper converts metric bounds to distance function Hölder bounds and proves compactness theorems.

problem Proving geometric stability results with scalar curvature bounds.
method Transforming LpL^p bounds to Hölder bounds for distance functions.
result Compactness theorems and convergence guarantees for Riemannian manifolds.

We argue that the present crisis and stalling economy continuing since 2007 are rooted in the delusionary belief in policies based on a "perpetual money machine" type of thinking. We document strong evidence that, since the early 1980s, consumption has been increasingly funded by smaller savings, booming financial prof…

2012-12-12abs ↗pdf ↗