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

15304459 · Jun 202019922001200920172026
48 results for Block Builders

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.

The paper analyzes CEX-DEX arbitrage and profitability on Ethereum, revealing centralization trends and market impacts.

problem Ethereum's decentralization and CEX-DEX arbitrages.
method Empirical analysis of 19 months' data from 7.2M CEX-DEX transactions, refining heuristics to identify and estimate arbitrage revenue.
result Three searchers captured three-quarters of volume and extracted value, and profitability is tied to integration with block builders.

The paper examines how builders in Ethereum auctions can defect and replicate winning MEV opportunities, affecting searchers' bidding strategies.

problem Commitment problem in Ethereum auctions where builders can defect and replicate winning MEV opportunities.
method Modeling and analysis of searchers' bidding strategies and the resulting equilibrium, using libMEV dataset.
result The equilibrium is piecewise, with the cost of imperfect commitment depending on replicability and competition. There is sharp heterogeneity across MEV types.

AI learns market manipulation through simulation, suggesting regulation.

problem Regulating AI to prevent market manipulation.
method Used a genetic algorithm in an artificial market simulation.
result AI discovered market manipulation as an optimal strategy.

Research examines how strategic latency manipulation impacts Ethereum's network efficiency and decentralization.

problem Impact of artificial latency on Ethereum's network efficiency and decentralization.
method Comprehensive analysis of MEV-Boost auction system and empirical validation with a pilot.
result Increased profitability for node operators and significant systemic challenges like heightened network inefficiencies and centralization risks.

The recent success of machine learning (ML) has led to an explosive growth both in terms of new systems and algorithms built in industry and academia, and new applications built by an ever-growing community of data science (DS) practitioners. This quickly shifting panorama of technologies and applications is challengin…

2019-12-19abs ↗pdf ↗

Proposes a game-theoretic framework for ML trust regulation.

problem Lack of coordination between ML model builders and regulators.
method Formulates trustworthy ML as a multi-objective multi-agent optimization problem and introduces regulation games and ParetoPlay.
result Enables efficient enforcement of ML model specifications without discouraging participation.

This paper presents a novel Block Iterative Bayesian Algorithm (Block-IBA) for reconstructing block-sparse signals with unknown block structures. Unlike the existing algorithms for block sparse signal recovery which assume the cluster structure of the nonzero elements of the unknown signal to be independent and identic…

2014-12-07abs ↗pdf ↗

This letter presents a novel Block Bayesian Hypothesis Testing Algorithm (Block-BHTA) for reconstructing block sparse signals with unknown block structures. The Block-BHTA comprises the detection and recovery of the supports, and the estimation of the amplitudes of the block sparse signal. The support detection and rec…

2015-08-22abs ↗pdf ↗

There exist various types of network block models such as the Stochastic Block Model (SBM), the Degree Corrected Block Model (DCBM), and the Popularity Adjusted Block Model (PABM). While this leads to a variety of choices, the block models do not have a nested structure. In addition, there is a substantial jump in the …

2020-02-07abs ↗pdf ↗

SympFormer accelerates attention blocks using inertial dynamics on density spaces.

problem Improving the efficiency of self-attention blocks in Transformers.
method Introduced accelerated attention blocks derived from inertial Nesterov dynamics on density spaces.
result Accelerated attention blocks converge faster than classical blocks while preserving oracle calls.

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge al…

2010-07-04abs ↗pdf ↗

We simplify matrix computations for block matrices, especially useful for covariance and correlation matrices.

problem Complex computations for block matrices, especially for covariance and correlation matrices.
method Obtained a canonical representation for block matrices, facilitating computation of various matrix operations.
result Simplified computation of matrix operations for block matrices, particularly useful for covariance and correlation matrices.

Attention mechanism is a hot spot in deep learning field. Using channel attention model is an effective method for improving the performance of the convolutional neural network. Squeeze-and-Excitation block takes advantage of the channel dependence, selectively emphasizing the important channels and compressing the rel…

2019-01-06abs ↗pdf ↗

Proposes BMME for optimizing nonsmooth nonconvex problems with block structure.

problem Optimizing nonsmooth nonconvex problems with block structure.
method Block Alternating Bregman Majorization Minimization with Extrapolation (BMME).
result Subsequential convergence to a first-order stationary point under mild assumptions, global convergence under stronger conditions.

Asynchronous methods are widely used in deep learning, but have limited theoretical justification when applied to non-convex problems. We show that running stochastic gradient descent (SGD) in an asynchronous manner can be viewed as adding a momentum-like term to the SGD iteration. Our result does not assume convexity …

2016-05-31abs ↗pdf ↗

