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.
New family of knots with epsilon invariant nonzero despite Upsilon and phi being zero.
We define a concordance invariant, epsilon(K), associated to the knot Floer complex of K, and give a formula for the Ozsváth-Szabó concordance invariant tau of K_{p,q}, the (p,q)-cable of a knot K, in terms of p, q, tau(K), and epsilon(K). We also describe the behavior of epsilon under cabling, allowing one to compute …
Ozsvath-Stipsicz-Szabo recently defined a one-parameter family, upsilon of K at t, of concordance invariants associated to the knot Floer complex. We compare their invariant to the {-1, 0, 1}-valued concordance invariant epsilon, which is also associated to the knot Floer complex. In particular, we give an example of a…
Hom gives an example of a knot with vanishing Upsilon invariant but nonzero epsilon invariant. We build more such knots that are linearly independent in the smooth concordance group.
Let M be a closed 3-manifold which can be triangulated with N simplices. We prove that any map from M to a genus 2 surface has Hopf invariant at most C^N. Let X be a closed oriented hyperbolic 3-manifold with injectivity radius less than epsilon at one point. If there is a degree non-zero map from M to X, then we prove…
Formulas for tau and epsilon concordance invariants of braided satellite knots
We develop an epsilon-controlled algebraic L-theory, extending our earlier work on epsilon-controlled algebraic K-theory. The controlled L-theory is very close to being a generalized homology theory; we study analogues of the homology exact sequence of a pair, excision properties, and the Mayer--Vietoris exact sequence…
We define a new smooth concordance homomorphism based on the knot Floer complex and an associated concordance invariant, epsilon. As an application, we show that an infinite family of topologically slice knots are independent in the smooth concordance group.
The knot Floer complex together with the associated concordance invariant epsilon can be used to define a filtration on the smooth concordance group. We show that the indexing set of this filtration contains the natural numbers cross the integers as an ordered subset.
Epsilon-machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though…
New concordance invariants phi and phi_j are defined and studied.
We define a filtration of the smooth concordance group based on the genus of representative knots. We use the Heegaard Floer epsilon and Upsilon invariants to prove the quotient groups with respect to this filtration are infinitely generated. Results are applied to three infinite families of topologically slice knots.
Paper calculates third coefficient in Kaehler-Einstein metric expansion.
The paper describes and analyzes a knot concordance invariant ε using grid homology.
Let T denote the group of smooth concordance classes of topologically sice knots. We show that the first quotient in the bipolar filtration of T (i.e. 0-bipolar knots modulo 1-bipolar knots) has infinite rank, even modulo Alexander polynomial one knots. Any 0-bipolar knot has vanishing tau-, epsilon-, and s-invariants.…
We investigate the distributions of epsilon-drawdowns and epsilon-drawups of the most liquid futures financial contracts of the world at time scales of 30 seconds. The epsilon-drawdowns (resp. epsilon- drawups) generalise the notion of runs of negative (resp. positive) returns so as to capture the risks to which invest…
Paper optimizes Bayesian optimization for complex functions with macro-actions.
We show that the complex Monge-Ampere equation on a compact Kaehler manifold (X,ω) of dimension n admits a Holder continuous omega-psh solution if and only if its right-hand side is a positive measure with Holder continuous super-potential. This property is true in particular when the measure has locally Holder continu…
We prove two theorems about homotopies of curves on 2-dimensional Riemannian manifolds. We show that, for any epsilon > 0, if two simple closed curves are homotopic through curves of bounded length L, then they are also isotopic through curves of length bounded by L + epsilon. If the manifold is orientable, then for an…
Skein lasagna module calculates 4-manifold invariants using handle decompositions.
B.-Y. Chen famously conjectured that every submanifold of Euclidean space with harmonic mean curvature vector is minimal. In this note we establish a much more general statement for a large class of submanifolds satisfying a growth condition at infinity. We discuss in particular two popular competing natural interpreta…
This paper presents a novel nonmyopic adaptive Gaussian process planning (GPP) framework endowed with a general class of Lipschitz continuous reward functions that can unify some active learning/sensing and Bayesian optimization criteria and offer practitioners some flexibility to specify their desired choices for defi…
New knots not slice in rational 4-balls found.
This article introduces both a new algorithm for reconstructing epsilon-machines from data, as well as the decisional states. These are defined as the internal states of a system that lead to the same decision, based on a user-provided utility or pay-off function. The utility function encodes some a priori knowledge ex…
We extend a result of Z. Feng and Z. Tu by showing that if one of the coefficients , , of Rawnlsey's epsilon function associated to a -dimensional Cartan-Hartogs domain is constant, then the domain is biholomorphically equivalent to the complex hyperbolic space.
Geodesics in R^n configuration spaces for points apart by epsilon.
We analyze how an observer synchronizes to the internal state of a finite-state information source, using the epsilon-machine causal representation. Here, we treat the case of exact synchronization, when it is possible for the observer to synchronize completely after a finite number of observations. The more difficult …
Inference is typically intractable in high-treewidth undirected graphical models, making maximum likelihood learning a challenge. One way to overcome this is to restrict parameters to a tractable set, most typically the set of tree-structured parameters. This paper explores an alternative notion of a tractable set, nam…
Bayesian optimization tackles unknown search spaces with automatic expansion.
Proposes a new approach to regression learning that addresses overfitting and underfitting.
For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik-Chervonenkis (VC) dimension or (ii) for every epsilon > 0 there is a finite partition pi such the pi-boundary of each set has measure at most epsilon. Immediate corollaries include the fact that a family wit…
A near-identity nilpotent pseudogroup of order m >= 1 is a family f_1, ..., f_n: (-1,1) -> R of C^2 functions for which: |f_i - id|_{C^1} < epsilon for some small positive real number epsilon < 1/10^{m+1} and commutators of the functions f_i of order at least m equal the identity. We present a classification of near-id…
Proposes a new adversarial model to avoid accuracy vs. adversarial accuracy tradeoff.
Accurately learning from user data while providing quantifiable privacy guarantees provides an opportunity to build better ML models while maintaining user trust. This paper presents a formal approach to carrying out privacy preserving text perturbation using the notion of dx-privacy designed to achieve geo-indistingui…
Despite their impressive performance, deep neural networks exhibit striking failures on out-of-distribution inputs. One core idea of adversarial example research is to reveal neural network errors under such distribution shifts. We decompose these errors into two complementary sources: sensitivity and invariance. We sh…
Compactness theorems for -solitons established with scalar curvature and potential function constraints.
The paper explores MAB strategies for very short horizons, introducing new methods and showing improved performance.
In recent years there has been an increasing interest in learning Bayesian networks from data. One of the most effective methods for learning such networks is based on the minimum description length (MDL) principle. Previous work has shown that this learning procedure is asymptotically successful: with probability one,…
Bayesian approach improves -greedy exploration in RL.
Estimates matrix trace optimization with statistical learning theory.
The regularization path of the Lasso can be shown to be piecewise linear, making it possible to "follow" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to a…
Exploiting a relationship between closed geodesics on a generic closed hyperbolic surface S and a certain unipotent flow on the product space T_1(S) x T_1(S), we obtain a local asymptotic equidistribution result for long closed geodesics on S. Applications include asymptotic estimates for the number of pants immersions…
An SU(3)- or SU(1,2)-structure on a 6-dimensional manifold N^6 can be defined as a pair of a 2-form omega and a 3-form rho. We prove that any analytic SU(3)- or SU(1,2)-structure on N^6 with d omega^2 =0 can be extended to a parallel Spin(7)- or Spin_0(3,4)-structure Phi that is defined on the trivial disc bundle N^6\t…
We introduce a Bayesian approach to discovering patterns in structurally complex processes. The proposed method of Bayesian Structural Inference (BSI) relies on a set of candidate unifilar HMM (uHMM) topologies for inference of process structure from a data series. We employ a recently developed exact enumeration of to…
We prove a squeezing/stability theorem for delta-epsilon controlled L-groups when the control map is a fibration on a finite polyhedron. A relation with boundedly-controlled L-groups is also discussed.
The paper proves smoothness of almost-minimizers' boundaries near the free boundary.
We show that eigenvalues and eigenfunctions of the Laplace-Beltrami operator on a Riemannian manifold are approximated by eigenvalues and eigenvectors of a (suitably weighted) graph Laplace operator of a proximity graph on an epsilon-net.
Quantum algorithms improve high-frequency trading efficiency.