Karoline Leavitt's family member'abruptly arrested' by ICE after living in US for decades Residents in liberal Western US city feel'isolated' as state turns extremely red What HAS happened to Beyoncé? Suddenly desperate, I know what's really going on... and it's ugly: CAROLINE BULLOCK LIZ JONES: Sorry, but it's now time for Kate to stop making excuses'I fell for Joan the moment I saw her': The emotional love letter Sir Richard Branson penned to his'rock' on their anniversary - as he announces her death after 50 years together Ina Garten, 77, vulnerably addresses her decision not to have children: 'I can't imagine my life any other way' Sports broadcaster's wife suffers unimaginable tragedy just before he goes on air New'Hollywood of the South' emerges as booming industry generates $1bn... but long-time residents are furious University of Minnesota program offers guidelines to'reverse the whiteness pandemic' Emmy-winning CBS anchor reveals her devastating health battle: 'I've been silently struggling' Bethany MaGee's family issue heartbreaking statement about her injuries after devout Christian, 26, was set ablaze'by 72-time arrestee' on Chicago train MORE: California squirrels evolving in'shocking' way as scientists investigate key behavioral shift Common rats have learned a shocking and deadly new tactic to kill other animals, which could one day lead to a deadly new pandemic among humans. Scientists witnessed as local brown rats ambushed a colony of bats as they entered two caves in Germany, leaping into the air to catch and kill the nocturnal creatures in droves. Moreover, these rats did this in the middle of the night and without being able to see their surroundings. Researchers from the Leibniz Institute for Evolution and Biodiversity Science said it's the first time common rats have ever been seen in Europe acting with such predatory instincts .

Google is one of the few companies that produces what the industry calls the full stack in computing, and it has a data goldmine for constructing AI models from its search index, Android phones and YouTube. Since the launch of ChatGPT three years ago, analysts and technologists -- even a Google engineer and the company's former chief executive -- have declared Google behind in the high-stakes race to develop artificial intelligence. The internet giant has released new AI software and struck deals, such as a chip tie-up with Anthropic PBC, that have reassured investors the company won't easily lose to ChatGPT creator OpenAI and other rivals. Google's newest multipurpose model, Gemini 3, won immediate praise for its capabilities in reasoning and coding, as well as niche tasks that have tripped up AI chatbots. Google's cloud business, once an also-ran, is growing steadily, thanks in part to the global rush to develop AI services and demand for compute.

Don't wait until after turkey to grab these bargains. We may earn revenue from the products available on this page and participate in affiliate programs. Walmart has officially kicked off its Black Friday sales and there are literally thousands of products hitting their lowest prices of the year (and in some cases, ever). We know you don't have the time to sort through all those deals, but we do, so we've picked out the best bargains across a ton of different categories and put them in this list. Save on home goods, electronics, and just about anything else you could want to buy for yourself or as a holiday gift .

Alignment with human preferences is an important evaluation aspect of LLMs, requiring them to be helpful, honest, safe, and to precisely follow human instructions. Evaluating large language models' (LLMs) alignment typically involves directly assessing their open-ended responses, requiring human annotators or strong LLM judges. Conversely, LLMs themselves have also been extensively evaluated as judges for assessing alignment. In this work, we examine the relationship between LLMs' generation and evaluation capabilities in aligning with human preferences. To this end, we first conduct a comprehensive analysis of the generation-evaluation consistency (GE-consistency) among various LLMs, revealing a strong correlation between their generation and evaluation capabilities when evaluated by a strong LLM preference oracle. Utilizing this finding, we propose a benchmarking paradigm that measures LLM alignment with human preferences without directly evaluating their generated outputs, instead assessing LLMs in their role as evaluators. Our evaluation shows that our proposed benchmark, AlignEval, matches or surpasses widely used automatic LLM evaluation benchmarks, such as AlpacaEval and Arena-Hard, in capturing human preferences when ranking LLMs. Our study offers valuable insights into the connection between LLMs' generation and evaluation capabilities, and introduces a benchmark that assesses alignment without directly evaluating model outputs.

We introduce and analyse active learning markets as a way to purchase labels, in situations where analysts aim to acquire additional data to improve model fitting, or to better train models for predictive analytics applications. This comes in contrast to the many proposals that already exist to purchase features and examples. By originally formalising the market clearing as an optimisation problem, we integrate budget constraints and improvement thresholds into the label acquisition process. We focus on a single-buyer-multiple-seller setup and propose the use of two active learning strategies (variance based and query-by-committee based), paired with distinct pricing mechanisms. They are compared to a benchmark random sampling approach. The proposed strategies are validated on real-world datasets from two critical application domains: real estate pricing and energy forecasting. Results demonstrate the robustness of our approach, consistently achieving superior performance with fewer labels acquired compared to conventional methods. Our proposal comprises an easy-to-implement practical solution for optimising data acquisition in resource-constrained environments.

