Finding low-rank matrix weights is a key technique for addressing the high memory usage and computational demands of large models. Most existing algorithms rely on the factorization of the low-rank matrix weights, which is non-unique and redundant. Their convergence is slow especially when the target low-rank matrices are ill-conditioned, because the convergence rate depends on the condition number of the Jacobian operator for the factorization and the Hessian of the loss function with respect to the weight matrix. To address this challenge, we adopt the Riemannian gradient descent (RGD) algorithm on the Riemannian manifold of fixed-rank matrices to update the entire low-rank weight matrix. This algorithm completely avoids the factorization, thereby eliminating the negative impact of the Jacobian condition number.

Recent advances of Reinforcement Learning (RL) have highlighted its potential in complex reasoning tasks, yet effective training often relies on external supervision, which limits the broader applicability. In this work, we propose a novel self-rewarding reinforcement learning framework to enhance Large Language Model (LLM) reasoning by leveraging the consistency of intermediate reasoning states across different reasoning trajectories. Our key insight is that correct responses often exhibit consistent trajectory patterns in terms of model likelihood: their intermediate reasoning states tend to converge toward their own final answers (high consistency) with minimal deviation toward other candidates (low volatility). Inspired by this observation, we introduce CoVo, an intrinsic reward mechanism that integrates Consistency and Volatility via a robust vector-space aggregation strategy, complemented by a curiosity bonus to promote diverse exploration. CoVo enables LLMs to perform RL in a self-rewarding manner, offering a scalable pathway for learning to reason without external supervision. Extensive experiments on diverse reasoning benchmarks show that CoVo achieves performance comparable to or even surpassing supervised RL. Our code is available at https://github.com/sastpg/CoVo.

Israeli forces have carried out new strikes in southern Lebanon, state media say, despite renewed criticism from US President Donald Trump of Israel's actions in the country. Israeli drone strikes injured several people in Mansouri and Aaziyyeh on Wednesday, while jets attacked Nabatieh al-Fawqa and Kfar Tebnit, Lebanon's National News Agency reported. Israel's military has not commented, but it did say five soldiers were injured in a drone attack in Lebanon by the Iran-backed armed group Hezbollah. Mediator Pakistan has said the deal between the US and Iran to end the war includes Lebanon. On Tuesday, Trump said Israel's prime minister needed to be more responsible with respect to Lebanon.

WIRED goes on location--and on camera--with the cult hit. On March 16, 2026, at 5:45 pm in a leafy suburb of Atlanta called Sandy Springs, police pound on the door of a neglected French Country-style mansion, rifles at the ready, bodycams rolling. Minutes earlier, a distress call came from someone claiming to be hiding from a gunman in the mansion's downstairs bathroom. The dispatcher heard a gunshot ring out in the distance, then the line disconnected. "Open the door!" an officer yells. A calm young man with a mullet and woolly eyebrows steps out, hands raised. The police ask him who else is in the house. "Just my friends," he replies, as seven other young people, men and women, silently file out behind him, less evidently relaxed. They remain outside while two officers search the house. Inside the mansion there are no immediate signs of a massacre, but the decor alone arouses suspicion. All of the windows are frosted over, so only a chilly light leaks in. The place is a mess, and the walls are adorned with lurid, seemingly AI-generated art: a frowning baby holding an assault rifle, a rubber ducky bobbing in a mug of what looks like black coffee, a lidless and levitating eyeball crying into a martini glass. The rooms are painted primary colors, grass green and cherry red, like a kindergarten class. A vape dangles from a doorframe by a chain, suspended at mouth level. The pantry is practically empty. The bedroom is a dormitory featuring seven identical twin beds. No one is hiding in the bathroom. The call, it seems, was a prank. The police return to the driveway and ask, "What is it that you guys are doing here?" "We're just livestreaming," says a man in a camo hat named Matt. "You guys don't have any firearms or anything inside the house?" There are guns in the house, Matt says, for self-defense. Fans of their livestream can be obsessive, he explains, and tend to have perverse ideas about jokes. The officer asks to see their weapons, and they go downstairs. The room is cluttered with ergonomic swivel chairs, desks strewn with takeout containers and energy drinks, two flatscreen TVs, and a dozen computer monitors.

