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

86173259345 · Jun 202019922001200920172026
48 results for local context

Global watermark for diffusion language models decouples detection from local contexts.

problem Watermarking in diffusion language models is challenging due to joint sampling of distributions over many unresolved positions.
method Proposes a global vector-valued sketch representation to control watermarking in masked diffusion language models.
result The method decouples detection from local contexts, resulting in an order-agnostic statistic and robustness.

NERS improves RL by sampling diverse transitions considering local and global contexts.

problem Sampling biases in experience replay lead to redundant transitions.
method Neural Experience Replay Sampler (NERS) that considers both local and global contexts.
result NERS significantly improves RL performance by sampling diverse and meaningful transitions.

Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…

2018-12-12abs ↗pdf ↗

Local differential privacy (LDP) is a strong notion of privacy for individual users that often comes at the expense of a significant drop in utility. The classical definition of LDP assumes that all elements in the data domain are equally sensitive. However, in many applications, some symbols are more sensitive than ot…

2019-10-31abs ↗pdf ↗

We extend Dupire's formula for stochastic interest rates and local volatility.

problem Deriving formulas for stochastic interest rates and local volatility.
method Generalizations of Dupire's formula for stochastic drift and local volatility.
result Validated the limits of the generalized Dupire formulae for specific cases.

We study the pricing and hedging of derivatives in incomplete financial markets by considering the local risk-minimization method in the context of the benchmark approach, which will be called benchmarked local risk-minimization. We show that the proposed benchmarked local risk-minimization allows to handle under extre…

2012-10-08abs ↗pdf ↗

Method discovers local independence in systems with continuous variables.

problem Applying Context-Specific Independence (CSI) to continuous variables is impractical.
method Neural contextual decomposition (NCD) learns partition of joint outcome space.
result NCD successfully discovers local independence in synthetic and real-world systems.

OCEAN infers online task identities from context variables.

problem Online task inference for compositional tasks with context adaptation.
method Variational inference framework OCEAN models global and local context variables in a joint latent space.
result OCEAN provides more effective task inference with sequential context adaptation.

We examine the local geometry of affine surfaces which are locally symmetric. There are 6 non-isomorphic local geometries. We realize these examples as Type A, Type B, and Type C geometries using a result of Opozda and classify the relevant geometries up to linear isomorphism. We examine the geodesic structures in this…

2017-06-15abs ↗pdf ↗

We prove an Atiyah-Bott-Berline-Vergne type localization formula for Killing foliations in the context of equivariant basic cohomology. As an application, we localize some Chern-Simons type invariants, for example the volume of Sasakian manifolds and secondary characteristic classes of Riemannian foliations, to the uni…

2015-08-31abs ↗pdf ↗

TL-ANDI distills context from source data to improve transfer learning for TFMs.

problem Limited transfer learning due to context-size constraints and distribution shifts.
method TL-ANDI uses posterior-aware distillation to construct a compact source context and locally distills labels.
result Improves transfer performance by addressing context-size and distribution shifts.

The Riemannian Penrose inequality is a remarkable geometric inequality between the ADM mass of an asymptotically flat manifold with non-negative scalar curvature and the area of its outermost minimal surface. A version of the Riemannian Penrose inequality has also been established for the Einstein-Maxwell equations, wh…

2020-02-11abs ↗pdf ↗

The notion of local subgroupoid as a generalisation of a local equivalence relation was defined in a previous paper by the first two authors. Here we use the notion of star path connectivity for a Lie groupoid to give an important new class of examples, generalising the local equivalence relation of a foliation, and de…

2000-08-22abs ↗pdf ↗

Direct contextual policy search methods learn to improve policy parameters and simultaneously generalize these parameters to different context or task variables. However, learning from high-dimensional context variables, such as camera images, is still a prominent problem in many real-world tasks. A naive application o…

2016-11-10abs ↗pdf ↗

Scarce data is a major challenge to scaling robot learning to truly complex tasks, as we need to generalize locally learned policies over different "contexts". Bayesian optimization approaches to contextual policy search (CPS) offer data-efficient policy learning that generalize over a context space. We propose to impr…

2016-12-06abs ↗pdf ↗

A method for learning a context latent vector to improve generalization in model-based RL.

problem Learning a global dynamics model that can generalize across different dynamics.
method Decomposes learning a global dynamics model into two stages: learning a context latent vector and predicting next states.
result Achieves superior generalization across various simulated robotics and control tasks.

Scarce data is a major challenge to scaling robot learning to truly complex tasks, as we need to generalize locally learned policies over different task contexts. Contextual policy search offers data-efficient learning and generalization by explicitly conditioning the policy on a parametric context space. In this paper…

2019-04-26abs ↗pdf ↗

