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.
Bayesian RL enhances LLMs to reflectively explore and correct errors.
For technology (like serious games) that aims to deliver interactive learning, it is important to address relevant mental experiences such as reflective thinking during problem solving. To facilitate research in this direction, we present the weDraw-1 Movement Dataset of body movement sensor data and reflective thinkin…
Proposes r2SGLD for efficient constrained exploration in non-convex learning.
Survey explores interactions between four conformal dynamics branches.
The paper explores reflection principles for lightlike line segments on maximal surfaces.
Paper develops a new method for optimal stopping in American options.
New algorithm enhances generative modeling for bounded domains.
In this paper we sketch some reflections on the pitfalls and inconsistencies of the research program - currently dominant among the profession - aimed at providing microfoundations to macroeconomics along a Walrasian perspective. We argue that such a methodological approach constitutes an unsatisfactory answer to a wel…
Copula models have become popular in different applications, including modeling shocks, in view of their ability to describe better the dependence concepts in stochastic systems. The class of maxmin copulas was recently introduced by Omladič and Ružić. It extends the well known classes of Marshall-Olkin and Marshall co…
Given any smooth plane curve α(s)representing a mirror that reflects light the usual way and any radiant light source at a point in the plane, the reflected light will produce a caustic envelope. For such an envelope, we show that there is an associated curve \b{eta}(s) and a family of circles C(s) that roll on \b{eta}…
In this paper, we first establish the reflected backward stochastic difference equations with finite state (FS-RBSDEs for short). Then we explore the Existence and Uniqueness Theorem as well as the Comparison Theorem by "one step" method. The connections between FS-RBSDEs and optimal stopping time problems are investig…
We generalize arc coordinates for maximal representations on a pair of pants.
New -Coverage objective simplifies exploration in reinforcement learning.
Intrinsically motivated goal exploration processes enable agents to autonomously sample goals to explore efficiently complex environments with high-dimensional continuous actions. They have been applied successfully to real world robots to discover repertoires of policies producing a wide diversity of effects. Often th…
Study on Morse homology for reflection actions on manifolds.
Exploration strategy design is one of the challenging problems in reinforcement learning~(RL), especially when the environment contains a large state space or sparse rewards. During exploration, the agent tries to discover novel areas or high reward~(quality) areas. In most existing methods, the novelty and quality in …
The paper explores rigidity and proximality in dynamical systems, proving new results about -algebras.
Machine learning (ML) is increasingly deployed in real world contexts, supplying actionable insights and forming the basis of automated decision-making systems. While issues resulting from biases pre-existing in training data have been at the center of the fairness debate, these systems are also affected by technical a…
The paper connects machine learning interpretability with learning theory.
PRISM integrates diverse rewards in MORL, improving sample efficiency and Pareto coverage.
Study of multidimensional control problems with reflection controls.
New algorithm improves graph-based active learning by identifying unexplored regions.
The category was first defined and explored by Sam-Snowden. Here, we develop more of the machinery of -modules and find numerous examples to apply it to, extending the work of Church-Ellenberg-Farb and Wilson. In particular we develop a notion of character polynomials for -…
New method uses hindsight to make exploration robust in stochastic environments.
Transfer learning borrows knowledge from a source domain to facilitate learning in a target domain. Two primary issues to be addressed in transfer learning are what and how to transfer. For a pair of domains, adopting different transfer learning algorithms results in different knowledge transferred between them. To dis…
Optimal Transport has recently gained interest in machine learning for applications ranging from domain adaptation, sentence similarities to deep learning. Yet, its ability to capture frequently occurring structure beyond the "ground metric" is limited. In this work, we develop a nonlinear generalization of (discrete) …
A discrete subgroup of the group of isometries of the hyperbolic space is called reflective if up to a finite index it is generated by reflections in hyperplanes. The main result of this paper is a complete classification of the reflective (and quasi-reflective) subgroups among the Bianchi groups and their extensions.
This paper gives an alternate definition of the Affine Index Polynomial (called the Wriggle Polynomial) using virtual linking numbers and explores applications of this polynomial. In particular, it proves the Cosmetic Crossing Change Conjecture for odd virtual knots and pure virtual knots. It also demonstrates that the…
New method produces reflections with nonseparating fixed points.
In this study, we analyze the aerospace stocks prices in order to characterize the sector behavior. The data analyzed cover the period from January 1987 to April 1999. We present a new index for the aerospace sector and we investigate the statistical characteristics of this index. Our results show that this index is we…
One reflection suffices for orthogonal weights, reducing GPU usage.
Study shows how to motivate AI agents like humans through learning from demonstrations.
The paper explores a generalized notion of transversality in harmonic analysis.
Minimal surfaces in 3-sphere created by reflections from polygons, with new examples based on pentagons.
Paper proves CLTs for Q-learning with asynchronous updates.
Study thin hyperbolic reflection groups and their properties.
We prove that the quotients of the group algebra of the braid group on 3 strands by a generic quartic and quintic relation respectively, have finite rank. This is a special case of a conjecture by Broué, Malle and Rouquier for the generic Hecke algebra of an arbitrary complex reflection group. Exploring the consequence…
Minimal surfaces reflect across spheres, proving annulus uniqueness.
Hausdorff reflection keeps space shape intact.
Study extends reflective submanifold theory to compact homogeneous spaces.
New reflection groups derived from torus knots with finite meridians.
Study improves chiral photonic metasurface design using neural networks and genetic algorithms.
Study values and optimizes forestry leases under risk and uncertainty.
This study compares SPX and VIX options and quantifies their relationship.
Variational inference lies at the core of many state-of-the-art algorithms. To improve the approximation of the posterior beyond parametric families, it was proposed to include MCMC steps into the variational lower bound. In this work we explore this idea using steps of the Hamiltonian Monte Carlo (HMC) algorithm, an e…
FinReflectKG - EvalBench benchmarks financial KG extraction from SEC 10-K filings.
The abstract explores connections between reinforcement learning, scaling, and diffusion.
A hyperbolic lattice is called \textit{-reflective} if the subgroup of its automorphism group generated by all - and -reflections is of finite index. The main result of this article is a complete classification of -reflective maximal anisotropic lattices of rank .