Multimodal agents, which integrate a controller (e.g., a vision language model) with external tools, have demonstrated remarkable capabilities in tackling complex multimodal tasks. Existing approaches for training these agents, both supervised fine-tuning and reinforcement learning, depend on extensive human-annotated taskanswer pairs and tool trajectories. However, for complex multimodal tasks, such annotations are prohibitively expensive or impractical to obtain. In this paper, we propose an iterative tool usage exploration method for multimodal agents without any pre-collected data, namely SPORT, via step-wise preference optimization to refine the trajectories of tool usage. Our method enables multimodal agents to autonomously discover effective tool usage strategies through self-exploration and optimization, eliminating the bottleneck of human annotation.

Graphs in the real world are fragmented and dynamic, lacking collaboration akin to that observed in human societies.

Retrieving graphs from a large corpus, that contain a subgraph isomorphic to a given query graph, is a core operation in many real-world applications. While recent multi-vector graph representations and scores based on set alignment and containment can provide accurate subgraph isomorphism tests, their use in retrieval remains limited by their need to score corpus graphs exhaustively. We introduce CORGII (Contextual Representation of Graphs for Inverted Indexing), a graph indexing framework in which, starting with a contextual dense graph representation, a differentiable discretization module computes sparse binary codes over a learned latent vocabulary. This text document-like representation allows us to leverage classic, highly optimized inverted indices, while supporting soft (vector) set containment scores. Pushing this paradigm further, we replace the classical, fixed impact weight of a'token' on a graph (such as TFIDF or BM25) with a data-driven, trainable impact weight. Finally, we explore token expansion to support multiprobing the index for smoother accuracy-efficiency tradeoffs. To our knowledge, CORGII is the first indexer of dense graph representations using discrete tokens mapping to efficient inverted lists. Extensive experiments show that CORGII provides better trade-offs between accuracy and efficiency, compared to several baselines.

With the rapid advancement of Artificial Intelligence Generated Content (AIGC) technologies, synthetic images have become increasingly prevalent in everyday life, posing new challenges for authenticity assessment and detection. Despite the effectiveness of existing methods in evaluating image authenticity and locating forgeries, these approaches often lack human interpretability and do not fully address the growing complexity of synthetic data. To tackle these challenges, we introduce FakeVLM, a specialized large multimodal model designed for both general synthetic image and DeepFake detection tasks. FakeVLM not only excels in distinguishing real from fake images but also provides clear, natural language explanations for image artifacts, enhancing interpretability.

Variational quantum algorithms (VQAs) are leading strategies to reach practical utilities of near-term quantum devices. However, the no-cloning theorem in quantum mechanics precludes standard backpropagation, leading to prohibitive quantum resource costs when applying VQAs to large-scale tasks. To address this challenge, we reformulate the training dynamics of VQAs as a nonlinear partial differential equation and propose a novel protocol that leverages physics-informed neural networks (PINNs) to model this dynamical system efficiently. Given a small amount of training trajectory data collected from quantum devices, our protocol predicts the parameter updates of VQAs over multiple iterations on the classical side, dramatically reducing quantum resource costs. Through systematic numerical experiments, we demonstrate that our method achieves up to a 30x speedup compared to conventional methods and reduces quantum resource costs by as much as 90% for tasks involving up to 40 qubits, including ground state preparation of different quantum systems, while maintaining competitive accuracy. Our approach complements existing techniques aimed at improving the efficiency of VQAs and further strengthens their potential for practical applications.

Apache helicopters are playing a major role in reopening the Strait of Hormuz, policing shipping lanes despite the combat loss of one gunship to an Iranian drone.