A recent attack on Sam Altman's home and OpenAI offices has put corporate security under renewed scrutiny. Records reveal how much some tech firms spend to arm up. Elon Musk called violent crime in San Francisco " horrific " and moved the offices of his social media business X outside the city in 2024 because of safety and business considerations. Other local tech companies have attempted to address their security concerns by partnering directly with cops. Airbnb and Salesforce are among businesses that for years have contracted San Francisco police to protect their offices on a regular basis, according to public records obtained by WIRED.

Recent work has demonstrated the effectiveness of formulating decision making as supervised learning on offline-collected trajectories. Powerful sequence models, such as GPT or BERT, are often employed to encode the trajectories. However, the benefits of performing sequence modeling on trajectory data remain unclear. In this work, we investigate whether sequence modeling has the ability to condense trajectories into useful representations that enhance policy learning. We adopt a two-stage framework that first leverages sequence models to encode trajectory-level representations, and then learns a goal-conditioned policy employing the encoded representations as its input.

If observations from the joint distribution of (A,Y,Z,W) are available in both stages, we can tune the regularization parameters λ1,λ2 using the approach proposed in Singh et al. [30], Xu et al. [35]. Let the complete data of stage 1 and stage 2 be denoted as (ai,yi,zi,wi) and ( ai, yi, zi, wi). Then, we can use the data not used in each stage to evaluate the out-of-sample performance of the other stage. A(2), ˆV(T),u(T) are the learned parameters by Algorithm 1. In this appendix, we prove propositions given in the main text. In the following, we assume that the spaces U, A, Z,W are separable and completely metrizable topological spaces and equipped with Borel σ-algebras. In this section, we use the notation PA|Z=z to express the distribution of a random variable Agiven another variable Z = z.

We study the problem of meta-learning, which has proved to be advantageous to accelerate learning new tasks with a few samples. The recent approaches based on deep kernels achieve the state-of-the-art performance. However, the regularizers in their base learners are not learnable. In this paper, we propose an algorithm called MetaProx to learn a proximal regularizer for the base learner. We theoretically establish the convergence of MetaProx. Experimental results confirm the advantage of the proposed algorithm.

However, their performance often hinges on high-quality node labels, which are challenging to obtain in real-world scenarios due to unreliable sources or adversarial attacks. Consequently, label noise is common in real-world graph data, negatively impacting GNNs by propagating incorrect information during training. To address this issue, the study of Graph Neural Networks under Label Noise (GLN) has recently gained traction. However, due to variations in dataset selection, data splitting, and preprocessing techniques, the community currently lacks a comprehensive benchmark, which impedes deeper understanding and further development of GLN. To fill this gap, we introduce NoisyGL in this paper, the first comprehensive benchmark for graph neural networks under label noise. NoisyGL enables fair comparisons and detailed analyses of GLN methods on noisy labeled graph data across various datasets, with unified experimental settings and interface. Our benchmark has uncovered several important insights that were missed in previous research, and we believe these findings will be highly beneficial for future studies. We hope our open-source benchmark library will foster further advancements in this field.

What are Russia's gains from the Iran war? 'We are not losers; we are winners' Ukrainian officials say Russian drones have again attacked the southern port city of Odesa, injuring at least 11 people, including two children, and damaging homes and important infrastructure. Odesa Governor Oleh Kiper said the attack affected three districts, hitting residential buildings, vehicles and civilian facilities, including a hotel, warehouses and funicular railway. Windows shattered in many buildings and the port area sustained damage. Law enforcement agencies are documenting the latest war crimes committed by Russia against the peaceful population of [the] Odesa region," Kiper said. Russian attacks killed one person in the southeastern Zaporizhzhia region, according to Governor Ivan Fedorov. "A 59-year-old man died as a result of an enemy attack on the Zaporizhzhia region," Fedorov wrote on Telegram. A Ukrainian drone attack killed an employee at the Zaporizhzhia nuclear power plant, which was captured by Russian forces and is shut down. "A driver was killed today when a Ukrainian Armed Forces drone struck the transport department at the Zaporizhzhia Nuclear Power Plant," said a statement from plant managers who were installed by Russia. Regional governor Fedorov said Russian forces launched 629 strikes across 45 settlements in the region in a single day, with at least 50 reports of damage to homes and infrastructure. Russian officials reported Ukrainian drone attacks in the Belgorod border region, where at least one person was killed and four women injured, alongside damage to buildings and vehicles. The attacks come as diplomatic efforts to end the war remain stalled. Donald Trump said on Sunday that he has had "good conversations" with Presidents Vladimir Putin and Volodymyr Zelenskyy. "We're working on the Russia situation, Russia and Ukraine, and hopefully we're going to get it," Trump said on Fox News. "I do have conversations with him, and I do have conversations with President Zelenskyy, and good conversations," he said. "The hatred between President Putin and President Zelenskyy is ridiculous.

Mean estimation under differential privacy is a fundamental problem, but worstcase optimal mechanisms do not offer meaningful utility guarantees in practice when the global sensitivity is very large. Instead, various heuristics have been proposed to reduce the error on real-world data that do not resemble the worst-case instance. This paper takes a principled approach, yielding a mechanism that is instance-optimal in a strong sense. In addition to its theoretical optimality, the mechanism is also simple and practical, and adapts to a variety of data characteristics without the need of parameter tuning. It easily extends to the local and shuffle model as well.

Recovering the skeletal shape of an animal from a monocular video is a longstanding challenge. Prevailing animal reconstruction methods often adopt a control-point driven animation model and optimize bone transforms individually without considering skeletal topology, yielding unsatisfactory shape and articulation. In contrast, humans can easily infer the articulation structure of an unknown animal by associating it with a seen articulated character in their memory. Inspired by this fact, we present CASA, a novel Category-Agnostic Skeletal Animal reconstruction method consisting of two major components: a video-to-shape retrieval process and a neural inverse graphics framework. During inference, CASA first retrieves an articulated shape from a 3D character assets bank so that the input video scores highly with the rendered image, according to a pretrained language-vision model. CASA then integrates the retrieved character into an inverse graphics framework and jointly infers the shape deformation, skeleton structure, and skinning weights through optimization.