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

591418 · May 202619922001200920172026
48 results for Venue reuse

We examine the Foreign Exchange (FX) spot price spreads with and without Last Look on the transaction. We assume that brokers are risk-neutral and they quote spreads so that losses to latency arbitrageurs (LAs) are recovered from other traders in the FX market. These losses are reduced if the broker can reject, ex-post…

2018-06-12abs ↗pdf ↗

Flexible framework for optimal trading across multiple asset venues.

problem Optimal trading in assets listed on different venues considering liquidity dependencies.
method Bayesian update of model parameters, finite difference method, deep reinforcement learning.
result Adaptive trading strategies improve performance in changing market conditions.

In this paper, we generalize the Almgren-Chriss's market impact model to a more realistic and flexible framework and employ it to derive and analyze some aspects of optimal liquidation problem in a security market. We illustrate how a trader's liquidation strategy alters when multiple venues and extra information are b…

2016-07-15abs ↗pdf ↗

Study on reliability of latent reuse in diffusion models under distribution shift.

problem When can latent spaces from a source dataset be reused for a target dataset with different distributions?
method Considered a source-target setting with approximately low-dimensional datasets near different subspaces. Analyzed the target-domain score error due to principal-angle misalignment and target ambient noise.
result Latent reuse is reliable only if the source and target subspaces are close and the target ambient noise is not too amplified.

Market impact is reduced when orders are filled with concentrated counterparts.

problem Market impact increases with a large number of trading counterparts.
method Analyzed London Stock Exchange data to show concentrated trading impacts market price.
result Concentrated trading reduces market impact when matched with similarly concentrated counterparts.

We propose several ways of reusing subword embeddings and other weights in subword-aware neural language models. The proposed techniques do not benefit a competitive character-aware model, but some of them improve the performance of syllable- and morpheme-aware models while showing significant reductions in model sizes…

2018-02-23abs ↗pdf ↗

Hyperparameter tuning of multi-stage pipelines introduces a significant computational burden. Motivated by the observation that work can be reused across pipelines if the intermediate computations are the same, we propose a pipeline-aware approach to hyperparameter tuning. Our approach optimizes both the design and exe…

2019-03-12abs ↗pdf ↗

This paper explores BTC-denominated prediction markets to avoid stablecoin opportunity costs.

problem Opportunity costs and loss of BTC exposure when converting to stablecoins.
method Analyzes three methods of liquidity provision: cross-market making, automated market making, and DeFi redirection.
result Cross-market making provides the best user risk profile but requires active liquidity.

When concept drift is detected during classification in a data stream, a common remedy is to retrain a framework's classifier. However, this loses useful information if the classifier has learnt the current concept well, and this concept will recur again in the future. Some frameworks retain and reuse classifiers, but …

2019-05-21abs ↗pdf ↗

Bayesian Experience Reuse improves learning from multiple experts.

problem Learning from multiple experts with conflicting goals.
method Bayesian neural networks with shared features to model uncertainty and derive a probability distribution over expert models.
result BERS method effectively samples demonstrations from the derived distribution to reuse them in new tasks.

In many real-world applications, data are often collected in the form of stream, and thus the distribution usually changes in nature, which is referred as concept drift in literature. We propose a novel and effective approach to handle concept drift via model reuse, leveraging previous knowledge by reusing models. Each…

2018-09-08abs ↗pdf ↗

Which area in NYC is the most similar to Lower East Side? What about the NoHo Arts District in Los Angeles? Traditionally this task utilizes information about the type of places located within the areas and some popularity/quality metric. We take a different approach. In particular, urban dwellers' time-variant mobilit…

2019-07-17abs ↗pdf ↗

Improved scaling laws in linear regression using data reuse.

problem Sustainability of neural scaling laws when running out of new data.
method Data reuse in multi-pass stochastic gradient descent (multi-pass SGD) for MM-dimensional linear models trained on NN data with sketched features.
result Multi-pass SGD achieves a test error of Θ(M1b+L(1b)/a)Θ(M^{1-b} + L^{(1-b)/a}) with L>NL>N, improving scaling laws in data-constrained regimes.

We consider an illiquid financial market where a risk averse investor has to liquidate a portfolio within a finite time horizon [0,T] and can trade continuously at a traditional exchange (the "primary venue") and in a dark pool. At the primary venue, trading yields a linear price impact. In the dark pool, no price impa…

