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

92184276368 · Jun 202019922001200920172026
48 results for no assumptions

The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as f…

2010-05-05abs ↗pdf ↗

The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist, under most general non-parametric assumptions. The notion of consistency is as f…

2010-04-29abs ↗pdf ↗

We give a sharp comparison between the spectra of two Riemannian manifolds (Y,g) and (X,g_0) under the following assumptions: (X,g_0) has bounded geometry, (Y,g) admits a continuous Gromov-Hausdorff ε-approximation onto (X,g_0) of non zero absolute degree, and the volume of (Y,g) is almost smaller than the volume of (X…

2013-01-07abs ↗pdf ↗

We show that non-degenerate hyperquadrics in R^{n+2} admit no skew branes. Stated more traditionally, a compact codimension-one immersed submanifold of a non-degenerate hyperquadric of euclidean space must have parallel tangent spaces at two distinct points. Similar results have been proven by others, but (except for e…

2004-12-09abs ↗pdf ↗

Let L be an exact Lagrangian submanifold inside the cotangent bundle of a closed manifold N. We prove that if N satisfies a mild homotopy assumption then the image of π_2(L) in π_2(N) has finite index. We make no assumption on the Maslov class of L, and we make no orientability assumptions. The homotopy assumption is e…

2007-11-09abs ↗pdf ↗

We derive formulas for the performance of capital assets in continuous time from an efficient market hypothesis, with no stochastic assumptions and no assumptions about the beliefs or preferences of investors. Our efficient market hypothesis says that a speculator with limited means cannot beat a particular index by a …

2018-02-05abs ↗pdf ↗

We obtain sharp quantitative Laplacian upper and lower estimates under no assumption on curvatures. As a result, we derive quantitative Laplacian, area and volume comparison theorems for tubes in Riemannian and Kähler manifolds under weak integral curvature assumptions. We also give some applications, such as a general…

2019-04-18abs ↗pdf ↗

AFA evaluates AI feature acquisition strategies in domains with high costs.

problem Evaluate AI feature acquisition strategies in domains with high costs.
method Apply missing data methods and offline reinforcement learning under NDE and NUC assumptions.
result Propose a novel semi-offline reinforcement learning framework with three new estimators.

No-regret learning fails to converge to Nash equilibria in mixed strategies.

problem Limiting behavior of mixed strategies in repeated games.
method Study of optimal no-regret learning algorithms for 2x2 competitive games.
result Limiting mixed strategies cannot converge to Nash equilibria under mean-based and monotonic updates.

Under appropriate spectral assumptions we prove two existence results for positive solutions of Lichnerowicz-type equations on complete manifolds. We also give a priori bounds and a comparison result that immediately yields uniqueness for certain classes of solutions. No curvature assumptions are involved in our analys…

2015-08-27abs ↗pdf ↗

In a discrete time and multiple-priors setting, we propose a new characterisation of the condition of quasi-sure no-arbitrage which has become a standard assumption. This characterisation shows that it is indeed a well-chosen condition being equivalent to several previously used alternative notions of no-arbitrage and …

2019-04-18abs ↗pdf ↗

In this paper we establish two boundary versions of the Schwarz lemma. The first is for general holomorphic self maps of bounded convex domains with C2C^2 boundary. This appears to be the first boundary Schwarz lemma for general holomorphic self maps that requires no strong pseudoconvexity or finite type assumptions. T…

2018-10-12abs ↗pdf ↗

Extends utility maximization theory for infinite horizons without strong no-arbitrage assumptions.

problem Maximizing lifetime utility from wealth over an infinite horizon.
method Develops a duality theory using deflators and supermartingale properties, extending previous work.
result Establishes a strong duality theorem for infinite horizon utility maximization under minimal no-arbitrage assumptions.

Clarifies the theory of the deconfounder by Imai and Jiang.

problem Theoretical requirements for the deconfounder algorithm.
method Clarifies the assumption of 'no unobserved single-cause confounders' using empirical studies.
result Imai and Jiang's clarification of the assumption does not hold for counterexamples proposed by Ogburn et al. (2020).

The problem of sequential probability forecasting is considered in the most general setting: a model set C is given, and it is required to predict as well as possible if any of the measures (environments) in C is chosen to generate the data. No assumptions whatsoever are made on the model class C, in particular, no ind…

2018-12-20abs ↗pdf ↗

"No free lunch" results state the impossibility of obtaining meaningful bounds on the error of a learning algorithm without prior assumptions and modelling. Some models are expensive (strong assumptions, such as as subgaussian tails), others are cheap (simply finite variance). As it is well known, the more you pay, the…

2019-10-10abs ↗pdf ↗

Locally connected boundaries proven for relatively hyperbolic groups.

problem Proving local connectedness of boundaries for relatively hyperbolic groups.
method Using a group pair (Γ,P)(Γ,\mathbb{P}) that is relatively one ended, and removing restrictions on cardinality and peripheral subgroups.
result The Bowditch boundary of (Γ,P)(Γ,\mathbb{P}) is locally connected.

The wave equation utt=c2uxxu_{tt} = c^2 u_{xx} is generally regarded as a linear approximation to the equation describing the amplitude of a transversely vibrating elastic string in the plane. But, as is shown in \cite{BC96}, the assumption of transverse vibration in fact implies that the wave equation describes the vibration…

2013-02-27abs ↗pdf ↗

The study proves no L2L^2-eigenvalues for higher rank locally symmetric spaces.

problem Absence of principal eigenvalues for higher rank locally symmetric spaces.
method Derives dynamical assumptions on the Γ-action on geodesics and Satake compactifications.
result Generalization of Patterson's result to higher rank locally symmetric spaces.

In this survey article we will consider universal lower bounds on the volume of a Riemannian manifold, given in terms of the volume of lower dimensional objects (primarily the lengths of geodesics). By `universal' we mean without curvature assumptions. The restriction to results with no (or only minimal) curvature assu…

2003-02-20abs ↗pdf ↗

We study Betti numbers of sequences of Riemannian manifolds which Benjamini-Schramm converge to their universal covers. Using the Price inequalities we developed elsewhere, we derive two distinct convergence results. First, under a negative Ricci curvature assumption and no assumption on sign of the sectional curvature…

2019-09-12abs ↗pdf ↗

Study geometric properties of generalized vacuum static spaces.

problem Estimating geometric properties of generalized φ\varphi-vacuum static spaces.
method Proving estimates for φ\varphi-scalar curvature and first eigenvalue of the Jacobi operator, and rigidity under various geometric assumptions.
result Proved a result related to the Cosmic no-hair conjecture.

We develop the fundamental theorem of asset pricing in a probability-free infinite-dimensional setup. We replace the usual assumption of a prior probability by a certain continuity property in the state variable. Probabilities enter then endogenously as full support martingale measures (instead of equivalent martingale…

2011-07-06abs ↗pdf ↗

New method uses minimal assumptions for machine learning, improving performance and speed.

problem Current machine learning methods require specific model assumptions that are not derived from prior knowledge.
method Assumes scale invariance principles and differentiability of the true function to derive a novel stochastic process.
result The method achieves equal performance to Gaussian process regression but is less arbitrary, faster, and has better extrapolation.

We consider a class of globally hyperbolic space-times with "expanding singularities". Under suitable assumptions we show that no C0C^0-extensions across a compact boundary exist, while the boundary must be null wherever differentiable (which is almost everywhere) in the non-compact case.

2018-01-18abs ↗pdf ↗

Study shows hypercomplex twistor spaces lack divisors and special metrics.

problem Characterizing properties of hypercomplex twistor spaces.
method Analyzing the general fiber's lack of divisors and curves, proving trascendental degree and absence of special metrics.
result Proves hypercomplex twistor spaces have no divisors, curves, Kähler, or pluriclosed metrics.

Many popular reinforcement learning problems (e.g., navigation in a maze, some Atari games, mountain car) are instances of the episodic setting under its stochastic shortest path (SSP) formulation, where an agent has to achieve a goal state while minimizing the cumulative cost. Despite the popularity of this setting, t…

2019-12-07abs ↗pdf ↗

In this paper we study the behavior of the spectrum of a compact, connected Riemannian manifold (M,g)(M,g) of dimension d2d \ge 2, when we add an increasing number of increasingly small handles. No assumptions on any of the curvatures are needed.

1998-04-21abs ↗pdf ↗

Develops methods for constructing likelihoods and priors for Bayesian networks.

problem Learning parameters and structure of Bayesian networks from limited data.
method Introduces assumptions for constructing likelihoods and priors from small assessments.
result Allows construction of likelihoods and priors for a wide range of network structures.

New research shows no-regret learning is impossible in Markov games under certain assumptions.

problem Achieving no-regret learning in decentralized Markov games.
method Novel application of aggregation techniques from online learning to prove lower bounds.
result No polynomial-time algorithm exists for independent no-regret learning in general-sum Markov games.

We show that the existence of an equivalent local martingale measure for asset prices does not prevent negative prices for European calls written on positive stock prices. In particular, we illustrate that many standard no-arbitrage arguments implicitly rely on conditions stronger than the No Free Lunch With Vanishing …

2012-04-09abs ↗pdf ↗

Market impact is the link between the volume of a (large) order and the price move during and after the execution of this order. We show that under no-arbitrage assumption, the market impact function can only be of power-law type. Furthermore, we prove that this implies that the macroscopic price is diffusive with roug…

2018-05-18abs ↗pdf ↗

We study the problem of variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that…

2014-11-07abs ↗pdf ↗