robustness condition
Recently Published Documents


TOTAL DOCUMENTS

8
(FIVE YEARS 3)

H-INDEX

2
(FIVE YEARS 0)

2021 ◽  
Author(s):  
◽  
Ben Clark

<p>A tangle of order k in a connectivity function λ may be thought of as a "k-connected component" of λ. For a connectivity function λ and a tangle in λ of order k that satisfies a certain robustness condition, we describe a tree decomposition of λ that displays, up to a certain natural equivalence, all of the k-separations of λ that are non-trivial with respect to the tangle. In particular, for a tangle in a matroid or graph of order k that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or graph that displays, up to a certain natural equivalence, all of the k- separations of the matroid or graph that are non-trivial with respect to the tangle.</p>


2021 ◽  
Author(s):  
◽  
Ben Clark

<p>A tangle of order k in a connectivity function λ may be thought of as a "k-connected component" of λ. For a connectivity function λ and a tangle in λ of order k that satisfies a certain robustness condition, we describe a tree decomposition of λ that displays, up to a certain natural equivalence, all of the k-separations of λ that are non-trivial with respect to the tangle. In particular, for a tangle in a matroid or graph of order k that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or graph that displays, up to a certain natural equivalence, all of the k- separations of the matroid or graph that are non-trivial with respect to the tangle.</p>


2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Maurice Weber ◽  
Nana Liu ◽  
Bo Li ◽  
Ce Zhang ◽  
Zhikuan Zhao

AbstractQuantum machine learning models have the potential to offer speedups and better predictive accuracy compared to their classical counterparts. However, these quantum algorithms, like their classical counterparts, have been shown to also be vulnerable to input perturbations, in particular for classification problems. These can arise either from noisy implementations or, as a worst-case type of noise, adversarial attacks. In order to develop defense mechanisms and to better understand the reliability of these algorithms, it is crucial to understand their robustness properties in the presence of natural noise sources or adversarial manipulation. From the observation that measurements involved in quantum classification algorithms are naturally probabilistic, we uncover and formalize a fundamental link between binary quantum hypothesis testing and provably robust quantum classification. This link leads to a tight robustness condition that puts constraints on the amount of noise a classifier can tolerate, independent of whether the noise source is natural or adversarial. Based on this result, we develop practical protocols to optimally certify robustness. Finally, since this is a robustness condition against worst-case types of noise, our result naturally extends to scenarios where the noise source is known. Thus, we also provide a framework to study the reliability of quantum classification protocols beyond the adversarial, worst-case noise scenarios.


2015 ◽  
Vol 80 (2) ◽  
pp. 450-476 ◽  
Author(s):  
ALBERT ATSERIAS ◽  
MORITZ MÜLLER ◽  
SERGI OLIVA

AbstractThe relativized weak pigeonhole principle states that if at least 2n out of n2 pigeons fly into n holes, then some hole must be doubly occupied. We prove that every DNF-refutation of the CNF encoding of this principle requires size $2^{\left( {{\rm{log\ }}n} \right)^{3/2 - \varepsilon } } $ for every ε﹥0 and every sufficiently large n. By reducing it to the standard weak pigeonhole principle with 2n pigeons and n holes, we also show that this lower bound is essentially tight in that there exist DNF-refutations of size $2^{\left( {{\rm{log\ }}n} \right)^{O\left( 1 \right)} } $ even in R(log). For the lower bound proof we need to discuss the existence of unbalanced low-degree bipartite expanders satisfying a certain robustness condition.


Author(s):  
Fernando J. O. Moreira ◽  
José Roberto de França Arruda ◽  
Daniel J. Inman

Abstract In this paper the design of a low order controller for a high-order, smart structural system is presented. The application considered here is a model of a solar panel dynamically similar to those used on satellites. Smart structure refers here to the use of integrated piezoceramic materials as sensors and actuators in the structural system in order to implement the control. The theoretical contribution is made be extending well known robust control theory by relating the high frequency robustness condition to the residual uncertainty, removing a trial and error step in the normal robust control design. The procedure is applied experimentally to a one-meter long frame that is coupled in bending and torsion. Both numerical and experimental results are given.


Sign in / Sign up

Export Citation Format

Share Document