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

2685368041,072 · Jun 202019922001200920172026
48 results for Partially Ordered Sets

We say that a link L1L_1 is an s-major of a link L2L_2 if any diagram of L1L_1 can be transformed into a diagram of L2L_2 by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime alternating links. We determine this partial order for all prime alternating knot…

2008-06-22abs ↗pdf ↗

A partial order on the set of prime knots can be defined by the existence of an epimorphism between knot groups. We prove that all the prime knots with up to 66 crossings are minimal. We also show that each fibered knot with the irreducible Alexander polynomial is minimal.

2014-12-10abs ↗pdf ↗

New algorithm minimizes expert selection regret in partial bandit feedback.

problem Minimizing expert selection regret in partial bandit feedback.
method Develops a sequential minimax optimal algorithm for a generalized partial monitoring setting.
result Second order regret bounds against a general expert selection sequence.

As part of his celebrated Complex Frobenius Theorem, Nirenberg showed that given a smooth elliptic structure (on a smooth manifold), the manifold is locally diffeomorphic to an open subset of Rr×Cn\mathbb{R}^r\times \mathbb{C}^n (for some rr and nn) in such a way that the structure is locally the span of $\frac{\partial…

2018-10-23abs ↗pdf ↗

We prove that every function f:RnRf:\mathbb{R}^n\to \mathbb{R} satisfies that the image of the set of critical points at which the function ff has Taylor expansions of order n1n-1 and non-empty subdifferentials of order nn is a Lebesgue-null set. As a by-product of our proof, for the proximal subdifferential $\partial_{…

2016-05-05abs ↗pdf ↗

The natural partial ordering of the orbit types of the action of the group of local gauge transformations on the space of connections in space-time dimension d<=4 is investigated. For that purpose, a description of orbit types in terms of cohomology elements of space-time, derived earlier, is used. It is shown that, on…

2000-09-12abs ↗pdf ↗

Characterizes causal structure dominance for latent variables.

problem Determining dominance relations between causal structures with latent variables.
method Complete characterization for three visible variables, partial for four; uses nontrivial inequality constraints.
result Equivalence classes with nontrivial inequality constraints become ubiquitous as the number of visible variables increases.

Prove strong ribbon concordance induces a partial order on links, certify minimality for a handful of knots, and find minimal ribbon minimal knots.

problem Prove strong ribbon concordance induces a partial order on links.
method Use results from knot Floer homology to certify minimality under the ribbon partial order.
result Certify minimality for a handful of knots and find minimal ribbon minimal knots.

Differentiable relaxation for inferring partial orders from noisy linear data.

problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.

We show that under very general assumptions the partial Bergman kernel function of sections vanishing along an analytic hypersurface has exponential decay in a neighborhood of the vanishing locus. Considering an ample line bundle, we obtain a uniform estimate of the Bergman kernel function associated to a singular metr…

2016-01-03abs ↗pdf ↗

We study an optimal control problem related to swing option pricing in a general non-Markovian setting in continuous time. As a main result we show that the value process solves a first-order non-linear backward stochastic partial differential equation. Based on this result we can characterize the set of optimal contro…

2013-05-17abs ↗pdf ↗

Algorithm improves reinforcement learning in MDPs with partial order policies.

problem Improving reinforcement learning in MDPs with partial order policies.
method Epoch-based reinforcement learning algorithm leveraging a partial order over policy class.
result Achieves an O(wlog(Θ)T)O(\sqrt{w \log(|Θ|) T}) regret bound, independent of state and action space sizes.

In this paper, we introduce a partial order on neighborhood equivalence classes of maximally spread essential multibranched surfaces embedded in a 3-manifold. We show that if a maximally spread essential multibranched surface is atoroidal and acylindrical, then its equivalence class is minimal with respect to the parti…

2019-05-03abs ↗pdf ↗

It is well known that a countable group admits a left-invariant total order if and only if it acts faithfully on R by orientation preserving homeomorphisms. Such group actions are special cases of group actions on simply connected 1-manifolds, or equivalently, actions on oriented order trees. We characterize a class of…

2005-03-21abs ↗pdf ↗

Proposes new methods for Markov chain choice models with panel data.

problem Dependence among transactions for the same customer in historical data.
method Expectation-maximization (EM) algorithms incorporating partial-ordering preference information.
result EM algorithms outperform traditional methods on synthetic and real datasets.

We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We…

2012-02-14abs ↗pdf ↗

Let KK be a prime knot in S3S^3 and G(K)=π1(S3K)G(K)=π_1(S^3-K) the knot group. We write K1K2K_1 \geq K_2 if there exists a surjective homomorphism from G(K1)G(K_1) onto G(K2)G(K_2). In this paper, we determine this partial order on the set of prime knots with up to 11 crossings. There exist such 801 prime knots and then 640,800640,800 shou…

2009-06-22abs ↗pdf ↗

The question addressed in this paper is the performance of the optimal strategy, and the impact of partial information. The setting we consider is that of a stochastic asset price model where the trend follows an unobservable Ornstein-Uhlenbeck process. We focus on the optimal strategy with a logarithmic utility functi…

2015-10-13abs ↗pdf ↗

Extracts geometric information from point-clouds for multiclass classification.

problem Multiclass Classification with labeled point-clouds.
method Stochastic partial orderings and label embedding trees.
result Computes multiscale geometries for explainable prediction and error-free labeling.

Sharp Hölder regularity found for complex Frobenius theorem coordinates.

problem Finding optimal Hölder-Zygmund regularity for complex Frobenius theorem coordinates.
method Analyzing necessary and sufficient conditions for coordinate charts achieving the theorem's structure.
result The optimal Hölder-Zygmund regularity for coordinate charts is shown to be αα.

Here we give a concrete description of the cork automorphism f:WWf:\partial W\to \partial W of the infinite order loose-cork (W,f)(W,f), defined in \cite{a2}. It is obtained by concatenating the defining ribbon disk of WW in B4B^4 by an infinite order isotopy of the boundary knot.

2020-01-09abs ↗pdf ↗

We study online learning when partial feedback information is provided following every action of the learning process, and the learner incurs switching costs for changing his actions. In this setting, the feedback information system can be represented by a graph, and previous works studied the expected regret of the le…

2018-10-23abs ↗pdf ↗

Let J(π)J(π) be the higher order Jacobi operator. We study algebraic curvature tensors where J(π)J(π)=J(π)J(π)J(π)J(π^{\perp})=J(π^{\perp})J(π). In the Riemannian setting, we give a complete characterization of such tensors; in the pseudo-Riemannian setting, partial results are available. We present non-trivial geometric examples of Ri…

2006-05-17abs ↗pdf ↗