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

275480107 · May 202619922001200920172026
48 results for Matérn Covariance

The study evaluates different parameter selection methods for Gaussian process interpolation.

problem Choosing optimal parameters for Gaussian process interpolation.
method Empirical study using scoring rules and leave-one-out selection criteria.
result The choice of model family is often more important than the selection criterion.

Classifies SL(n) covariant matrix-valued valuations on Lp-spaces.

problem Classifying SL(n) covariant matrix-valued valuations on Lp-spaces.
method Established a complete classification for continuous and SL(n) covariant matrix-valued valuations on Lp(Rn,|x|2dx), eliminating matrix symmetry assumption.
result Unique characterization of such valuations by the moment matrix in n>2, rotation matrix in 2D.

Human matting, high quality extraction of humans from natural images, is crucial for a wide variety of applications. Since the matting problem is severely under-constrained, most previous methods require user interactions to take user designated trimaps or scribbles as constraints. This user-in-the-loop nature makes th…

2018-09-05abs ↗pdf ↗

In this short paper, we overview and extend the results of our papers cond-mat/0001432, cond-mat/0008305, and cond-mat/0103544, where we use an analogy with statistical physics to describe probability distributions of money, income, and wealth in society. By making a detailed quantitative comparison with the available …

2002-11-09abs ↗pdf ↗

Designing a single neural network architecture that performs competitively across a range of molecule property prediction tasks remains largely an open challenge, and its solution may unlock a widespread use of deep learning in the drug discovery industry. To move towards this goal, we propose Molecule Attention Transf…

2020-02-19abs ↗pdf ↗

A new algorithm reduces frequentist regret in multi-agent bandit problems with sparse hypergraphs.

problem Deriving a frequentist regret bound for Thompson sampling in multi-agent settings with sparse hypergraphs.
method Proposed εε-exploring Multi-Agent Thompson Sampling (εε-MATS) algorithm that combines exploration and exploitation strategies.
result Achieves a worst-case frequentist regret bound sublinear in time horizon and local arm size, optimal up to constants and logarithms for sparse hypergraphs.

Recently proposed adversarial training methods show the robustness to both adversarial and original examples and achieve state-of-the-art results in supervised and semi-supervised learning. All the existing adversarial training methods consider only how the worst perturbed examples (i.e., adversarial examples) could af…

2018-07-16abs ↗pdf ↗

MAT combines meta-learning and adversarial training to defend against universal patches.

problem Defending against universal patches that fool models in various contexts.
method Meta adversarial training (MAT) integrates meta-learning with adversarial training.
result MAT increases robustness against universal patch attacks on image classification and traffic-light detection.

In this paper we derive necessary and sufficient conditions for a smooth surface in Rn+1 to admit a local 1-quasiconformal parameterization by a domain in Rn (n >= 3). We then apply these conditions to specific hypersurfaces such as cylinders, paraboloids, and ellipsoids. As a consequence, we show that the classical Li…

2017-09-21abs ↗pdf ↗

The gauge theory of arbitrage was introduced by Ilinski in [arXiv:hep-th/9710148] and applied to fast money flows in [arXiv:cond-mat/9902044]. The theory of fast money flow dynamics attempts to model the evolution of currency exchange rates and stock prices on short, e.g.\ intra-day, time scales. It has been used to ex…

2010-06-14abs ↗pdf ↗

Double Machine Learning estimators are asymptotically inadmissible under structure-agnostic models.

problem Minimax estimators may be inadmissible under structure-agnostic models.
method Exhibit second-order (U-statistic) estimators that asymptotically dominate DML estimators.
result Double Machine Learning estimators are asymptotically inadmissible under structure-agnostic models.

Driven by climatic processes, wind power generation is inherently variable. Long-term simulated wind power time series are therefore an essential component for understanding the temporal availability of wind power and its integration into future renewable energy systems. In the recent past, mainly power curve based mod…

2019-12-09abs ↗pdf ↗

The projection body operator Π, which associates with every convex body in Euclidean space Rn its projection body, is a continuous valuation, it is invariant under translations and equivariant under rotations. It is also well known that Π maps the set of polytopes in Rn into itself. We show that Π is the only non-trivi…

2012-07-31abs ↗pdf ↗

