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

Trend · papers per month

6481,2961,9442,592 · Jun 202019922001200920172026
48 results for Lloyd's of London

Research simulates Lloyd's of London's specialty insurance market dynamics.

problem Quantitative study of complex market phenomena in Lloyd's of London.
method Discrete Event Simulation (DES) framework for Lloyd's of London specialty insurance market.
result Model shows sophisticated exposure management reduces syndicate insolvency, and syndication enhances actuarial price accuracy.

Fair k-means algorithm ensures equitable costs for different groups.

problem K-means clustering can result in biased outcomes for subgroups of data.
method Presented a fair k-means objective and algorithm (Fair-Lloyd) to choose cluster centers that provide equitable costs for different groups.
result Fair-Lloyd algorithm ensures all groups have equal costs in the output k-clustering, with negligible increase in running time.

The Lloyd-Max algorithm is a classical approach to perform K-means clustering. Unfortunately, its cost becomes prohibitive as the training dataset grows large. We propose a compressive version of K-means (CKM), that estimates cluster centers from a sketch, i.e. from a drastically compressed representation of the traini…

2016-10-27abs ↗pdf ↗

The paper analyzes sterling bills of exchange during the first globalization, revealing their global financial role.

problem Understanding the global financial role of sterling bills of exchange during the first globalization.
method Descriptive statistics and network analysis of a unique data set of 23,493 bills re-discounted by the Bank of England in 1906.
result Sterling bills of exchange had a truly global dimension and were crucial for overcoming information asymmetries.

Paper establishes universal lower bounds and optimal rates for clustering sub-exponential mixture models.

problem Achieving optimal error rates in clustering sub-exponential mixture models.
method Establishes universal lower bounds and demonstrates iterative algorithms' optimality in sub-exponential mixture models.
result Iterative algorithms achieve the universal lower bound in sub-exponential mixture models.

Using a trimming approach, we investigate a k-means type method based on Bregman divergences for clustering data possibly corrupted with clutter noise. The main interest of Bregman divergences is that the standard Lloyd algorithm adapts to these distortion measures, and they are well-suited for clustering data sampled …

2018-12-11abs ↗pdf ↗

The paper provides convergence bounds for approximating a distribution using point clouds.

problem Approximating a distribution using discrete points with minimal Wasserstein distance.
method Lloyd's algorithm with Power cells, analyzed using gradient descent.
result Explicit upper bounds for the convergence speed of the Lloyd-type algorithm.

New algorithms cluster nodes in SBM graphs faster and more accurately.

problem Efficiently clustering nodes in graphs generated from SBM models.
method Inspired by Lloyd's algorithm, proposes model-free clustering methods for SBM graphs.
result Consistent estimation of node clusters and parameters in SBM graphs.

Study examines value relevance of oil and gas reserve disclosures in London Stock Exchange.

problem Uncertainty in oil and gas reserves poses accounting challenges for investors.
method Empirical analysis using archival data and multifactor framework.
result Changes in reserves and their components are associated with share returns, but insignificantly due to oil price and longitudinal effects. Quality of disclosures positively impacts share returns.

We consider KK-means clustering in networked environments (e.g., internet of things (IoT) and sensor networks) where data is inherently distributed across nodes and processing power at each node may be limited. We consider a clustering algorithm referred to as networked KK-means, or NKNK-means, which relies only on l…

2019-01-01abs ↗pdf ↗

Financial markets can be described on several time scales. We use data from the limit order book of the London Stock Exchange (LSE) to compare how the fluctuation dominated microstructure crosses over to a more systematic global behavior.

2007-05-28abs ↗pdf ↗

A new method for robust product Markovian quantization overcomes numerical instabilities.

problem Numerical instabilities in the PMQ algorithm limit its adoption, especially for stochastic volatility models.
method Reformulated PMQ as standard vector quantization, applying accelerated Lloyd's algorithm for robustness.
result The method overcomes numerical instabilities and extends applicability to stochastic volatility models.

Develops a Bayesian model to predict business revenue and demand.

problem Estimating revenue and demand at business facilities.
method Variational Bayesian spatial interaction model (BSIM) with scalable inference.
result BSIM outperforms competing approaches in predicting pub revenue and demand.

We propose a novel method to accelerate Lloyd's algorithm for K-Means clustering. Unlike previous acceleration approaches that reduce computational cost per iterations or improve initialization, our approach is focused on reducing the number of iterations required for convergence. This is achieved by treating the assig…

