arXiv research

We consider a multiobjective multiarmed bandit problem with lexicographically ordered objectives. In this problem, the goal of the learner is to select arms that are lexicographic optimal as much as possible without knowing the arm reward distributions beforehand. We capture this goal by defining a multidimensional for…

We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp…

We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This allows us to transform this problem into a study of real algebraic trigonal plane c…

We provide foundations for decisions in face of unlikely events by extending the standard framework of Savage to include preferences indexed by a family of events. We derive a subjective lexicographic expected utility representation which allows for infinitely many lexicographically ordered levels of events and for eve…

The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and study the proportion of elements of length $k$ whose maximal lexicographic repres…

The paper proposes a method to infer multi-objective rewards from preferences.

New fairness concept extends minimax fairness to lexicographic fairness.

The study explores properties and mutations in oriented matroids, proving new results on Euclidean and non-Euclidean structures.

DFL framework improves action and outcome fairness in policy learning.

We introduce a rich model for multi-objective clustering with lexicographic ordering over objectives and a slack. The slack denotes the allowed multiplicative deviation from the optimal objective value of the higher priority objective to facilitate improvement in lower-priority objectives. We then propose an algorithm …

With an eye toward understanding complexity control in deep learning, we study how infinitesimal regularization or gradient descent optimization lead to margin maximizing solutions in both homogeneous and non-homogeneous models, extending previous work that focused on infinitesimal regularization only in homogeneous mo…

New connection found between shape reconstruction methods and persistent homology.

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of configuration spaces of distinct unordered points in X. We show that the finite subset …

Let N and P be smooth manifolds of dimensions n and p (n>=p>=2). Let Omega^{I}(N,P) denote an open subspace of J(N,P) which consists of all Boardman submanifolds Sigma^{J}(N,P) with J=< I in the lexicographic order. We will prove the homotopy principle in the existence level for Omega^{I}(N,P).

New theory for nonsmooth systems helps optimize and control complex functions.

Groups with specific curvature have a regular language of geodesics.

Proof shows imitation of expert's reward and solutions in multi-objective optimization.

We introduce a method for creating a special type of tree, called a tree position, from a weighted graph. Leaves of the tree correspond to vertices of the original graph, and the tree edges contain information which can be used to partition these vertices. By repeatedly applying reducing operations to the tree position…

Let $N$ and $P$ be smooth closed manifolds of dimensions $n$ and $p$ respectively. Given a Thom-Boardman symbol $I$, a smooth map $f:N\to P$ is called an $Ω^{I}$-regular map if and only if the Thom-Boardman symbol of each singular point of $f$ is not greater than $I$ in the lexicographic order. We will represent the gr…

In the following text we compute possible heights of $\mathbb A$ (Alexandroff square), $\mathbb O$ (unit square $[0,1]\times[0,1]$ with lexicographic order topology) and $\mathbb U$ (unit square $[0,1]\times[0,1]$ with induced topology of Euclidean plane). We prove $P_h(\mathbb{A})=\{n:n\geq5\}\cup\{+\infty\}$, $P_h(\m…

New method allows backtesting of systemic risk forecasts.

Study a specific line arrangement and compute its fundamental group via braid monodromy.

Deep learning agent improves pedestrian navigation in urban environments.

Given a compact geodesic space $X$ we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or Čech filtration of $X$ to obtain what we call a persistence. This paper contains the theory describing such persistence: properties of the set of critical points, their preci…

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic $l_1$-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

Motivated by analogies with basic density theorems in analytic number theory, we introduce a notion (and variations) of the homological density of one space in another. We use Weil's number field/ function field analogy to predict coincidences for limiting homological densities of various sequences $\mathcal{Z}^{(d_1,\…

The paper finds formulas for word lengths and conjugacy classes in surface groups.

We present a new procedure to determine the growth function of a homogeneous Garside monoid, with respect to the finite generating set formed by the atoms. In particular, we present a formula for the growth function of each Artin--Tits monoid of spherical type (hence of each braid monoid) with respect to the standard g…

This work tackles asymmetric community estimation in multi-layer directed networks.

New RL algorithm ensures stable, replicable policies.

Proves HNN extensions of nilpotent groups are left-orderable, constructs non-left-orderable examples.

Examines differential smoothness in a specific skew PBW extension family.

New insights into identifying mixtures of product distributions using Hadamard extensions.

A spacetime can be embedded in an enveloping space with all its extensions.

We give a new variant of $L^2$-extension theorem for the jets of holomorphic sections and discuss the relation between the extension problem of singular Hermitian metrics with semipositive curvature.

We generalize the prequantization central extension of a group of diffeomorphisms preserving a closed 2-form ω(ω-invariant diffeomorphisms) to an abelian extension of a group of diffeomorphisms preserving a closed vector valued 2-form ω, up to a linear isomorphism (ω-equivariant diffeomorphisms). Every abelian extensio…

The purpose of this paper is to show how central extensions of (possibly infinite-dimensional) Lie algebras integrate to central extensions of étale Lie 2-groups. In finite dimensions, central extensions of Lie algebras integrate to central extensions of Lie groups, a fact which is due to the vanishing of π_2 for each …

We construct a Kruskal-Szekeres-type analytic extension of the Emparan-Reall black ring, and investigate its geometry. We prove that the extension is maximal, globally hyperbolic, and unique within a natural class of extensions. The key to those results is the proof that causal geodesics are either complete, or approac…

Analytic linearization and holomorphic extensions for proper groupoids.

We study the properties of Modified Riemann extensions evolving under Ricci flow. We obtain the necessary and sufficient condition for modified Riemann extension under Ricci flow to stay as modified Riemann extension. We also discuss the properties of the curvature tensors under Ricci flow.

Let $X=\mathbf{X}\cup\mathbf{Z}$ be a data set in $\mathbb{R}^D$, where $\mathbf{X}$ is the training set and $\mathbf{Z}$ is the test one. Many unsupervised learning algorithms based on kernel methods have been developed to provide dimensionality reduction (DR) embedding for a given training set $Φ: \mathbf{X} \to \mat…

The paper examines differential smoothness in skew PBW extensions over polynomial rings.

Simple construction of Lie 2-groups from loop group extensions.

Proves Girth Alternative for some HNN extensions, finds counterexamples.

We determine the universal central extension of the Lie algebra of hamiltonian vector fields, thereby classifying its central extensions. Furthermore, we classify the central extensions of the Lie algebra of symplectic vector fields, of the Poisson Lie algebra, and of its compactly supported version.

Kan extensions help in data science extrapolation and learning.

Optimal L2 extension theorem for holomorphic vector bundles with singular metrics.

The paper solves conditions for non-singular extensions of fold maps.