Alternating Direction Method of Multipliers (ADMM) has become a widely used optimization method for convex problems, particularly in the context of data mining in which large optimization problems are often encountered. ADMM has several desirable properties, including the ability to decompose large problems into smalle…

2019-07-10abs ↗pdf ↗

Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.

problem Subspace clustering with block diagonal structure for noisy data.
method ABDR explicitly pursues block diagonality without sacrificing convexity, using a specially designed convex regularizer.
result Experimental results show ABDR outperforms state-of-the-arts.

Model learns code representations from comments for data analysis tasks.

problem Lack of descriptive labels for analyzing large code corpora.
method Weakly supervised transformer architecture for joint code and comment representation.
result Model achieves 38% accuracy increase over expert-supplied heuristics.

In the present paper we study a sparse stochastic network enabled with a block structure. The popular Stochastic Block Model (SBM) and the Degree Corrected Block Model (DCBM) address sparsity by placing an upper bound on the maximum probability of connections between any pair of nodes. As a result, sparsity describes o…

2019-10-03abs ↗pdf ↗

Incorporating deep neural networks in image compressive sensing (CS) receives intensive attentions in multimedia technology and applications recently. As deep network approaches learn the inverse mapping directly from the CS measurements, the reconstruction speed is significantly faster than the conventional CS algorit…

2019-08-28abs ↗pdf ↗

New formula calculates loss from arbitrage in blockchain liquidity pools.

problem Calculating loss from arbitrage in Automated Market Makers (AMMs) under varying block times.
method Derived a closed-form approximation for expected loss using random walk theory.
result The formula approximates the loss from arbitrage with high accuracy and shows that constant block intervals minimize this loss.

A central problem in analyzing networks is partitioning them into modules or communities. One of the best tools for this is the stochastic block model, which clusters vertices into blocks with statistically homogeneous pattern of links. Despite its flexibility and popularity, there has been a lack of principled statist…

2016-05-23abs ↗pdf ↗

Researchers developed a new Riemannian manifold for SPD matrix-valued optimal transport problems.

problem Optimal transport between SPD matrix-valued measures.
method Formulated as a generalized optimal transport problem with block SPD matrices, endowed with a novel Riemannian manifold structure.
result The novel Riemannian manifold allows solving SPD matrix-valued optimal transport problems using Riemannian optimization.

Study provides selective inference method for latent block models.

problem Challenges in constructing a test on a block structure selected by clustering algorithms.
method Developed a selective inference method for latent block models using squared residue minimization and simulated annealing.
result Proposed tests effectively handle selective bias in block structures compared to naive tests.

Paper introduces a new edge exchangeable block model for complex networks.

problem Limitations of the stochastic block model in analyzing complex networks.
method Develops a Bayesian nonparametric edge exchangeable block model.
result The new model outperforms state-of-the-art SBMs for link prediction.

Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.

problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks

Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.

problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.

New indefinite false theta functions match homological blocks for a specific 3-manifold.

problem Constructing homological blocks for certain 3-manifolds.
method Developing indefinite false theta functions and proving their equivalence to homological blocks.
result Indefinite false theta functions match homological blocks for the Poincaré homology sphere.

The blocking number of a manifold is the minimal number of points needed to block out lights between any two given points in the manifold. It has been conjectured that if the blocking number of a manifold is finite, then the manifold must be flat. In this paper we prove that this is true for 2-dimensional manifolds wit…

2008-07-18abs ↗pdf ↗

A new method for state space partitioning in block particle filtering reduces bias and variance.

problem Overcoming the curse of dimensionality in non-linear, non-Gaussian state space estimation.
method Formulates state space partitioning as a clustering problem and uses spectral clustering with constraints.
result The proposed method effectively groups correlated state variables into smaller blocks, reducing bias and variance.

Paper analyzes and improves GPSP algorithm for block sparse signal recovery.

problem Recovering block sparse signals from noisy data.
method Group Projected Subspace Pursuit (GPSP) with convergence analysis and feature selection criteria.
result GPSP exactly recovers true block sparse signals under certain conditions.

We study compact Riemannian manifolds for which the light between any pair of points is blocked by finitely many point shades. Compact flat Riemannian manifolds are known to have this finite blocking property. We conjecture that amongst compact Riemannian manifolds this finite blocking property characterizes the flat m…

2006-07-31abs ↗pdf ↗

Machine learning predicts Atlantic blocking using limited data.

problem Underestimation of blocking event duration in climate models.
method Transfer Learning and Explainable AI (SHAP analysis)
result High-pressure anomalies in specific regions contribute to blocking events.

Two spectral algorithms for community detection in graphs with covariates are compared.

problem Detecting community structure in graphs with covariates.
method Two model-based spectral algorithms are presented and compared.
result The second algorithm often better estimates block assignments by accounting for vertex covariates.