Related papers: On Selective Unboundedness of VASS
We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…
Consider the problem of learning a large number of response functions simultaneously based on the same input variables. The training data consist of a single independent random sample of the input variables drawn from a common distribution…
In this paper, we have investigated the generalized Wiener space of bounded variation with $p$-variable. Various results are obtained such as uniform convexity and reflexivity, there was characterized the set of points of discontinuity of…
We consider the most common variants of linear regression, including Ridge, Lasso and Support-vector regression, in a setting where the learner is allowed to observe only a fixed number of attributes of each example at training time. We…
In our recent work \cite{StojnicCSetam09} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved that if the number of equations in the system is…
We give a variational proof of the existence and uniqueness of a convex cap with the given upper boundary. The proof uses the concavity of the total scalar curvature functional on the space of generalized convex caps. As a byproduct, we…
Vectors addition systems with states (VASS), or equivalently Petri nets, are arguably one of the most studied formalisms for the modeling and analysis of concurrent systems. A central decision problem for VASS is reachability: whether there…
We continue to investigate cases when the Repov\v{s}-Semenov splitting problem for selections has an affirmative solution for continuous set-valued mappings. We consider the situation in infinite-dimensional uniformly convex Banach spaces.…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
We study the properties of "generic", in the sense of the Haar measure on the corresponding Grassmann manifold, subspaces of l^N_infinity of given dimension. We prove that every "well bounded" operator on such a subspace, say E, is a…
We consider the problem of automatically proving resource bounds. That is, we study how to prove that an integer-valued resource variable is bounded by a given program expression. Automatic resource-bound analysis has recently received…
This article is devoted to the analysis of inverse source problems for Stokes systems in unbounded domains where the corresponding velocity flow is observed on a surface. Our main objective is to study the unique determination of general…
We consider a variant of online convex optimization in which both the instances (input vectors) and the comparator (weight vector) are unconstrained. We exploit a natural scale invariance symmetry in our unconstrained setting: the…
Incompressible fluid equations are studied with UV cut-off and in periodic boundary conditions. Properties of the resulting ODEs holding uniformly in the cut-off are considered and, in particular, are conjectured to be equivalent to…
We describe methods for proving upper and lower bounds on infinite-time averages in deterministic dynamical systems and on stationary expectations in stochastic systems. The dynamics and the quantities to be bounded are assumed to be…
We give two provably accurate feature-selection techniques for the linear SVM. The algorithms run in deterministic and randomized time respectively. Our algorithms can be used in an unsupervised or supervised setting. The supervised…
The reachability problem for vector addition systems with states (VASS) has been shown to be \textsc{Ackermann}-complete. For every $k\geq 3$, a completeness result for the $k$-dimensional VASS reachability problem is not yet available. It…
Directed and undirected graphical models, also called Bayesian networks and Markov random fields, respectively, are important statistical tools in a wide variety of fields, ranging from computational biology to probabilistic artificial…
An $\mathsf{F}_{d}$ upper bound for the reachability problem in vector addition systems with states (VASS) in fixed dimension is given, where $\mathsf{F}_d$ is the $d$-th level of the Grzegorczyk hierarchy of complexity classes. The new…
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest is the sample complexity: the number of samples required to…