2012-01-30abs ↗pdf ↗

New method uses rank-conditioned Horvitz-Thompson estimation for unbiased sample reuse in Plackett-Luce best-of-K objective.

problem Estimating the expected maximum reward in Plackett-Luce draws without replacement.
method Rank-conditioned Horvitz-Thompson estimation with joint-score REINFORCE for unbiased sample reuse.
result Unbiased estimation of the Plackett-Luce best-of-K objective with finite second moment guarantees.

Method predicts rarity of image features to support research integrity investigations.

problem Difficulty in determining if image reuse is by chance or intentional.
method Statistical estimation of ORB features' chance occurrence across PubMed Open Access Subset dataset.
result The method produces decreasingly smaller p-values for more complex imagery, supporting null hypothesis.

For a market impact model, price manipulation and related notions play a role that is similar to the role of arbitrage in a derivatives pricing model. Here, we give a systematic investigation into such regularity issues when orders can be executed both at a traditional exchange and in a dark pool. To this end, we focus…

2012-05-17abs ↗pdf ↗

Excessive reuse of test data has become commonplace in today's machine learning workflows. Popular benchmarks, competitions, industrial scale tuning, among other applications, all involve test data reuse beyond guidance by statistical confidence bounds. Nonetheless, recent replication studies give evidence that popular…

2019-05-29abs ↗pdf ↗

The paper analyzes MAML's representation using RSA, revealing that feature reuse is not the primary reason for its success.

problem Understanding why model-agnostic meta-learning (MAML) works well in few-shot learning tasks.
method Representation similarity analysis (RSA) applied to MAML's few-shot learning instantiation.
result Feature reuse is not the primary reason for MAML's success; instead, it is the learning task itself that increases representation similarity.

Two-layer networks learn faster with batch reuse, overcoming information and leap exponents.

problem Limitations of gradient flow and single-pass GD in learning multi-index target functions.
method Multi-pass gradient descent that reuses batches, analyzed using Dynamical Mean-Field Theory.
result Two-time-step overlap with target subspace for non-staircase functions, overcoming information and leap exponents.

KVCOMM optimizes multi-agent LLM systems by reusing KV-caches, reducing redundant processing.

problem Substantial overhead from reprocessing overlapping contexts across multi-agent systems.
method KVCOMM reuses KV-caches and adjusts offsets for shared content using a pool of cached examples (anchors).
result Achieves over 70% reuse rate across diverse multi-agent tasks, up to 7.8x speedup.

Stabilizes policy optimization with off-policy data using divergence augmentation.

problem Premature convergence and instability in policy optimization with off-policy data.
method Incorporates Bregman divergence between behavior and current policies to ensure safe policy updates.
result Empirically shows better performance in data-scarce scenarios compared to other algorithms.

The paper investigates what enables successful transfer learning and separates feature reuse from data statistics.

problem Understanding what enables successful transfer learning and identifying the responsible parts of the network.
method Analyzes transfer learning on block-shuffled images to distinguish feature reuse from data statistics.
result Some benefit of transfer learning comes from learning low-level statistics of data, not just feature reuse.

Entity resolution (ER) is one of the fundamental problems in data integration, where machine learning (ML) based classifiers often provide the state-of-the-art results. Considerable human effort goes into feature engineering and training data creation. In this paper, we investigate a new problem: Given a dataset D_T fo…

2018-09-28abs ↗pdf ↗

Bistable structures associated with non-linear deformation behavior, exemplified by the Venus flytrap and slap bracelet, can switch between different functional shapes upon actuation. Despite numerous efforts in modeling such large deformation behavior of shells, the roles of mechanical and nonlinear geometric effects …

2012-06-20abs ↗pdf ↗

VRER selectively reuses past observations to reduce variance in policy optimization.

problem Lack of effective experience replay for accelerating policy optimization in complex systems.
method Variance Reduction Experience Replay (VRER) framework that selectively reuses informative samples.
result VRER reduces gradient variance and improves policy learning over state-of-the-art algorithms.

Efficiently processes dynamic inputs in AI writing assistants with incremental computation.

problem Efficiently updating AI models in real-time with dynamic inputs.
method Incremental computing using vector quantization to filter and reuse intermediate values in neural networks.
result Comparable accuracy with 12.1X fewer operations for processing dynamic inputs.