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

5111621 · May 202619922001200920172026
48 results for Transaction Reordering

Ethereum block builders can earn up to $14M/month by reordering transactions, harming users.

problem Block builders can exploit transaction reordering to earn significant profits, harming users.
method Estimation of MEV payments and analysis of reordering effects.
result Block builders can earn up to $14M/month by reordering transactions, skewing the distribution.

This work introduces uncertainty principles to mitigate Maximal Extractable Value in blockchain systems.

problem Maximal Extractable Value (MEV) in decentralized systems due to transaction submission privacy and monopolist power.
method Unified approaches via uncertainty principles, akin to harmonic analysis and physics, to quantify trade-offs between transaction flexibility and user economic payoff.
result Demonstrates a quantitative trade-off between transaction flexibility and user economic payoff, analogous to the Nyquist-Shannon sampling theorem.

Maximal extractable value in CFMMs can degrade or improve routing quality, with reordering MEV showing logarithmic impact.

problem Maximal extractable value in constant function market makers (CFMMs) and its impact on routing quality.
method Game theoretic analysis of MEV in CFMMs, constructing price of anarchy and analyzing reordering MEV.
result Conditions under which reordering MEV shows logarithmic impact, and implications for MEV searchers and CFMM designers.

Study examines trading costs on Uniswap, finding adversarial slippage is significant for large trades and certain assets.

problem Analyzing costs and slippage in decentralized exchanges (DEXs).
method Empirical evaluation of Uniswap's USDC-ETH and PEPE-ETH pools, calculating slippage and reordering slippage.
result Adversarial slippage is significant for large trades and certain assets like PEPE.

AutoLL uses neural networks to automatically reorder graph nodes for linear layouts.

problem Finding optimal node order in adjacency matrices without predefined features.
method Developed AutoLL-D and AutoLL-U neural network models for one-mode reordering of directed and undirected graphs.
result Demonstrated effectiveness of AutoLL through qualitative and quantitative evaluations.

New algorithm optimizes matrix reordering for noisy disordered matrices.

problem Optimizing matrix reordering for noisy disordered matrices in single-cell biology and metagenomics.
method Proposed a polynomial-time adaptive sorting algorithm to improve upon spectral seriation.
result Our algorithm achieves superior performance compared to existing methods in real datasets.

We explore under what conditions one can obtain a nontrivial knot, given a collection of nn vectors. First, we show how to get a crossing from any 3 vectors equal in magnitude, by arbitrarily picking 2 vectors and identifying the sufficient and necessary criteria for picking a third vector that will guarantee a crossi…

2016-12-20abs ↗pdf ↗

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

Efficiently learns and transports posterior densities for real-time inference.

problem High computational cost of Bayesian inference for complex posterior densities.
method Tensor-train (TT) format for offline learning, conditional transport for online inference.
result Significant improvement in inference performance for high-dimensional problems.

Hyperfitting improves LLM generation quality by enhancing diversity, contrary to simple temperature scaling.

problem Improving open-ended generation quality of LLMs with minimal fine-tuning effort.
method Demonstrates that hyperfitting, a phenomenon where LLMs are fine-tuned to near-zero training loss, enhances generation quality and mitigates repetition.
result Hyperfitting is distinct from temperature scaling and involves a dynamic, context-dependent rank reordering mechanism in the final transformer block.

TLMG4Eth combines language and graph models for Ethereum fraud detection.

problem Current fraud detection methods fail to consider semantic and similarity patterns in Ethereum transactions.
method TLMG4Eth uses a transaction language model and graph-based methods to capture semantic, similarity, and structural features.
result TLMG4Eth detects anomalies in Ethereum transactions more effectively than existing methods.

We propose a mixed integer programming (MIP) model and iterative algorithms based on topological orders to solve optimization problems with acyclic constraints on a directed graph. The proposed MIP model has a significantly lower number of constraints compared to popular MIP models based on cycle elimination constraint…

2017-01-20abs ↗pdf ↗

Investment strategy optimized in markets with transaction costs and search delays.

problem Maximizing wealth in an illiquid market with transaction costs and search frictions.
method Characterized no-trade region and provided asymptotic expansions of value function for small transaction costs.
result The effects of transaction costs are more pronounced in illiquid markets.

The study examines pricing American options with both exogenous and endogenous transaction costs.

problem Pricing American options with transaction costs and liquidity risks.
method Modeling liquidity risks as a mean-reverting process and transaction costs as proportional to trading amount. Two nonlinear PDEs are used to characterize option values. Numerical solution via ADI method and model calibration using maximum likelihood estimation.
result The model incorporating liquidity risks significantly outperforms the Leland model.

Study reveals dynamic causal relationships between Ethereum transaction fees and economic subsystems.

problem Historical gas fee volatility caused economic disequilibria and stakeholder challenges.
method Time-varying Granger causality analysis using data on active wallets and transaction volume.
result Dynamic bidirectional causal relationships between transaction fees and economic subsystems across Ethereum.

The paper bridges stochastic control and deep hedging for European call options with transaction costs.

