Due to the significant progress in automated verification, there are often several techniques for a particular verification problem. In many circumstances different techniques are complementary — each technique works well for different type of input instances. Unfortunately, it is not clear how to choose an appropriate technique for a specific instance of a problem. In this work we argue that t...

The RoboCup simulated soccer league is a dynamic, complex and uncertain environment which presents many challenges to machine learning techniques. The asynchronous design of the RoboCup simulation environment can create long and unpredictable delays in the effects of actions, often causing onerous training times. A new environment known as Simple Soccer is proposed which, while retaining much o...

Asynchronous FTRL and L2 norm done at server are two widely used tricks to improve training efficiency, but their convergences are not well-proved. In this paper, we propose asynchronous COMID algorithm and prove its convergence. Then, we establish the equivalence between asynchronous COMID and the above two tricks. Thus, the convergences of above two tricks are also proved. Experimental result...

This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Our main result generalizes Buchi's theorem for nite words t...

This work presents a technique for the analysis of Facial Electromyogram signal activities to classify five different facial expressions for Computer-Muscle Interfacing applications. Facial Electromyogram (FEMG) is a technique for recording the asynchronous activation of neuronal inside the face muscles with non-invasive electrodes. FEMG pattern recognition is a difficult task for the researche...

Content: 1. Clocks and Logic. 2. Turing Machines and the distinction between Hardware and Software 3. Simulating Turing Machines by Clocks. 4. Finite representations in Physics and in Metamathematics. 5. Mathematics as an open system. 6. Interactive, asynchronous and distributed computing. 7. Plasticity and the wet brain. 8. Implicit Mathematics APPENDIX: More on the proofs of unprovable propos...

As datasets continue to increase in size and multi-core computer architectures are developed, asynchronous parallel optimization algorithms become more and more essential to the field of Machine Learning. Unfortunately, conducting the theoretical analysis asynchronous methods is difficult, notably due to the introduction of delay and inconsistency in inherently sequential algorithms. Handling t...

We study optimization algorithms based on variance reduction for stochastic gradient descent (SGD). Remarkable recent progress has been made in this direction through development of algorithms like SAG, SVRG, SAGA. These algorithms have been shown to outperform SGD, both theoretically and empirically. However, asynchronous versions of these algorithms—a crucial requirement for modern large-scal...

Compositional verification provides a way for deducing properties of a complete program from properties of its constituents. In particular, the assume-guarantee style of reasoning splits a specification into assumptions and guarantees according to a given inference rule and the generation of assumptions through machine learning makes the automatic reasoning possible. However, existing works are...

Our concern is the design of provably correct asynchronous circuits. In such circuits there may occur hazards, due to the delay of signals along wires and components. Informally, a hazard is a time interval during which the output of a circuit, or circuit component, is wrong. Hazards are hardly ever de ned formally in the literature. For a synchronous circuit designer this might be no problem a...