While Large Language Models (LLMs) have gained remarkable success, they are consistently at risk of being stolen when deployed on untrusted edge devices. As a solution, TEE-based secure inference has been proposed to protect valuable model property. However, we identify a statistical vulnerability in existing protection methods, and furtherly compromise their security guarantees by proposed Model Stealing Attack with Prior. To eliminate this vulnerability, LoRO is presented in this paper, which leverages dense mask to completely obfuscate parameters. LoRO includes two innovations: (1) Low Rank Mask, which uses low-rank factors to generate dense masks efficiently. The computing complexity in TEE is hence reduced by an exponential amount to achieve inference speed up, while providing robust model confidentiality.

Regret Matching+ (RM+) variants are widely used to build superhuman Poker AIs, yet few studies investigate their last-iterate convergence in learning a Nash equilibrium (NE). Although their last-iterate convergence is established for games satisfying the Minty Variational Inequality (MVI), no studies have demonstrated that these algorithms achieve such convergence in the broader class of games satisfying the weak MVI. A key challenge in proving last-iterate convergence for RM+ variants in games satisfying the weak MVI is that even if the game's loss gradient satisfies the weak MVI, RM+ variants operate on a transformed loss feedback which does not satisfy the weak MVI. To provide last-iterate convergence for RM+ variants, we introduce a concise yet novel proof paradigm that involves: (i) transforming an RM+ variant into an Online Mirror Descent (OMD) instance that updates within the original strategy space of the game to recover the weak MVI, and (ii) showing last-iterate convergence by proving the distance between accumulated regrets converges to zero via the recovered weak MVI of the feedback. Inspired by our proof paradigm, we propose Smooth Optimistic Gradient Based RM+ (SOGRM+) and show that it achieves last-iterate and finite-time best-iterate convergence in learning an NE of games satisfying the weak MVI, the weakest condition among all known RM+ variants. Experiments show that SOGRM+ significantly outperforms other algorithms. Our code is available at https://github.

The federal government is planning to let a rule regulating federal data center operations sunset in September with no replacement. The US government is quietly planning to allow a rule outlining the standards for federal data center usage and operations, known as the Federal Data Center Enhancement Act (FDCEA), to expire, according to sources who spoke to WIRED. Neither Congress nor the Trump administration appears to be making significant moves to protect or extend the rule, or put alternate plans in place. Data centers have become a hot-button issue in recent months, as the tech industry goes all in on artificial intelligence and the infrastructure needed to power it. According to a Gallup poll from May, more than 70 percent of Americans oppose the construction of data centers, the energy-and water-intensive buildings that power the AI boom, in their communities.

Furious Trump EXPLODES over war talks as he threatens to'hit Iran very hard again' and tells rival leader he'better watch his mouth'... while also slamming Israel for continuing to drop bombs Ilhan Omar cries poor as she claims her millionaire husband only made TWO HUNDRED dollars last year... despite his empire being worth $30million Angelina Jolie's son Pax, 22, surfaces in LA after bombshell revelation about his relationship to Brad Pitt'Media-obsessed' Anna Paulina Luna reveals secret to her rising power as she turns into Republicans' 'favorite headache' Call me cynical, but the real reason Gruesome Twosome Harry and Meghan are returning to the UK is just so obvious... and highly humiliating: MAUREEN CALLAHAN No one can see the real reason Jelly Roll divorced Bunnie XO. Royals wish Prince William happy birthday and Father's Day with sweet photo of him and Charlotte after King's Trooping the Colour - as Charles pays tribute to Philip Family-man facade of award-winning children's ...

We propose Fast Long-context Adaptive Memory for Event (FLAME), a novel scalable architecture that combines neuro-inspired feature extraction with robust structured sequence modeling to efficiently process asynchronous and sparse event camera data. As a departure from conventional input encoding methods, FLAME presents Event Attention Layer, a novel feature extractor that leverages neuromorphic dynamics (Leaky Integrate-and-Fire (LIF)) to directly capture multi-timescale features from event streams. The feature extractor integrates with a structured state-space model with a novel Event-Aware HiPPO (EA-HiPPO) mechanism that dynamically adapts memory retention based on inter-event intervals to understand relationship across varying temporal scales and event sequences. ANormal Plus Low Rank (NPLR) decomposition reduces the computational complexity of state update from O(N2) to O(Nr), where N represents the dimension of the core state vector and r is the rank of a low-rank component (with r N). FLAME demonstrates state-of-the-art accuracy for event-by-event processing on complex event camera datasets.