2018-05-27abs ↗pdf ↗

Paper proposes efficient methods for high-order clustering in tensor block models.

problem High-order clustering of multiway datasets in neuroimaging, genomics, etc.
method Tensor block model and computationally efficient algorithms (HLloyd, HSC)
result Achieves high-order exact clustering with statistical optimality and computational efficiency.

We respond to the issues discussed by Farmer and Lillo (FL) related to our proposed approach to understanding the origin of power-law distributions in stock price fluctuations. First, we extend our previous analysis to 1000 US stocks and perform a new estimation of market impact that accounts for splitting of large ord…

2004-03-02abs ↗pdf ↗

A method uses Wasserstein clustering to simplify financial data analysis.

problem Processing and analyzing granular financial data with missing values and identifying clusters.
method Variant of Lloyd's algorithm applied to probability distributions, using Wasserstein barycenters.
result Demonstrated usefulness in financial regulation context.

Ethereum tackles bribery in blockchain transactions with new fee mechanism.

problem Bribing miners in Ethereum blockchain to manipulate transaction fees.
method Filtered transactions, constructed proxies for bribery level, analyzed effects on blockchain and financial markets.
result Bribing affects Ethereum and other blockchains, influencing cryptocurrency, transaction stats, and network adoption.

Persistence is studied in a financial context by mapping the time evolution of the values of the shares quoted on the London Financial Times Stock Exchange 100 index (FTSE 100) onto Ising spins. By following the time dependence of the spins, we find evidence for power law decay of the proportion of shares that remain e…

2005-10-04abs ↗pdf ↗

K-means -- and the celebrated Lloyd algorithm -- is more than the clustering method it was originally designed to be. It has indeed proven pivotal to help increase the speed of many machine learning and data analysis techniques such as indexing, nearest-neighbor search and prediction, data compression; its beneficial u…

2019-08-23abs ↗pdf ↗

Although behavioral economics has demonstrated that there are many situations where rational choice is a poor empirical model, it has so far failed to provide quantitative models of economic problems such as price formation. We make a step in this direction by developing empirical models that capture behavioral regular…

2005-09-22abs ↗pdf ↗

A new heuristic LM algorithm improves kk-segmentation accuracy with less computation.

problem Efficiently segmenting large video streams into meaningful piecewise-linear segments.
method Inspired by Lloyd's and Lloyd-Max algorithms, LM algorithm iteratively minimizes a cost function.
result LM algorithm achieves competitive accuracy with exact methods at a fraction of the computational cost.

We consider the existence of simple closed geodesics or "geodesic knots" in finite volume orientable hyperbolic 3-manifolds. Previous results show that at least one geodesic knot always exists [Bull. London Math. Soc. 31(1) (1999) 81-86], and that certain arithmetic manifolds contain infinitely many geodesic knots [J. …

2009-06-30abs ↗pdf ↗

In this paper, we study the problem of learning a mixture of Gaussians with streaming data: given a stream of NN points in dd dimensions generated by an unknown mixture of kk spherical Gaussians, the goal is to estimate the model parameters using a single pass over the data stream. We analyze a streaming version of …

2017-07-08abs ↗pdf ↗

We develop a maximum penalized quasi-likelihood estimator for estimating in a nonparametric way the diffusion function of a diffusion process, as an alternative to more traditional kernel-based estimators. After developing a numerical scheme for computing the maximizer of the penalized maximum quasi-likelihood function…

2010-08-14abs ↗pdf ↗

For the London Stock Exchange we demonstrate that the signs of orders obey a long-memory process. The autocorrelation function decays roughly as τατ^{-α} with α0.6α\approx 0.6, corresponding to a Hurst exponent H0.7H \approx 0.7. This implies that the signs of future orders are quite predictable from the signs of past orde…

2003-11-04abs ↗pdf ↗

Study gradient estimates for nonlinear parabolic equations on Riemannian manifolds.

problem Estimating gradients for nonlinear parabolic equations on Riemannian manifolds.
method Analyzes Fisher-KPP, parabolic Allen-Cahn, and Newell-Whitehead equations on complete noncompact Riemannian manifolds.
result Gradient estimates for positive solutions and Liouville theorem for ancient solutions.

The generalization properties of Gaussian processes depend heavily on the choice of kernel, and this choice remains a dark art. We present the Neural Kernel Network (NKN), a flexible family of kernels represented by a neural network. The NKN architecture is based on the composition rules for kernels, so that each unit …

2018-06-12abs ↗pdf ↗