Related papers: Bellman function sitting on a tree
In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…
In this paper, we study merge trees induced by a discrete Morse function on a tree. Given a discrete Morse function, we provide a method to constructing an induced merge tree and define a new notion of equivalence of discrete Morse…
This paper proves that in Size Theory the comparison of multidimensional size functions can be reduced to the 1-dimensional case by a suitable change of variables. Indeed, we show that a foliation in half-planes can be given, such that the…
We give an explicit formula for one possible Bellman function associated with the $L^p$ boundedness of dyadic paraproducts regarded as bilinear operators or trilinear forms. Then we apply the same Bellman function in various other settings,…
We provide some new estimates for Bellman type functions for the dyadic maximal opeator on $R^n$ and of maximal operators on martingales related to weighted spaces. Using a type of symmetrization principle, introduced for the dyadic maximal…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
In this paper, we focus on the prediction phase of a random forest and study the problem of representing a bag of decision trees using a smaller bag of decision trees, where we only consider binary decision problems on the binary domain and…
Bell inequalities bound the strength of classical correlations between observers measuring on a shared physical system. However, studies of physical correlations can be considered beyond the standard Bell scenario by networks of observers…
We strengthen H\"older's inequality. The new family of sharp inequalities we obtain might be thought of as an analog of Pythagorean theorem for the $L^p$ spaces. Our reasonings rely upon Bellman functions of four variables.
We present a simple Bellman function proof of a bilinear estimate for elliptic operators in divergence form with real coefficients and with nonnegative potentials. The constants are dimension-free. The $p$-range of applicability of this…
By using an explicit Bellman function, we prove a bilinear embedding theorem for the Laplacian associated with a weighted Riemannian manifold $(M,\mu_\phi)$ having the Bakry-Emery curvature bounded from below. The embedding, acting on the…
We give correct explicit formulas for the probabilities of rooted binary trees and cladograms under Ford's $\alpha$-model.
A novel representation is developed as a measure for multilinear fractional embedding. Corresponding extensions are given for the Bourgain-Brezis-Mironescu theorem and Pitt's inequality. New results are obtained for diagonal trace…
We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying…
The \textit{Smoothed Bellman Error Embedding} algorithm~\citep{dai2018sbeed}, known as SBEED, was proposed as a provably convergent reinforcement learning algorithm with general nonlinear function approximation. It has been successfully…
We obtain the explicit upper Bellman function for the natural dyadic maximal operator acting from ${\rm BMO}(\mathbb{R}^n)$ into ${\rm BLO}(\mathbb{R}^n).$ As a consequence, we show that the ${\rm BMO}\to{\rm BLO}$ norm of the natural…
This paper investigates the a-posteriori analysis of Branch-and-Bound~(BB) trees to extract structural information about the feasible region of mixed-binary linear programs. We introduce three novel outer approximations of the feasible…
This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons for…
Decision trees are widely used for interpretable machine learning due to their clearly structured reasoning process. However, this structure belies a challenge we refer to as predictive equivalence: a given tree's decision boundary can be…
We study the influence of the seed in random trees grown according to the uniform attachment model, also known as uniform random recursive trees. We show that different seeds lead to different distributions of limiting trees from a total…