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

Trend · papers per month

59119178237 · Jun 202019922001200920172026
48 results for Lewis weights

The paper proposes a method to solve L1 regression with fewer labels using Lewis weights.

problem Finding an approximate solution to L1 regression with limited labels.
method Sampling rows of the data matrix XX according to its Lewis weights and using the empirical minimizer.
result The method succeeds with high probability and has an optimal error bound.

Algorithm solves robust linear regression with block Lewis weights.

problem Group distributionally robust least squares problem.
method Algorithm based on geometric construction and block Lewis weights, using accelerated proximal methods.
result Improves over known methods for moderate accuracy regimes and matches state-of-the-art guarantees.

Designs efficient algorithms for online and sliding window models of subspace embeddings for all p.

problem Design efficient algorithms for online and sliding window models of subspace embeddings for all p.
method Develops nearly optimal p\ell_p subspace embeddings for all p(0,)p\in(0,\infty) in the online coreset and sliding window models.
result First nearly optimal p\ell_p subspace embeddings for all p(0,)p\in(0,\infty) in the online coreset and sliding window models.

RHMC improves sampling polytopes defined by inequalities with barriers.

problem Sampling polytopes defined by inequalities efficiently.
method Riemannian Hamiltonian Monte Carlo (RHMC) with a hybrid of Lewis weights and logarithmic barriers.
result RHMC achieves mixing rate of ildeO(m1/3n4/3) ilde O(m^{1/3}n^{4/3}) for polytopes defined by mm inequalities in Rn\R^n.

The study compares DLS method with machine learning for cricket match result prediction.

problem Improving accuracy of Duckworth-Lewis-Stern method for cricket match result prediction.
method Comparison of Duckworth-Lewis-Stern method with various supervised learning algorithms and optimization of DLS resource table.
result Development of Unpredictability Index to rank nations based on unpredictability in ODI matches.

Improved subsampling bounds for p\ell_p sensitivity sampling using 2\ell_2 augmentation.

problem Efficiently approximating large data sets by small representative proxies.
method Optimized sampling based on p\ell_p and 2\ell_2 sensitivities.
result Optimal linear ildeO(ε2(S+d)) ilde O(\varepsilon^{-2}(\mathfrak S+d)) sampling complexity for all p[1,2]p \in [1,2].

LEWIS merges LLMs without training, improving performance on specific tasks.

problem Limited performance improvement of merged models on specific benchmarks.
method Guided model merging using layer-wise sparsity and task-vector pruning.
result Improved model performance by up to 11.3% on math-solving tasks.

A neural network and evolutionary algorithm framework designs nonlinear optical molecules.

problem Designing efficient nonlinear optical materials.
method Multi-stage Bayesian neural network (msBNN) and corrected Lewis-mode group contribution method (cLGC) combined with evolutionary algorithm (EA).
result Accurately and efficiently designs molecules with different optical properties using a small data set.

A free action of the direct product of two copies of the symmetric group on 3 elements on the cartesian product of two copies of the 3-sphere is constructed. This nonlinear action is constructed using surgery. The action provides a counterexample to a conjecture of Lewis made in 1968.

1998-06-06abs ↗pdf ↗

We prove an existence theorem for Spin(7)-instantons, which are highly concentrated near a Cayley submanifold; thus giving a partial converse to Tian's foundational compactness theorem. As an application, we show how to construct Spin(7)-instantons on Spin(7)-manifolds with suitable local K3 Cayley fibrations. This rec…

2014-09-23abs ↗pdf ↗

Starting from the candidate Bloch-Beilinson filtration on Chow groups of 0-cycles constructed by J. Lewis, we develop and describe geometrically a series of Hodge-theoretic invariants defined on the graded pieces. Explicit formulas (in terms of currents and membrane integrals) are given for certain quotients of the inv…

2005-04-05abs ↗pdf ↗

The CGMY model's ATM call-price asymptotics are derived using characteristic function.

problem Deriving short-time asymptotics for the CGMY model's ATM call prices.
method Using the characteristic function, derived short-time asymptotics for the CGMY model's ATM call prices. Extracted higher-order coefficients by dynamic cutoff partitioning.
result Higher-order coefficients are derived for the CGMY model's ATM call prices.

We give a fast oblivious L2-embedding of ARnxdA\in \mathbb{R}^{n x d} to BRrxdB\in \mathbb{R}^{r x d} satisfying (1ε)Ax22Bx22<=(1+ε)Ax22.(1-\varepsilon)\|A x\|_2^2 \le \|B x\|_2^2 <= (1+\varepsilon) \|Ax\|_2^2. Our embedding dimension rr equals dd, a constant independent of the distortion ε\varepsilon. We use as a black-box any L2-embedding $Π…

2019-09-27abs ↗pdf ↗

We obtain very sharp results about the lack of validity of the Poincare lemma for the tangential Cauchy Riemann equations, acting on tangential forms, tangential to a CR manifold M of general CR dimension n, and general CR codimension k. This generalizes the classical nonsolvability example of H. Lewy. We also discuss …

2007-10-18abs ↗pdf ↗

We discuss various analytic and numerical methods that have been used to get option prices within a framework of the VG model. We show that some popular methods, for instance, Carr-Madan's FFT method could blow up for certain values of the model parameters even for an European vanilla option. Alternative methods - one …

2005-03-16abs ↗pdf ↗

