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

Trend · papers per month

82163245326 · Jun 202019922001200920172026
48 results for rewriting system

Zipper logic is a graph rewrite system, consisting in only local rewrites on a class of zipper graphs. Connections with the chemlambda artificial chemistry and with knot diagrammatics based computation are explored in the article.

2014-05-20abs ↗pdf ↗

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical fini…

2013-07-18abs ↗pdf ↗

Deep Neural Networks (DNNs) are finding important applications in safety-critical systems such as Autonomous Vehicles (AVs), where perceiving the environment correctly and robustly is necessary for safe operation. Raising unique challenges for assurance due to their black-box nature, DNNs pose a fundamental problem for…

2020-01-07abs ↗pdf ↗

We design and conduct a simple experiment to study whether neural networks can perform several steps of approximate reasoning in a fixed dimensional latent space. The set of rewrites (i.e. transformations) that can be successfully performed on a statement represents essential semantic features of the statement. We can …

2019-09-26abs ↗pdf ↗

Serenity optimizes neural network execution for edge devices by scheduling with optimal memory footprint.

problem Order of nodes in irregular neural networks affects memory footprint, complicating execution under resource constraints.
method Memory-aware compiler using dynamic programming and graph rewriting to find optimal schedules.
result Achieves optimal peak memory and further improves it with graph rewriting, reducing memory usage by 1.68x-1.86x compared to TensorFlow Lite.

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to include nilpotent groups, many relatively hyperbolic groups including geometrically…

2007-06-20abs ↗pdf ↗

This is a semi--expository update and rewrite of my 1974 AMS AMS Memoir describing Plancherel formulae and partial Dolbeault cohomology realizations for standard tempered representations for general real reductive Lie groups. Even after so many years, much of that Memoir is up to date, but of course there have been a n…

2017-08-01abs ↗pdf ↗

This is the author's Master's thesis written under the supervision of Dr. Gregor Weingart at the National Autonomous University of Mexico. The purpose of this study is to rewrite differential supergeometry in terms of classical differential geometry. This rewriting from "first principles" has two main motivations: 1 av…

2014-10-29abs ↗pdf ↗

Many interesting geometric structures can be described as regular infinitesimal flag structures, which occur as the underlying structures of parabolic geometries. Among these structures we have for instance conformal structures, contact structures, certain types of generic distributions and partially integrable almost …

2010-12-08abs ↗pdf ↗

In this paper, we introduce a system called GamePad that can be used to explore the application of machine learning methods to theorem proving in the Coq proof assistant. Interactive theorem provers such as Coq enable users to construct machine-checkable proofs in a step-by-step manner. Hence, they provide an opportuni…

2018-06-02abs ↗pdf ↗

Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…

2018-09-30abs ↗pdf ↗

NIFTy.re accelerates imaging models and expands Gaussian processes and variational inference.

problem Slow performance and limited inference strategies in NIFTy.
method Rewritten NIFTy with new modeling principles, inference strategies, and JAX integration.
result Dramatic acceleration of models and new inference capabilities.

Rewriting history improves RL algorithms for solving multiple tasks.

problem Improving sample efficiency in multi-task reinforcement learning.
method Introducing hindsight relabeling as inverse RL to generalize goal-relabeling techniques.
result Relabeling data using inverse RL accelerates learning in multi-task settings.

We give definition of a holonomy flag in subRiemannian geometry --- a generalization of a Riemannian holonomy algebra --- and calculate it for the 3D subRiemannian Lie groups. We rewrite and give new interpretation for the Codazzi equations for the (2,3)(2,3)-distributions on the SU(2)SU(2) and the Heisenberg group.

2015-12-07abs ↗pdf ↗

Moving boundary problems allow to model systems with phase transition at an inner boundary. Driven by problems in economics and finance, in particular modeling of limit order books, we consider a stochastic and non-linear extension of the classical Stefan-problem in one space dimension, where the paths of the moving in…

2016-01-15abs ↗pdf ↗

In this paper, a type of integrable evolution equation--the generalized Landau-Lifshitz equation into SnS^n is considered. We deal with this equation from a geometric point of view by rewriting it in a geometric form. Through the geometric energy method, we show the global well-posedness of the corresponding Cauchy pro…

2010-09-13abs ↗pdf ↗

