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

305989118 · Jun 202019922001200920172026
48 results for plain paper-folding schemes

The paper examines conditions for Gromov-Hausdorff convergence of metric quotients and provides examples of conic-flat surfaces.

problem Conditions for Gromov-Hausdorff convergence of metric quotients.
method Analyzes sufficient conditions for Gromov-Hausdorff convergence of metric quotients of a metric space.
result Concrete examples of sequences of two-dimensional conic-flat spheres converging to spheres with singularities.

In the present paper, we introduce a numerical scheme for the price of a barrier option when the price of the underlying follows a diffusion process. The numerical scheme is based on an extension of a static hedging formula of barrier options. For getting the static hedging formula, the underlying process needs to have…

2012-06-13abs ↗pdf ↗
Tradable Schemescond-mat.stat-mech

In this article we present a new approach to the numerical valuation of derivative securities. The method is based on our previous work where we formulated the theory of pricing in terms of tradables. The basic idea is to fit a finite difference scheme to exact solutions of the pricing PDE. This can be done in a very e…

2000-09-04abs ↗pdf ↗

We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a ribbon, and it turns out that the way the ribbon is folded influences the ribbonlength. We give an upper bound of ncot(π/n)n\cot(π/n) for the ribbonlength of $…

2016-02-25abs ↗pdf ↗

In this letter, as a proof of concept, we propose a deep learning-based approach to attack the chaos-based image encryption algorithm in \cite{guan2005chaos}. The proposed method first projects the chaos-based encrypted images into the low-dimensional feature space, where essential information of plain images has been …

2019-07-29abs ↗pdf ↗

An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right, or 120-isosceles triangle; a 120-rhombus; a 60-90-120 kite; or a regular hexagon…

2009-08-22abs ↗pdf ↗

This survey reviews Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a ribbon, and the ribbonlength problem asks to minimize the ribbonlength for a given knot type. We give a summary of known results. For the mos…

2018-06-29abs ↗pdf ↗

MSGD outperforms SGD in overparametrized settings with faster convergence rates.

problem Optimization of non-convex functions with momentum.
method Momentum Stochastic Gradient Descent (MSGD) with rigorous analysis.
result MSGD converges exponentially faster than SGD in overparametrized settings.

Study on ribbonlength and crossing number for folded ribbon knots.

problem Understanding the relationship between ribbonlength and crossing number for folded ribbon knots.
method Used two different methods to establish upper bounds on ribbonlength in terms of crossing number.
result Found constants c1c_1 and c2c_2 such that ribbonlength is bounded above by c1Cr(K)2c_1\cdot Cr(K)^2 and c2Cr(K)3/2c_2\cdot Cr(K)^{3/2}, respectively.

Generates coherent storybooks from plain text using diffusion models.

problem Ensuring coherency in a sequence of images for storytelling applications.
method Combines pre-trained LLM and text-guided Latent Diffusion Model for zero-shot generation.
result Outperforms state-of-the-art image editing baselines in generating coherent storybooks.

We present the particle stochastic approximation EM (PSAEM) algorithm for learning of dynamical systems. The method builds on the EM algorithm, an iterative procedure for maximum likelihood inference in latent variable models. By combining stochastic approximation EM and particle Gibbs with ancestor sampling (PGAS), PS…

2018-06-25abs ↗pdf ↗

The crisis that affected financial markets in the last years leaded market practitioners to revise well known basic concepts like the ones of discount factors and forward rates. A single yield curve is not sufficient any longer to describe the market of interest rate products. On the other hand, using different yield c…

2010-06-24abs ↗pdf ↗

New HMC method uses asymmetrical momentum distributions and improves performance.

problem Rigorous convergence guarantees for HMC with Gaussian momentum distributions.
method New convergence analysis for HMC with general asymmetrical momentum distributions, proposing AD-HMC.
result AD-HMC exhibits geometric convergence in Wasserstein distance under certain conditions.

Normal distributions ensure asymptotic variance reduction in moment matching Monte Carlo.

problem Asymptotic variance reduction in general integration problems.
method Characterization of conditions for asymptotic variance reduction using normal distributions.
result Asymptotic variance reduction is guaranteed for normal distributions in moment matching Monte Carlo.

Hybrid models improve groundwater level prediction and uncertainty analysis.

problem Predicting and analyzing uncertainty of monthly groundwater levels.
method Six evolutionary optimization algorithms (GOA, CSO, WA, GA, KA, PSO) hybridized with ANFIS, ANN, and SVM.
result ANFIS-GOA outperformed other models in predicting groundwater levels.

Upper bounds on ribbonlength of various knots, showing linear and sub-linear behavior.

problem Estimating the ribbonlength of different types of knots.
method Using Kauffman's model of folded ribbon knots, we derive upper bounds on ribbonlength for specific knot types.
result Upper bounds on ribbonlength are linear in crossing number for some knots and sub-linear for others.

Method interpolates option prices and volatilities without arbitrage.

problem Interpolating option prices and volatilities without arbitrage.
method Sparse modeling approach based on integral equations and SVD.
result Flexible and efficient framework for arbitrage-free interpolation.

In this paper, we give a numerical method for pricing long maturity, path dependent options by using the Markov property for each underlying asset. This enables us to approximate a path dependent option by using some kinds of plain vanillas. We give some examples whose underlying assets behave as some popular Levy proc…

2009-11-30abs ↗pdf ↗

FOCUS improves offline RL by incorporating causal structure into world-models.

problem Learning effective policies from historical data without interaction.
method FOCUS proposes a practical algorithm that learns and leverages causal structure in offline RL.
result FOCUS outperforms plain model-based offline RL algorithms and other causal model-based RL algorithms.

Descending phase retrieval algorithms show a phase transition with increasing sample complexity.

problem Theoretical limits of descending phase retrieval algorithms.
method Utilizing Random duality theory (RDT), the study develops a generic program to characterize algorithm performance.
result As sample complexity increases, the parametric manifold transitions from multi to single funneling points, leading to a phase transition in algorithm success.

New algorithm samples matrix rows proportional to their ℓ_p norm in a turnstile data stream.

problem Sampling rows of a dynamic matrix efficiently in a turnstile data stream.
method Develops a novel algorithm for sampling rows proportional to their ℓ_p norm in a turnstile data stream, returning sampled row indexes and approximated sampling probabilities.
result Achieves (1+ε)(1+\varepsilon) approximation for logistic regression in a turnstile data stream with polynomial sketch size.

We study --both in theory and practice-- the use of momentum motions in classic iterative hard thresholding (IHT) methods. By simply modifying plain IHT, we investigate its convergence behavior on convex optimization criteria with non-convex constraints, under standard assumptions. In diverse scenaria, we observe that …

2017-12-26abs ↗pdf ↗

Flow-based generative models (Dinh et al., 2014) are conceptually attractive due to tractability of the exact log-likelihood, tractability of exact latent-variable inference, and parallelizability of both training and synthesis. In this paper we propose Glow, a simple type of generative flow using an invertible 1x1 con…

2018-07-09abs ↗pdf ↗

Proves a theorem for normal distributions on manifolds with boundary.

problem Normal distributions on manifolds with boundary require a new approach to integration.
method Introduces neat integral manifolds with boundary and conditions for integrability.
result Conditions for integrability expressed in terms of adapted collars and integrability on interior and boundary.