We examine the effects of instantiating Lewis signaling games within a population of speaker and listener agents with the aim of producing a set of general and robust representations of unstructured pixel data. Preliminary experiments suggest that the set of representations associated with languages generated within a …

2019-11-06abs ↗pdf ↗

We consider the problem of finding the probability that a random triangle is obtuse, which was first raised by Lewis Caroll. Our investigation leads us to a natural correspondence between plane polygons and the Grassmann manifold of 2-planes in real nn-space proposed by Allen Knutson and Jean-Claude Hausmann. This cor…

2017-02-01abs ↗pdf ↗

New method for optimization on Hadamard manifolds with curvature-independent guarantees.

problem Curvature-dependent complexity in geodesic convex optimization.
method Introducing horospherical convexity and developing algorithms for optimization.
result Curvature-independent convergence of subgradient descent and Nesterov's method.

The computation of Greeks for exponential Lévy models are usually approached by Malliavin Calculus and other methods, as the Likelihood Ratio and the finite difference method. In this paper we obtain exact formulas for Greeks of European options based on the Lewis formula for the option value. Therefore, it is possible…

2014-07-04abs ↗pdf ↗

Lewis and Mordecki have computed the Wiener-Hopf factorization of a Lévy process whose restriction on ]0,+[]0,+\infty[ of their Lévy measure has a rational Laplace transform. That allows to compute the distribution of (Xt,inf0stXs)(X_t,\inf_{0\leq s\leq t}X_s). For the same class of Lévy processes, we compute the distribution of $ (…

2010-03-25abs ↗pdf ↗

Fourier methods fail to accurately approximate option Greeks in realistic market conditions.

problem Failure of Fourier pricing techniques to approximate Greeks in realistic market parameters.
method Used Fourier techniques like Carr-Madan formula, COS method, and Lewis formula to approximate Greeks, which failed in some market conditions.
result Empirically showed that Fourier methods completely fail to approximate Greeks in realistic market environments.

This work provides efficient algorithms for approximating ℓ_p sensitivities and related statistics.

problem Estimating the importance of datapoints in high-dimensional datasets.
method Efficient algorithms for computing α-approximation of ℓ_1 sensitivities and total sensitivity using importance sampling and sensitivity computations.
result Real-world datasets have significantly lower intrinsic effective dimensionality than theoretical predictions.

Study on isoperimetric inequalities and regularity of AA-harmonic functions on surfaces.

problem Investigating isoperimetric inequalities and regularity of AA-harmonic functions on smooth surfaces.
method Logarithmic and power-type convexity of the length of level curves, higher Sobolev regularity properties, and estimates for derivatives.
result Higher Sobolev regularity properties of solutions, including W2,2W^{2,2} regularity.

New Spin(7)Spin(7)-instantons constructed on Joyce's manifold.

problem Constructing Spin(7)Spin(7)-instantons on Joyce's compact manifold.
method Gluing non-flat connections on local model spaces to a flat connection on the Spin(7)Spin(7)-orbifold.
result More than 20,000 new four-parameter families of Spin(7)Spin(7)-instantons.

Active sampling algorithm for linear regression with various norms and improved query complexity.

problem Efficiently querying a few entries of a target vector for near optimal minimizers of linear regression.
method Lewis weight sampling and active sampling algorithms for different pp norms.
result Optimal query complexity for p(0,1)p \in (0,1), 1<p<21<p<2, and 2<p<2<p<\infty.

New method estimates and optimizes policy differences using orthogonal learning.

problem Offline reinforcement learning with safety concerns and cost limitations.
method Dynamic R-learner for estimating and optimizing Qπ(s,1)Qπ(s,0)Q^π(s,1)-Q^π(s,0), leveraging orthogonal estimation.
result Consistent policy optimization with improved convergence rates.

Sp(n)-instantons linked to complex Lagrangian graphs via Fourier-Mukai transform.

problem Understanding Sp(n)-instantons on hyperkahler manifolds with conical singularities.
method Relating Sp(n)-instantons to deformed instantons and studying their properties on hyperkahler manifolds.
result Sp(n)-instantons on hyperkahler manifolds correspond to tri-contact instantons on the 3-Sasakian link.

Pontryagin's Maximum Principle is an outstanding result for solving optimal control problems by means of optimizing a specific function on some particular variables, the so called controls. However, this is not always enough for solving all these problems. A high order maximum principle (Krener, 1977) must be used in o…

2012-10-25abs ↗pdf ↗

Unified model for equity option pricing and interest-rate risk assessment.

problem Pricing short and medium-term equity options and interest-rate risk.
method Developed a stochastic modeling framework using Heston, Bates, and CIR models, calibrated using Fourier inversion and FFT.
result Calibration stability and convergence of parameter sets across models.

Improves disease progression prediction using auxiliary surrogate labels and health markers.

problem Challenges in predicting disease progression due to unknown true disease states.
method Integrates hidden Markov model with time-varying discriminative classification model.
result Significant improvement in distinguishing LBD from AD using objective markers.

Improved pricing of vanilla options using modified Adams method and sinh-acceleration.

problem Calibration of rough Heston model leads to incorrect implied volatility surfaces.
method Modified Adams method and sinh-acceleration for Fourier inversion.
result Corrected implied volatility surface is significantly flatter and fits data poorly.

Study compares methods for improving document retrieval accuracy.

problem Improving document retrieval accuracy from large corpora.
method Comparison of query expansion, topic models, and active learning.
result Active learning outperforms keyword lists in most settings.