Related papers: Constructing Sequences One Step at a Time
Contrastive learning is a powerful framework for learning self-supervised representations that generalize well to downstream supervised tasks. We show that multiple existing contrastive learning methods can be reinterpreted as learning…
Classical convergence theory of Runge-Kutta methods assumes that the time step is small relative to the Lipschitz constant of the ordinary differential equation (ODE). For stiff problems, that assumption is often violated, and a problematic…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…
Counterfactual explanations provide ways of achieving a favorable model outcome with minimum input perturbation. However, counterfactual explanations can also be leveraged to reconstruct the model by strategically training a surrogate model…
In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…
This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a new judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence…
Counterfactual explanation generation is a powerful method for Explainable Artificial Intelligence. It can help users understand why machine learning models make specific decisions, and how to change those decisions. Evaluating the…
A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…
Winograd Schema Challenge (WSC) was proposed as an AI-hard problem in testing computers' intelligence on common sense representation and reasoning. This paper presents the new state-of-theart on WSC, achieving an accuracy of 71.1%. We…
According to the well-known loop shaping method for the design of controllers, the performance of the controllers in terms of step response, steady-state disturbance rejection and noise attenuation and robustness can be improved by…
In this article, we fill a gap in the literature on Hawkes processes. In particular, we derive a CLT for a non linear compound marked Hawkes process. We also provide an upper bound on the convergence rate using the functional 1-Wasserstein…
We prove a criterion that allows to construct units in product systems of correspondences with prescribed infinitesimal characterizations. This criterion summarizes proofs of known results and new applications. It also frees the hypothesis…
The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…
The field of Quantum Machine Learning (QML) has emerged recently in the hopes of finding new machine learning protocols or exponential speedups for classical ones. Apart from problems with vanishing gradients and efficient encoding methods,…
The calculus of constructions (CC) is a core theory for dependently typed programming and higher-order constructive logic. Originally introduced in Coquand's 1985 thesis, CC has inspired 25 years of research in programming languages and…
Extending a method developed by Koszmider and Laustsen for constructing $C(K)$-spaces we produce families of $C(K)$-spaces with few operators relative to a partially ordered set $\mathcal{P}$. Using these spaces, we construct new…
We introduce and study the noncommutative weak Extension Principle, a lifting principle aiming to characterise $^*$-homomorphisms between coronas of nonunital separable $\mathrm{C}^*$-algebras. While this principle fails if the Continuum…
A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…
We consider conditions which force a well-quasi-ordered poset (wqo) to be better-quasi-ordered (bqo). In particular we obtain that if a poset $P$ is wqo and the set $S_{\omega}(P)$ of strictly increasing sequences of elements of $P$ is bqo…