Related papers: Greedy and lazy representations in negative base s…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
We consider parametrized linear-quadratic optimal control problems and provide their online-efficient solutions by combining greedy reduced basis methods and machine learning algorithms. To this end, we first extend the greedy control…
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent LP rounding algorithms and a hybrid algorithm…
To resolve conflicts among norms, various nonmonotonic formalisms can be used to perform prioritized normative reasoning. Meanwhile, formal argumentation provides a way to represent nonmonotonic logics. In this paper, we propose a…
In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
We study periodic expansions in positional number systems with a base $\beta\in\C,\ |\beta|>1$, and with coefficients in a finite set of digits $\A\subset\C.$ We are interested in determining those algebraic bases for which there exists…
The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this…
Sequence models are a critical component of modern NLP systems, but their predictions are difficult to explain. We consider model explanations though rationales, subsets of context that can explain individual model predictions. We find…
A route to evaluate exact sums represented by Dirichlet eta and beta functions, both of which are alternating and divergent at negative integer arguments, is advocated. It rests on precise polynomial extrapolations and stands as a…
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for…
A positional numeration system is given by a base and by a set of digits. The base is a real or complex number $\beta$ such that $|\beta|>1$, and the digit set $A$ is a finite set of digits including $0$. Thus a number can be seen as a…
In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…
Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the…
The Column Subset Selection Problem provides a natural framework for unsupervised feature selection. Despite being a hard combinatorial optimization problem, there exist efficient algorithms that provide good approximations. The drawback of…
Finding minimum dominating set and maximum independent set for graphs in the classical online setup are notorious due to their disastrous $\Omega(n)$ lower bound of the competitive ratio that even holds for interval graphs, where $n$ is the…
We give an explicit expression for the invariant measure, absolutely continuous with respect to the Lebesgue measure, of the greedy beta-transformation with three deleted digits. We define a version of the natural extension of the…
For the classical maximum coverage problem, the greedy algorithm achieves a worst-case $1-1/e$ approximation, which is optimal unless $\text{P} = \text{NP}$. The notion of coverage appears in a wide range of optimization tasks, where…
In many prediction problems, it is not uncommon that the number of variables used to construct a forecast is of the same order of magnitude as the sample size, if not larger. We then face the problem of constructing a prediction in the…