Test-time adaptation (TTA) aims to adapt a source model to a target domain using only test data. Existing methods predominantly rely on unsupervised entropy minimization or its variants, which suffer from degeneration, leading to trivial solutions with low-entropy but inaccurate predictions. In this work, we identify entropy-deceptive (ED) samples, instances where the model makes highly confident yet incorrect predictions, as the underlying cause of degeneration. Further, we reveal that the gradients of entropy minimization in TTA have an intrinsic lowdimensional structure, driven primarily by entropy-truthful (ET) samples whose gradients are highly correlated. In contrast, ED samples have scattered, less correlated gradients. Leveraging this observation, we show that the detrimental impact of ED samples can be suppressed by constraining model updates within the principal subspace of backward gradients. Building on this insight, we propose LCoTTA, a lifelong continual TTA method that tracks the principal subspace of gradients online and utilizes their projections onto this subspace for adaptation. Further, we provide theoretical analysis to show that the proposed subspace-based method can enhance the robustness against detrimental ED samples. Extensive experiments demonstrate that LCoTTA effectively overcomes degeneration and significantly outperforms existing methods in long-term continual adaptation scenarios.

The rise of Large Language Models (LLMs) has driven progress in reasoning tasks, from program synthesis to scientific hypothesis generation, yet their ability to handle ranked preferences and structured algorithms in combinatorial domains remains underexplored. We study matching markets, a core framework behind applications like resource allocation and ride-sharing, which require reconciling individual ranked preferences to ensure stable outcomes. We evaluate seven stateof-the-art models on a hierarchy of preference-based reasoning tasks--ranging from stable-matching generation to instability detection, instability resolution, and finegrained preference queries--to systematically expose their logical and algorithmic limitations in handling ranked inputs. Surprisingly, even top-performing models with advanced reasoning struggle to resolve instability in large markets, often failing to identify blocking pairs or execute algorithms iteratively. We further show that parameter-efficient fine-tuning (LoRA) significantly improves performance in small markets, but fails to bring about a similar improvement in large instances, suggesting the need for more sophisticated strategies to improve LLMs' reasoning with larger-context inputs.

Preference-based data often appear complex and noisy but may conceal underlying homogeneous structures. This paper introduces a novel framework of ranking structure recognition for preference-based data. We first develop an approach to identify dynamic ranking groups by incorporating temporal penalties into a spectral estimation for the celebrated Bradley-Terry model. To detect structural changes, we introduce an innovative objective function and present a practicable algorithm based on dynamic programming. Theoretically, we establish the consistency of ranking group recognition by exploiting properties of a random'design matrix' induced by a reversible Markov chain. We also tailor a group inverse technique to quantify the uncertainty in item ability estimates. Additionally, we prove the consistency of structure change recognition, ensuring the robustness of the proposed framework. Experiments on both synthetic and real-world datasets demonstrate the practical utility and interpretability of our approach.

A panther, a leopard and a Canadian lynx are among the reported sightings of big cats in Wales, according to a Freedom of Information (FOI) request. Fifteen big cats were reported to authorities in Wales between January 2020 and July 2025, the FOI to the Welsh government found. The apparent spottings were made in areas ranging from Pembrokeshire to Ceredigion, Powys, Swansea, Denbighshire and Carmarthenshire. One reporter described seeing what they believed was a panther jumping over a hedge onto the road in front of them while they were driving. A leopard sighting was reported to Dyfed-Powys Police in Cwmtwrch, Swansea, on 16 January 2023, when the reporter saw a leopard with spots walking around the garden when their dog was let out.

The UK government is introducing a ban on social media for children and a minimum age for some chatbots in an attempt to shield young people from dangerous corners of the web. UK prime minister Keir Starmer has been leading the charge on under-16 social media regulation. Children under the age of 16 will be banned from social media platforms in the UK, under new measures announced by prime minister Keir Starmer on Monday. "The need for action could not be clearer. Social media is making our children unhappy and unsafe," said Starmer, in an X post .