Universal online learning aims to achieve optimal regret guarantees without requiring prior knowledge of the curvature of online functions. Existing methods have established minimax-optimal regret bounds for universal online learning, where a single algorithm can simultaneously attain $\mathcal{O}(\sqrt{T})$ regret for convex functions, $\mathcal{O}(d \log T)$ for exp-concave functions, and $\mathcal{O}(\log T)$ for strongly convex functions, where $T$ is the number of rounds and $d$ is the dimension of the feasible domain. However, these methods still lack problem-dependent adaptivity. In particular, no universal method provides regret bounds that scale with the gradient variation $V_T$, a key quantity that plays a crucial role in applications such as stochastic optimization and fast-rate convergence in games. In this work, we introduce UniGrad, a novel approach that achieves both universality and adaptivity, with two distinct realizations: UniGrad.Correct and UniGrad.Bregman. Both methods achieve universal regret guarantees that adapt to gradient variation, simultaneously attaining $\mathcal{O}(\log V_T)$ regret for strongly convex functions and $\mathcal{O}(d \log V_T)$ regret for exp-concave functions. For convex functions, the regret bounds differ: UniGrad.Correct achieves an $\mathcal{O}(\sqrt{V_T \log V_T})$ bound while preserving the RVU property that is crucial for fast convergence in online games, whereas UniGrad.Bregman achieves the optimal $\mathcal{O}(\sqrt{V_T})$ regret bound through a novel design. Both methods employ a meta algorithm with $\mathcal{O}(\log T)$ base learners, which naturally requires $\mathcal{O}(\log T)$ gradient queries per round. To enhance computational efficiency, we introduce UniGrad++, which retains the regret while reducing the gradient query to just $1$ per round via surrogate optimization. We further provide various implications.

Decision trees remain central for tabular prediction but struggle with (i) capturing spatial dependence and (ii) producing locally stable (robust) explanations. We present SX-GeoTree, a self-explaining geospatial regression tree that integrates three coupled objectives during recursive splitting: impurity reduction (MSE), spatial residual control (global Moran's I), and explanation robustness via modularity maximization on a consensus similarity network formed from (a) geographically weighted regression (GWR) coefficient distances (stimulus-response similarity) and (b) SHAP attribution distances (explanatory similarity). We recast local Lipschitz continuity of feature attributions as a network community preservation problem, enabling scalable enforcement of spatially coherent explanations without per-sample neighborhood searches. Experiments on two exemplar tasks (county-level GDP in Fujian, n=83; point-wise housing prices in Seattle, n=21,613) show SX-GeoTree maintains competitive predictive accuracy (within 0.01 $R^{2}$ of decision trees) while improving residual spatial evenness and doubling attribution consensus (modularity: Fujian 0.19 vs 0.09; Seattle 0.10 vs 0.05). Ablation confirms Moran's I and modularity terms are complementary; removing either degrades both spatial residual structure and explanation stability. The framework demonstrates how spatial similarity - extended beyond geometric proximity through GWR-derived local relationships - can be embedded in interpretable models, advancing trustworthy geospatial machine learning and offering a transferable template for domain-aware explainability.

Identifying key driver genes governing biological processes such as development and disease progression remains a challenge. While existing methods can reconstruct cellular trajectories or infer static gene regulatory networks (GRNs), they often fail to quantify time-resolved regulatory effects within specific temporal windows. Here, we present Time-varying Network Driver Estimation (TNDE), a computational framework quantifying dynamic gene driver effects from single-cell snapshot data under a linear Markov assumption. TNDE leverages a shared graph attention encoder to preserve the local topological structure of the data. Furthermore, by incorporating partial optimal transport, TNDE accounts for unmatched cells arising from proliferation or apoptosis, thereby enabling trajectory alignment in non-equilibrium processes. Benchmarking on simulated datasets demonstrates that TNDE outperforms existing baseline methods across diverse complex regulatory scenarios. Applied to mouse erythropoiesis data, TNDE identifies stage-specific driver genes, the functional relevance of which is corroborated by biological validation. TNDE offers an effective quantitative tool for dissecting dynamic regulatory mechanisms underlying complex biological processes.

We therefore pursue a data-driven alternative based on complex-valued V AEs and latent-space OOD scores. In recent years, data-driven approaches have emerged to alleviate the need for precise clutter modeling. Among them, V AEs [4] have demonstrated promising capabilities for anomaly and OOD detection in diverse applications, including radar detection [5], speech enhancement [6], medical imaging [7], industrial monitoring [8], and acoustic signal analysis [9]. These models learn a latent representation of the training data and use reconstruction or probabilistic criteria to detect deviations. Despite their effectiveness, most V AE-based detectors operate in the real domain and often treat complex-valued radar data by separating real and imaginary components into distinct channels. Recent advances in Complex-V alued Neural Networks (CVNNs) have shown the benefits of directly modeling complex-valued signals [10, 11].

Vector autoregressive (VAR) processes are ubiquitously used in economics, finance, and biology. Order selection is an essential step in fitting VAR models. While many order selection methods exist, all come with weaknesses. Order selection by minimizing AIC is a popular approach but is known to consistently overestimate the true order for processes of small dimension. On the other hand, methods based on BIC or the Hannan-Quinn (HQ) criteria are shown to require large sample sizes in order to accurately estimate the order for larger-dimensional processes. We propose the mean square information criterion (MIC) based on the observation that the expected squared error loss is flat once the fitted order reaches or exceeds the true order. MIC is shown to consistently estimate the order of the process under relatively mild conditions. Our simulation results show that MIC offers better performance relative to AIC, BIC, and HQ under misspecification. This advantage is corroborated when forecasting COVID-19 outcomes in New York City. Order selection by MIC is implemented in the micvar R package available on CRAN.