Unified approach for multicalibration in weakly supervised learning.

problem Existing multicalibration methods require clean input-label pairs, which are unavailable in weakly supervised learning.
method Developed estimators and post-hoc correction methods for multicalibration under weak supervision.
result Unified framework for estimating and correcting multicalibration under weak supervision with finite-sample guarantees.

In this paper, we give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This definition can be viewed as a blueprint for the construction of an actual physical quantum system. Moreover, this definition of a quantum knot system is intended to represent the "quantu…

2008-05-03abs ↗pdf ↗

New method estimates Schrödinger bridge potentials via empirical risk minimization.

problem Estimating Schrödinger bridge potentials from samples.
method Rewriting Schrödinger system as a fixed-point equation and estimating the potential via empirical risk minimization.
result Uniform concentration of empirical risk around population counterpart under sub-Gaussian assumptions.

While accelerators such as GPUs have limited memory, deep neural networks are becoming larger and will not fit with the memory limitation of accelerators for training. We propose an approach to tackle this problem by rewriting the computational graph of a neural network, in which swap-out and swap-in operations are ins…

2018-07-05abs ↗pdf ↗

We consider normal almost contact structures on a Riemannian manifold and, through their associated sections of an ad-hoc twistor bundle, study their harmonicity, as sections or as maps. We rewrite these harmonicity equations in terms of the Riemann curvature tensor and find conditions relating the harmonicity of the a…

2011-09-09abs ↗pdf ↗

We prove an existence result for the deformed Hermitian Yang-Mills equation for the full admissible range of the phase parameter, i.e., θ^(π2,3π2)\hatθ \in (\fracπ{2},\frac{3π}{2}), on compact complex three-folds conditioned on a necessary subsolution condition. Our proof hinges on a delicate analysis of a new continuity path …

2019-10-04abs ↗pdf ↗

We revisit the cohomological index theorem for elliptic elements in the universal enveloping algebra of a Lie groupoid previously proved by the authors. We prove a Thom isomorphism for Lie algebroids which enables us to rewrite the "topological side" of the index theorem. This results in index formulae for Lie groupoid…

2013-08-01abs ↗pdf ↗

In this note we study conformal Ricci flow introduced by Arthur Fischer. We use DeTurck's trick to rewrite conformal Ricci flow as a strong parabolic-elliptic partial differential equations. Then we prove short time existences for conformal Ricci flow on compact manifolds as well as on asymptotically flat manifolds. We…

2011-09-25abs ↗pdf ↗

Smooth fractal trees via analytic generators, preserving combinatorial and geometric properties.

problem Constructing smooth fractal trees from discrete models.
method Using analytic generator fields to integrate smooth vector fields in an internal state space, generating geometric curves as projections of generator trajectories.
result Analytic generators can represent any discrete tree specification and preserve the asymptotic limit geometry.

Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler characteristics of these complexes are coefficients of the Jones polynomial of the link.…

2002-02-20abs ↗pdf ↗

We reformulate ten-dimensional type II supergravity as a generalised geometrical analogue of Einstein gravity, defined by an O(9,1)×O(1,9)O(10,10)×R+O(9,1)\times O(1,9)\subset O(10,10)\times\mathbb{R}^+ structure on the generalised tangent space. Using the notion of generalised connection and torsion, we introduce the analogue of the Levi-C…

2011-07-08abs ↗pdf ↗

We consider the Dirac equation in flat Minkowski 3-space and rewrite it as the Maxwell equation in Minkowski 4-space with torsion. The torsion tensor is defined as the dual of the electromagnetic vector potential. Our model clearly distinguishes the electron and the positron without resorting to "negative frequencies":…

2000-06-17abs ↗pdf ↗

Study harmonicity of normal almost contact structures on Riemannian manifolds.

problem Understanding harmonicity of normal almost contact structures.
method Analyzing harmonicity through associated sections of a twistor bundle and rewriting equations in terms of curvature tensor.
result Conditions relating harmonicity of almost contact metric and almost complex structures.

In this paper we examine the process involved in the design and implementation of a port-graph model to be used for the analysis of an agent-based rational negligence model. Rational negligence describes the phenomenon that occurred during the financial crisis of 2008 whereby investors chose to trade asset-backed secur…

2019-02-06abs ↗pdf ↗