We propose a means by which some categorifications can be evaluated at a root of unity. This is implemented using a suitable localization in the context of prior work by the authors on categorification of the Jones-Wenzl projectors. Within this construction we define objects, invariant under handle slides, which decate…

2011-10-10abs ↗pdf ↗

In the algebraic context, we show that null Osserman, spacelike Osserman, and timelike Osserman are equivalent conditions for a model of signature (2,2). We also classify the null Jordan Osserman models of signature (2,2). In the geometric context, we show that a pseudo-Riemannian manifold of signature (2,2) is null Jo…

2008-04-02abs ↗pdf ↗

New method tracks significant shifts in nonparametric bandits.

problem Tracking significant changes in nonparametric contextual bandits.
method Proposed a notion of 'experienced significant shifts' to adapt to minimax rate without knowledge of change parameters.
result Experienced significant shifts count fewer changes than traditional metrics, leading to an adaptive algorithm.

We show that an infinite dimensional Lie group in Milnor's sense has the strong Trotter property if it is locally μμ-convex. This is a continuity condition imposed on the Lie group multiplication that generalizes the triangle inequality for locally convex vector spaces, and is equivalent to C0C^0-continuity of the evo…

2018-02-24abs ↗pdf ↗

The paper analyzes heat trace asymptotics for de Rham and Dolbeault complexes in both real and complex settings.

problem Examining heat trace asymptotics for de Rham and Dolbeault complexes in different geometric settings.
method Analyzing the derived heat trace asymptotics for generalized Witten perturbations in both real and complex settings.
result The integral of the local density for the derived heat trace asymptotics is related to the Euler characteristic and characteristic numbers of the tangent and twisting vector bundles.

We investigate the local contribution of the braid monodromy factorization in the context of the links obtained by the closure of these braids. We consider plane curves which are arrangements of lines and conics as well as some algebraic surfaces, where some of the former occur as local configurations in degenerated an…

2012-12-10abs ↗pdf ↗

We seek to automate the design of molecules based on specific chemical properties. Our primary contributions are a simpler method for generating SMILES strings guaranteed to be chemically valid, using a combination of a new context-free grammar for SMILES and additional masking logic; and casting the molecular property…

2018-11-27abs ↗pdf ↗

Deep models learn to parse complex language structures from local data patterns.

problem Understanding how deep models parse and represent language structures.
method Introduced tunable probabilistic context-free grammars and a learning algorithm inspired by deep networks.
result Data correlations across scales enable hierarchical language representations.

With a simple architecture and the ability to learn meaningful word embeddings efficiently from texts containing billions of words, word2vec remains one of the most popular neural language models used today. However, as only a single embedding is learned for every word in the vocabulary, the model fails to optimally re…

2017-06-08abs ↗pdf ↗

Deep neural networks have become commonplace in the domain of reinforcement learning, but are often expensive in terms of the number of parameters needed. While compressing deep neural networks has of late assumed great importance to overcome this drawback, little work has been done to address this problem in the conte…

2019-04-20abs ↗pdf ↗

Meta-SAGE improves deep RL scalability for CO tasks by adapting pre-trained models to larger-scale problems.

problem Improving scalability of deep reinforcement learning models for combinatorial optimization tasks.
method Meta-SAGE combines a scale meta-learner and scheduled adaptation with guided exploration to adjust model parameters for larger-scale problems.
result Meta-SAGE outperforms previous methods and significantly improves scalability in CO tasks.

Multi-head attention outperforms single-head in in-context linear regression tasks.

problem Comparing performance of transformer with single-/multi-head attention in in-context learning.
method Theoretical analysis of performance of transformers with different attention mechanisms in linear regression tasks.
result Multi-head attention with a substantial embedding dimension outperforms single-head attention in in-context linear regression tasks.

The study explores ends in coarse homotopy of proper geodesic spaces.

problem Understanding ends in coarse homotopy of proper geodesic spaces.
method Recontextualizing ends as a functor and proving properties of coarse path components.
result Existence of a natural surjection from coarse path components to ends, not always an injection.

Paper tackles LDP bandits learning with improved results and sub-linear regret.

problem Contextual bandits learning with LDP privacy constraints.
method Simple black-box reduction frameworks for context-free bandits, extended to GLB.
result First result for BCO with multi-point feedback under LDP, sub-linear regret for GLB.

We present short proofs of all known topological properties of general Busemann GG-spaces (at present no other property is known for dimensions more than four). We prove that all small metric spheres in locally GG-homogeneous Busemann GG-spaces are homeomorphic and strongly topologically homogeneous. This is a key r…

2011-05-07abs ↗pdf ↗

We study branched covering spaces in several contexts, proving that under suitable circumstances the cover satisfies the same upper curvature bounds as the base space. The first context is of a branched cover of an arbitrary metric space that satisfies Alexandrov's curvature condition CAT(k), over an arbitrary complete…

1999-05-26abs ↗pdf ↗