Terra Drone's Terra A1 interceptor drone has entered active combat use in Ukraine after being deployed to a military unit tasked with countering Russian uncrewed aerial systems. Japanese drone company Terra Drone said its Terra A1 interceptor -- developed with its Ukrainian partner Amazing Drones -- has moved from the lab to the front lines, entering active combat use in Ukraine against Russian-made Shahed drones. "Deployment for defense purposes has already begun with a military unit, and evaluation and feedback collection under actual operating conditions are currently under way," the Tokyo-based firm, which recently made a strategic investment in the Ukrainian startup, said in a recent statement. Terra Drone explained that this initial "real-world operational deployment" -- carried out via its local partner -- will follow a phased rollout, where new equipment is first issued to a single unit and then expanded to further deployments depending on evaluations from the field. In a time of both misinformation and too much information, quality journalism is more crucial than ever.

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for computationally efficient recovery methods. As a consequence, even though it is in general NP-hard to check that RIP holds, there have been substantial efforts to find tractable proxies for it. These would allow the construction of RIP matrices and the polynomial-time verification of RIP given an arbitrary matrix. We consider the framework of average-case certifiers, that never wrongly declare that a matrix is RIP, while being often correct for random instances. While there are such functions which are tractable in a suboptimal parameter regime, we show that this is a computationally hard task in any better regime. Our results are based on a new, weaker assumption on the problem of detecting dense subgraphs.

We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number of steps sublinear in the number of data points N, namely O( N). The second algorithm illustrates how the classical mistake bound of O( 1γ2) can be further improved to O( 1 γ) through quantum means, where γ denotes the margin. Such improvements are achieved through the application of quantum amplitude amplification to the version space interpretation of the perceptron model.

We study the problem of completing a binary matrix in an online learning setting. On each trial we predict a matrix entry and then receive the true entry. We propose a Matrix Exponentiated Gradient algorithm [1] to solve this problem. We provide a mistake bound for the algorithm, which scales with the margin complexity [2, 3] of the underlying matrix. The bound suggests an interpretation where each row of the matrix is a prediction task over a finite set of objects, the columns. Using this we show that the algorithm makes a number of mistakes which is comparable up to a logarithmic factor to the number of mistakes made by the Kernel Perceptron with an optimal kernel in hindsight. We discuss applications of the algorithm to predicting as well as the best biclustering and to the problem of predicting the labeling of a graph without knowing the graph in advance.

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

Neural Information Processing Systems http://nips.cc/

Many manifold learning algorithms aim to create embeddings with low or no distortion (isometric). If the data has intrinsic dimension d, it is often impossible to obtain an isometric embedding in ddimensions, but possible in s > ddimensions. Yet, most geometry preserving algorithms cannot do the latter. This paper proposes an embedding algorithm to overcome this. The algorithm accepts as input, besides the dimension d, an embedding dimension s d.

Taiwan President Lai Ching-te has cancelled a presidential trip to the African nation of Eswatini, accusing Beijing of putting pressure on its neighbours to bar his aircraft from flying over their territories. Seychelles, Mauritius and Madagascar revoked Lai's overflight permits after intense pressure and economic coercion from China, said a Taiwan official. China denied coercion, while praising the three African countries saying it had high appreciation for them. This is the first publicly known instance where a Taiwanese leader has had to cancel a foreign trip due to revoked flight permits. Eswatini, formerly known as Swaziland, is Taiwan's only diplomatic ally in Africa.