In a recent comment (Johansen A 2003 An alternative view, Quant. Finance 3: C6-C7, cond-mat/0302141), Anders Johansen has criticized our methodology and has questioned several of our results published in [Sornette D and Zhou W-X 2002 The US 2000-2002 market descent: how much longer and deeper? Quant. Finance 2: 468-81,…

2003-04-30abs ↗pdf ↗

Several authors have noticed the signature of log-periodic oscillations prior to large stock market crashes [cond-mat/9509033, cond-mat/9510036, Vandewalle et al 1998]. Unfortunately good fits of the corresponding equation to stock market prices are also observed in quiet times. To refine the method several approaches …

2002-04-13abs ↗pdf ↗

Zero-sum games such as chess and poker are, abstractly, functions that evaluate pairs of agents, for example labeling them `winner' and `loser'. If the game is approximately transitive, then self-play generates sequences of agents of increasing strength. However, nontransitive games, such as rock-paper-scissors, can ex…

2019-01-23abs ↗pdf ↗

These are notes on the theory of supermanifolds and integration on them, aiming to collect results that are useful for a better understanding of superstring perturbation theory in the RNS formalism.

2012-09-11abs ↗pdf ↗

Paper presents quantum algorithms for pricing financial derivatives using complex models.

problem Implementing complex financial models like local volatility on quantum computers.
method Developed two quantum circuit implementations for local volatility model.
result Demonstrated reduced qubit requirements for local volatility model.

A Minkowski class is a closed subset of the space of convex bodies in Euclidean space Rn which is closed under Minkowski addition and non-negative dilatations. A convex body in Rn is universal if the expansion of its support function in spherical harmonics contains non-zero harmonics of all orders. If K is universal, t…

2012-07-31abs ↗pdf ↗

Efficient Winograd convolution for INT8 networks using RNS.

problem Difficulty in applying Winograd algorithm to low-precision quantized networks.
method Extends Winograd algorithm to Residue Number System (RNS) for efficient INT8 convolution.
result Arithmetic complexity reduction up to 7.03x with performance improvement up to 2.30x-4.69x.

Let M be a random (alpha n) x n matrix of rank r<<n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(rn) observed entries with relative root mean square error RMSE <= C(rn/|E|)^0.5 . Further, if r=O(1), M can be reconstructed ex…

2009-01-20abs ↗pdf ↗

MEx: Multi-modal Exercises Dataset is a multi-sensor, multi-modal dataset, implemented to benchmark Human Activity Recognition(HAR) and Multi-modal Fusion algorithms. Collection of this dataset was inspired by the need for recognising and evaluating quality of exercise performance to support patients with Musculoskelet…

2019-08-13abs ↗pdf ↗

The notion of LpL^p-distributions is introduced on Riemannian symmetric spaces of noncompact type and their main properties are established. We use a geometric description for the topology of the space of test functions in terms of the Laplace-Beltrami operator. The techniques are based on a-priori estimates for ellipt…

2006-11-19abs ↗pdf ↗

Our principal goal is to study the Prescribed Curvature Tensor problem in locally conformally flat manifolds. The solution to this problem is given explicitly for the special cases of the tensor R, including a case where the metric g is complete on Rn. Similar problems are considered for locally conformally flat manifo…

2015-12-21abs ↗pdf ↗

The self-organizing methods were used for the investigation of financial market. As an example we consider data time-series of Dow Jones index for the years 2002-2003 (R. Mantegna, cond-mat/9802256). In order to reveal new structures in stock market behavior of the companies drawing up Dow Jones index we apply SOM (Sel…

2004-02-10abs ↗pdf ↗

This work optimizes LLMs by reformulating attention networks and solving them in matrix multiplication time.

problem Optimizing the one-layer attention network objective function in LLMs.
method Provides an iterative greedy algorithm to train the loss function up to ε in time proportional to matrix multiplication.
result Solves the attention regression problem in matrix multiplication time.

Framework for transitioning financial models from risk-neutral to real-world measure.

problem Transitioning financial models from risk-neutral to real-world measure to better reflect market dynamics and investor preferences.
method Leveraging probability theory, specifically Girsanov's theorem, to incorporate real-world dynamics into financial models.
result Validation of the robustness and practical relevance of the methodology through case studies involving financial forecasts and stress tests.

An L-space link is a link in S3S^3 on which all sufficiently large integral surgeries are L-spaces. We prove that for m, n relatively prime, the r-component cable link Krm,rnK_{rm,rn} is an L-space link if and only if K is an L-space knot and n/m2g(K)1n/m \geq 2g(K)-1. We also compute HFL-minus and HFL-hat of an L-space cable lin…

2015-02-18abs ↗pdf ↗