OT 060420: A Seemingly Optical Transient Recorded by All-Sky Cameras

We report on a ~5th magnitude flash detected for approximately 10 minutes by two CONCAM all-sky cameras located in Cerro Pachon - Chile and La Palma - Spain. A third all-sky camera, located in Cerro Paranal - Chile did not detect the flash, and therefore the authors of this paper suggest that the flash was a series of cosmic-ray hits, meteors, or satellite glints. Another proposed hypothesis is that the flash was an astronomical transient with variable luminosity. In this paper we discuss bright optical transient detection using fish-eye all-sky monitors, analyze the apparently false-positive optical transient, and propose possible causes to false optical transient detection in all-sky cameras.Comment: 7 figures, 3 tables, accepted PAS

Chiral Fermions on the Lattice through Gauge Fixing -- Perturbation Theory

We study the gauge-fixing approach to the construction of lattice chiral gauge theories in one-loop weak-coupling perturbation theory. We show how infrared properties of the gauge degrees of freedom determine the nature of the continuous phase transition at which we take the continuum limit. The fermion self-energy and the vacuum polarization are calculated, and confirm that, in the abelian case, this approach can be used to put chiral gauge theories on the lattice in four dimensions. We comment on the generalization to the nonabelian case.Comment: 31 pages, 5 figures, two refs. adde

A Protocol for Generating Random Elements with their Probabilities

We give an AM protocol that allows the verifier to sample elements x from a probability distribution P, which is held by the prover. If the prover is honest, the verifier outputs (x, P(x)) with probability close to P(x). In case the prover is dishonest, one may hope for the following guarantee: if the verifier outputs (x, p), then the probability that the verifier outputs x is close to p. Simple examples show that this cannot be achieved. Instead, we show that the following weaker condition holds (in a well defined sense) on average: If (x, p) is output, then p is an upper bound on the probability that x is output. Our protocol yields a new transformation to turn interactive proofs where the verifier uses private random coins into proofs with public coins. The verifier has better running time compared to the well-known Goldwasser-Sipser transformation (STOC, 1986). For constant-round protocols, we only lose an arbitrarily small constant in soundness and completeness, while our public-coin verifier calls the private-coin verifier only once

Analysis of Different Types of Regret in Continuous Noisy Optimization

The performance measure of an algorithm is a crucial part of its analysis. The performance can be determined by the study on the convergence rate of the algorithm in question. It is necessary to study some (hopefully convergent) sequence that will measure how "good" is the approximated optimum compared to the real optimum. The concept of Regret is widely used in the bandit literature for assessing the performance of an algorithm. The same concept is also used in the framework of optimization algorithms, sometimes under other names or without a specific name. And the numerical evaluation of convergence rate of noisy algorithms often involves approximations of regrets. We discuss here two types of approximations of Simple Regret used in practice for the evaluation of algorithms for noisy optimization. We use specific algorithms of different nature and the noisy sphere function to show the following results. The approximation of Simple Regret, termed here Approximate Simple Regret, used in some optimization testbeds, fails to estimate the Simple Regret convergence rate. We also discuss a recent new approximation of Simple Regret, that we term Robust Simple Regret, and show its advantages and disadvantages.Comment: Genetic and Evolutionary Computation Conference 2016, Jul 2016, Denver, United States. 201