ParamBoost uses gradient boosting to create interpretable non-linear models with constraints.
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.
Trend · papers per month
Solves infinite family of cubic polynomial problems.
We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero. The golden identity for the flow polynomial is conjectured to characterize …
We give a generalization of the well-known result of E. Cartan on isoparametric cubics by showing that a homogeneous cubic polynomial solution of the eiconal equation must be rotationally equivalent to either , or to one of four exceptional Cartan cubic polynomials…
Deep neural networks with piecewise-polynomial activations can approximate smooth functions and their derivatives.
The affine sphere construction gives, on any oriented surface, a one-to-one correspondence between convex -structures and holomorphic cubic differentials. Generalizing results of Benoist-Hulin, Loftin and Dumas-Wolf, we show that poles of order less than of cubic differentials correspond to finite vo…
The aim of this paper is to define two link invariants satisfying cubic skein relations. In the hierarchy of polynomial invariants determined by explicit skein relations they are the next level of complexity after Jones, HOMFLY, Kauffman and Kuperberg's quantum invariants. Our method consists in the study of Mark…
Study polynomial cubic differentials on Riemann surfaces using spectral networks.
The paper studies 8D manifolds with a specific tensor field called a cubic discriminant.
We construct and study a natural homeomorphism between the moduli space of polynomial cubic differentials of degree d on the complex plane and the space of projective equivalence classes of oriented convex polygons with d+3 vertices. This map arises from the construction of a complete hyperbolic affine sphere with pres…
We construct two infinite families of algebraic minimal cones in . The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one correspondence with those of geometrically equivalent Clifford systems. As a byp…
We study algebraic varieties of ReLU networks to understand their representable functions.
Paper proposes algorithms to accurately identify breakpoints in piecewise regression.
Cubic complexes appear in the theory of finite type invariants so often that one can ascribe them to basic notions of the theory. In this paper we begin the exposition of finite type invariants from the `cubic' point of view. Finite type invariants of knots and homology 3-spheres fit perfectly into this conception. In …
There is considered the problem of describing up to linear conformal equivalence those harmonic cubic homogeneous polynomials for which the squared-norm of the Hessian is a nonzero multiple of the quadratic form defining the Euclidean metric. Solutions are constructed in all dimensions and solutions are classified in d…
We define a finite-dimensional cubic quotient of the group algebra of the braid group, endowed with a (essentially unique) Markov trace which affords the Links-Grould invariant of knots and links. We investigate several of its properties, and state several conjectures about its structure.
New knots share same Upsilon invariant despite different Alexander polynomials.
New algorithm reduces dynamic regret for noisy gradient feedback with piecewise polynomial comparators.
We consider non-degenerate graph immersions into affine space whose cubic form is parallel with respect to the Levi-Civita connection of the affine metric. There exists a correspondence between such graph immersions and pairs , where is an -dimensional real Jordan algebra and is a no…
Proposed by Donoho (1997), Dyadic CART is a nonparametric regression method which computes a globally optimal dyadic decision tree and fits piecewise constant functions in two dimensions. In this article we define and study Dyadic CART and a closely related estimator, namely Optimal Regression Tree (ORT), in the contex…
This paper introduces a novel mixture model-based approach for simultaneous clustering and optimal segmentation of functional data which are curves presenting regime changes. The proposed model consists in a finite mixture of piecewise polynomial regression models. Each piecewise polynomial regression model is associat…
Piecewise polynomial interpolation-based gradient descent reduces oracle complexity for smooth loss functions.
Study of cubic skein modules in 3-sphere and arbitrary 3-manifolds.
New algorithm predicts piecewise regular functions online.
Sample- and computationally-efficient distribution estimation is a fundamental tenet in statistics and machine learning. We present SURF, an algorithm for approximating distributions by piecewise polynomials. SURF is: simple, replacing prior complex optimization techniques by straight-forward {empirical probability} ap…
The paper approximates Levi-Civita connection and curvature on 2D manifolds using finite elements.
The Penrose-Kauffman polynomial connects knot theory to graph coloring.
The classical Tait-Kneser theorem states that the osculating circles of a smooth plane curve, free from curvature extrema, are pairwise disjoint. We prove a number of analogs of this theorem, e.g., for ovals of osculating cubics, osculating polynomials and trigonometric polynomials; in each case, we will obtain a non-d…
In this paper we considerably extend the class of known -minimizing hypercones using sub-calibration methods. Indeed, the improvement of previous results follows from a careful analysis of special cubic and quartic polynomials.
Efficiently finds sparse solutions to max-plus equations for convex regression.
We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let be an arbitrary distribution over an interval which is -close (in total variation distance) to an unknown probability distribution $…
Paper develops algorithms for PWA systems with polynomial regret.
The study describes special real manifolds and invariant admissible cubics in Vinberg cones.
The study describes a cell structure for multisets in a rectangle.
We present a new, unifying approach following some recent developments on the complexity of neural networks with piecewise linear activations. We treat neural network layers with piecewise linear activations as tropical polynomials, which generalize polynomials in the so-called or tropical algebra, with pos…
We connect the algebraic geometry and representation theory associated to Freudenthal's magic square. We give unified geometric descriptions of several classes of orbit closures, describing their hyperplane sections and desingularizations, and interpreting them in terms of composition algebras. In particular, we show h…
Constructs finite element spaces for -forms, excluding one subspace.
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of ribbon graphs. We describe an extension of the flow polynomial to virtual graphs, t…
In this text we give a decomposition result on polynomial poly-vector fields generalizing a result on the decomposition of homogeneous Poisson structures. We discuss consequences of this decomposition result in particular for low dimensions and low degrees. We provide the tools to calculate simple cubic Poisson structu…
In many applications, data is collected in batches, some of which are corrupt or even adversarial. Recent work derived optimal robust algorithms for estimating discrete distributions in this setting. We consider a general framework of robust learning from batches, and determine the limits of both classification and dis…
We propose a purely algebraic approach to construct invariants of transversal links in the standard contact structure on the 3-sphere generalizing Jones' approach to invariant of usual links. The only geometry used is the analogue of Alexander and Markov theorems. More precisely, we construct a trace on a certain cubic…
New skein theory for Links-Gould polynomial simplifies link evaluations.
We classify Dehn functions of Bestvina-Brady groups.
It has been proved that on 2-dimensional orientable compact manifolds of genus there is no integrable geodesic flow with an integral polynomial in momenta. There is a conjecture that all integrable geodesic flows on possess an integral quadratic in momenta. All geodesic flows on and possessing i…
Minimal surfaces with isothermal parameters admitting Bézier representation were studied by Cosin and Monterde. They showed that, up to an affine transformation, the Enneper surface is the only bi-cubic isothermal minimal surface. Here we study bi-quartic isothermal minimal surfaces and establish the general form of th…
Wide networks with polynomial activations have proven asymptotic behavior.
The paper studies geometric structures of polynomial spaces.
Associated to any finite flag complex L there is a right-angled Coxeter group W_L and a cubical complex Σ_L on which W_L acts properly and cocompactly. Its two most salient features are that (1) the link of each vertex of Σ_L is L and (2) Σ_L is contractible. It follows that if L is a triangulation of S^{n-1}, then Σ_L…