problem Hedging and pricing European call options with proportional transaction costs.
method Complementary perspectives: stochastic control and deep hedging. Two architectures proposed: NTBN-Delta and WW-NTBN.
result WW-NTBN converges faster, matches no-transaction bands more closely, and generalizes well across transaction cost regimes.

New method improves blockchain analysis by handling temporal changes and scalability.

problem Limited focus on evolving nature and scalability of blockchain transaction networks.
method Incremental approach with Metropolis-Hastings random walks.
result Comparable performance in node classification tasks with reduced computational overhead.

In this short note, we consider mean-variance optimized portfolios with transaction costs. We show that introducing quadratic transaction costs makes the optimization problem more difficult than using linear transaction costs. The reason lies in the specification of the budget constraint, which is no longer linear. We …

2020-01-06abs ↗pdf ↗

Deep models for financial transactions are vulnerable to adversarial attacks, especially when adding transaction tokens.

problem Vulnerability of deep models to adversarial attacks on financial transaction records.
method Examine adversarial attacks and defenses on transaction records data, considering black-box attacks and adding transaction tokens.
result A few generated transactions can fool a deep-learning model, highlighting the need for robustness improvements.

The paper optimizes portfolios with transaction costs in a large asset universe.

problem Optimizing portfolios with transaction costs in a large asset universe.
method Mean-variance optimization with nonconvex penalty for proportional and quadratic transaction costs.
result The proposed models show satisfactory performance and highlight the importance of transaction costs.

Study how transaction costs impact stock returns and holdings in equilibrium.

problem Impact of quadratic transaction costs on equilibrium stock returns and holdings.
method Developed a continuous-time risk-sharing model with FBSDEs to characterize equilibrium stock holdings and trading rates.
result Equilibrium stock holdings and trading rates are uniquely determined by FBSDEs, and equilibrium return by a system of coupled FBSDEs.

In (exploratory) factor analysis, the loading matrix is identified only up to orthogonal rotation. For identifiability, one thus often takes the loading matrix to be lower triangular with positive diagonal entries. In Bayesian inference, a standard practice is then to specify a prior under which the loadings are indepe…

2014-09-26abs ↗pdf ↗

We prove the existence of an equilibrium in a model with transaction costs and price impact where two agents are incentivized to trade towards a target. The two types of frictions -- price impact and transaction costs -- lead the agents to two distinct changes in their optimal investment approach: price impact causes a…

2020-02-19abs ↗pdf ↗

Bank transactions help predict macroeconomic indexes faster and more accurately.

problem Lag in macroeconomic index availability and autoregressive models' limitations in complex scenarios.
method Use financial transactions data to estimate macroeconomic indexes using neural networks and smart sampling.
result Neural network approach outperforms baseline methods on hand-crafted features based on transactions.

We propose a representation of graph as a functional object derived from the power iteration of the underlying adjacency matrix. The proposed functional representation is a graph invariant, i.e., the functional remains unchanged under any reordering of the vertices. This property eliminates the difficulty of handling e…

2014-04-21abs ↗pdf ↗

Unified asymptotics for investment in markets with transaction costs and search frictions.

problem Investment in markets with transaction costs and search frictions.
method Power-utility maximization problem with proportional transaction costs and Poisson-triggered trades, analyzed using a novel asymptotic framework.
result Explicit asymptotics for the no-trade region and value function derived.

Investigates how trading boundaries change with transaction costs in portfolio selection.

problem Investigates how trading boundaries vary with transaction costs in portfolio selection.
method Analyzes Merton's problem with proportional transaction costs, showing monotonicity of trading boundaries.
result Cost-adjusted trading boundaries are monotone in transaction costs, with implications for the Merton line.

The M and A transactions represent a wide range of unique business optimization opportunities in the corporate transformation deals, which are usually characterized by the high level of total risk. The M and A transactions can be successfully implemented by taking to an account the size of investments, purchase price, …

2015-02-06abs ↗pdf ↗

Money flow models are essential tools to understand different economical phenomena, like saving propensities and wealth distributions. In spite of their importance, most of them are based on synthetic transaction networks with simple topologies, e.g. random or scale-free ones, as the characterisation of real networks i…

2016-02-23abs ↗pdf ↗

Study on-chain peak shaving to reduce Ethereum transaction costs.

problem Reducing transaction costs in blockchain networks, especially during congested periods.
method Analyzing transaction-level data from multiple firms across various industries to understand scheduling responses and cost management strategies.
result Firms' scheduling responses to congestion vary, leading to different fee savings and residual costs.

A digital euro protocol offers complete privacy and offline transactions using Groth-Sahai proofs.

problem Fragile digital payment solutions with privacy and offline transaction issues.
method Design and implementation of a Central Bank Digital Currency (CBDC) using Groth-Sahai zero-knowledge proofs.
result Complete privacy and offline transaction capability with retroactive double-spending detection.

We consider a Nash equilibrium between two high-frequency traders in a simple market impact model with transient price impact and additional quadratic transaction costs. Extending a result by Schöneborn (2008), we prove existence and uniqueness of the Nash equilibrium and show that for small transaction costs the high-…

2013-05-17abs ↗pdf ↗