Graph connection Laplacian methods can be made robust to noise
نویسندگان
چکیده
منابع مشابه
Can Real-Time Local Area Network Protocols Be Made Robust?
This paper proposes a formal definition of the robustness property which, we believe, developers of future real-time (RT) local area network (LAN) protocols must aim to realize. A s a demonstration of the utility of this definition, the Carrier Sense Mult iple Access with Deterministic Collision Resolution (CSMA/DCR) protocol is then analyzed for its robustness and an extension of the CSMA/DCR ...
متن کاملCan Gaussian Process Regression Be Made Robust Against Model Mismatch?
Learning curves for Gaussian process (GP) regression can be strongly affected by a mismatch between the ‘student’ model and the ‘teacher’ (true data generation process), exhibiting e.g. multiple overfitting maxima and logarithmically slow learning. I investigate whether GPs can be made robust against such effects by adapting student model hyperparameters to maximize the evidence (data likelihoo...
متن کاملA Cheeger Inequality for the Graph Connection Laplacian
The O(d) Synchronization problem consists of estimating a set of unknown orthogonal transformations Oi from noisy measurements of a subset of the pairwise ratios OiO −1 j . We formulate and prove a Cheegertype inequality that relates a measure of how well it is possible to solve the O(d) synchronization problem with the spectra of an operator, the graph Connection Laplacian. We also show how th...
متن کاملHow Can Java Be Made Blind-Friendly
The widely used and highly popular Java programming language is proved to be a great tool for developing platform independent applications. Everyday users mostly encounter them when using portable devices (mobile phones, PDAs, etc). However, the ordinary Java applications are inaccessible for the blind in general. Even the most used screen readers can only be enabled to handle GUI elements of a...
متن کاملTimed Automata Can Always Be Made Implementable
Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clocks. Since this hypothesis does not hold in digital systems, properties proven formally on a timed automaton may be lost at implementation. In order to ensure implementability, several approaches have been considered, corresponding to different hypotheses on the implementation platform. We addres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2016
ISSN: 0090-5364
DOI: 10.1214/14-aos1275