Film-maker James Cameron and Disney are being sued by an actress who has accused the director of using her likeness as the basis for one of the lead characters in his hit film series Avatar. German-born US actress Q'orianka Kilcher, who is of indigenous Peruvian descent, alleged that in 2005 - when she was 14 - Cameron extracted her facial features from a photograph of her portraying Pocahontas in another film, The New World. In court documents filed on Tuesday in California, her team claimed Cameron directed his design team to use it as the foundation for the character of Neytiri, depicted on screen by Zoe Saldaña. BBC News has contacted Cameron and Disney for a comment. The Avatar movies contain a hybrid of live-action performance mixed with computer-generated characters.

When Stick Figure's six-year-old song shot up the charts, the band was thrilled. But its viral moment was spurred by unauthorized AI remixes. The California-based reggae band Stick Figure has been around for 20 years, eight albums, and countless hours on the road, but lead vocalist and guitarist Scott Woodruff has never seen a track take off like "Angels Above Me" did this past week. The six-year-old song hit number one on the iTunes sales charts in six different countries, including the United Kingdom, Austria, and Canada, skyrocketing "out of nowhere," according to Woodruff. Stick Figure has had plenty of thrilling milestones before, with albums repeatedly hitting number one in the reggae category, and hit singles amassing hundreds of millions of streams.

Cybersecurity experts said the research was interesting, though not alarming at this stage. Cybersecurity experts said the research was interesting, though not alarming at this stage. 'No one has done this in the wild': study observes AI replicate itself It's the stuff of science fiction cinema, or particularly breathless AI company blogposts: new research finds recent AI systems can independently copy themselves on to other computers. In the doom scenario, this means that when the superintelligent AI goes rogue, it will escape shutdown by seeding itself across the world wide web, lurking outside the reach of frantic IT professionals and continuing to plot world domination or paving over the world with solar panels . "We're rapidly approaching the point where no one would be able to shut down a rogue AI, because it would be able to self-exfiltrate its weights and copy itself to thousands of computers around the world," said Jeffrey Ladish, the director of Palisade research, a Berkeley-based organisation which did the study.

Jeffrey Epstein scrawled suicide note finally released: 'No fun. Surprising fate of CNN founder Ted Turner's multibillion-dollar fortune after thrice-married father-of-five died aged 87 Wall Street Titan lays out his ultimate revenge for woke NYC mayor Mamdani's'creepy weird' video Mike Vrabel'rented a boat with pregnant Dianna Russini in 2021' months before she welcomed first son Ultimate Spirit Airlines compensation guide: 'Magic words' to tell your bank for BIGGEST refund... what to do if you DIDN'T use a credit card... how to reclaim higher cost of new flights.... and'rescue' option when all else fails Once-bustling Nevada vacation resort becomes America's newest GHOST TOWN as its final hotel closes Farrah Fawcett's twisted family secrets: Siblings of her devil-horned son accused of hideous knife spree reveal dark childhood home truths Tragic Saved By The Bell star Dustin Diamond's residual pay revealed after his shock death at age 44 Rat virus'was brought onto cruise ship by birdwatcher couple who visited garbage dump to snap birds before setting off': Possible cause revealed - as Brits face eight-week quarantine Scandal as female World Cup soccer player is accused by police of raping baby-faced boy, 14, up to'three times a week' Triple Crown thrown into disarray with major announcement from Kentucky Derby winner Golden Tempo's trainer The photos that say it all! Justin Baldoni beams as he steps out with his wife for the first time since Blake Lively's humiliating lawsuit settlement The next generation of Ozempic is here. Turbo shots deliver 250% more weight loss... at record speeds. Patients are begging for them - but there's a major warning: DR SHEILA NAZARIAN Meghan Markle shares unseen photo of Prince Archie asleep on Harry's chest as a baby to celebrate his 7th birthday I sat with FedEx child killer Tanner Horner for weeks.

Many machine learning problems involve data supported on curved spaces such as spheres, rotation groups, hyperbolic spaces, and general Riemannian manifolds, where Euclidean geometry can distort distances, averages, and the resulting optimal transport (OT) problem. Existing manifold OT methods have pursued amortized out-of-sample maps, while entropic regularization has made discrete OT more scalable, but these advantages have remained largely disjoint. We propose Entropic Riemannian Neural Optimal Transport (Entropic RNOT), a unified framework that combines intrinsic entropic OT with amortized out-of-sample evaluation on Riemannian manifolds. Our method learns a single target-side Schrödinger potential through a neural pullback parameterization, recovers the induced Gibbs coupling, and uses the resulting conditional laws to construct intrinsic transport surrogates. These include barycentric projections on Cartan-Hadamard manifolds and heat-smoothed conditional surrogates on stochastically complete manifolds, the latter turning possibly atomic target laws into absolutely continuous ones. For fixed regularization $\varepsilon>0$, we prove that the proposed hypothesis class recovers the entropic optimal coupling in strong probabilistic metrics. As consequences, barycentric surrogates converge in $L^2$, while heat-smoothed surrogates are stable at fixed heat time and asymptotically unbiased as the heat time vanishes. The guarantees hold for compactly supported data on possibly noncompact manifolds. Empirically, our method matches or improves over Euclidean, tangent-space, and log-Euclidean baselines on benchmarks over $\mathbb{S}^2$, $\mathrm{SO}(3)$, $\mathrm{SPD}(3)$, $\mathrm{SE}(3)$, and $\mathbb{H}^2$, scales favorably relative to discrete manifold Sinkhorn, and in a protein-ligand docking application, refines poses on $\mathrm{SE}(3)$ without retraining or per-instance optimization.

Reinforcement learning from human feedback (RLHF) typically assumes a static or non-strategic reward model (RM). In iterative deployment, however, the policy generates the data on which the RM is retrained, creating a feedback loop. Building on the Stackelberg game formulation of this interaction, we derive an analytical decomposition of the policy's true optimization gradient into a standard policy gradient and a parameter-steering term that captures the policy's influence on the RM's future parameters. We show that standard iterative RLHF, which drops this steering term entirely, suffers from alignment collapse: the policy systematically exploits the RM's blind spots, producing low-quality, high-reward outputs whose feedback reinforces the very errors it exploits. To mitigate this, we propose foresighted policy optimization (FPO), a mechanism-design intervention that restores the missing steering term by regularizing the policy's parameter-steering effect on RM updates. We instantiate FPO via a scalable first-order approximation and demonstrate that it prevents alignment collapse on both controlled environments and an LLM alignment pipeline using Llama-3.2-1B.

The standard constraint-based paradigm for causal discovery with incomplete data -- impute first, test second -- is frequently miscalibrated: any consistent conditional independence (CI) test rejects a true null with probability approaching 1 when imputation error induces spurious conditional dependence. We introduce PAIR-CI, a nonparametric CI test that restores calibration by integrating multiple imputation directly into the inferential procedure via a paired permutation design. PAIR-CI compares cross-validated models that include and exclude the candidate variable while receiving the same imputed conditioning set, forcing imputation error to cancel in their loss difference rather than contaminate the test statistic. A provably consistent variance estimator jointly accounts for uncertainty arising from cross-validation and multiple imputation -- to our knowledge, the first formal unification of these two inferential frameworks. In simulations, existing imputation-based CI tests exhibit false positive rates of 28--45% when data are missing not at random (MNAR), whereas PAIR-CI averages below the nominal 5% level across data-generating processes and missingness mechanisms. These gains are largest in nonlinear settings and grow with causal graph size: when integrated into the PC algorithm, PAIR-CI reduces structural Hamming distance by 8% on 10-variable nonlinear graphs, 15% on 30-variable equivalents, and up to 44% on the 56-variable HAILFINDER network, with stable performance in all settings.

Large language models hallucinate in predictable ways: attention routing fails by over-concentrating on a narrow set of positions, or by spreading so diffusely that relevance is diluted, and the shape of the failure carries diagnostic signal. A widely used family of spectral methods analyzes the symmetric component of the degree-normalized attention operator, which governs transport capacity; we prove that every transpose-invariant spectral diagnostic of this operator is structurally orientation-blind (it cannot distinguish an operator from its transpose, and therefore cannot detect information-flow direction), with a quantitative converse establishing the asymmetry coefficient $G$ as the unique control parameter for direction. Pairing this with a closed-form bipartite-Cheeger landscape for canonical causal architectures, we show that uniform causal attention satisfies an $n$-independent floor $ϕ\ge 1/5$ with worst cut at $t^\ast/n \approx 0.32$, while window attention pierces the floor as $O(w/n)$; failure modes are shape-different, not just value-different. The resulting two-axis diagnostic ($ϕ$ for capacity, $G$ for direction) yields a falsifiable polarity prediction: bottleneck- and diffuse-dominated benchmarks should exhibit opposite polarity. Under length-controlled evaluation, transport features retain interpretable signal (LC-AUROC from 0.62 to 0.84) on tested models up to 8B parameters, with polarity reversing as predicted between HaluEval and MedHallu.

Despite theoretical advantages, causal methods for Gene Regulatory Network (GRN) inference from single-cell RNA-seq data consistently fail to match or outperform correlation-based baselines in many realistic benchmarks, a persistent puzzle which casts doubt on the value of causality for this task. We argue that existing benchmarks are insufficiently controlled to answer this question because they evaluate on real or semi-real data where multiple pathologies co-occur, confounding failure modes, and obscuring the specific conditions under which different inference methods excel or fail. To address this gap, we introduce a controlled diagnostic framework that isolates seven biologically motivated pathologies (dropout, latent confounders, cell-type mixing, feedback loops, network density, sample size, and pseudotime drift) and measure how six representative methods spanning three inference paradigms degrade as each pathology intensifies. Across 6,120 controlled experiments, we find that causal methods genuinely dominate in clean and structurally favorable regimes, but specific pathologies (notably dropout and latent confounders) selectively neutralize their advantages. We further introduce an errortype decomposition that reveals methods with similar aggregate accuracy commit qualitatively different errors. To probe whether single-pathology effects persist when multiple stressors co-occur, we perform an interaction sweep over the three most impactful pathologies and find that their joint effects are sub-additive, while also exposing density-conditional cross-overs invisible to single-dial analysis. Our findings offer a nuanced understanding of when and why different methods succeed or fail for GRN inference, providing actionable insights for method development and practical guidance for practitioners.3

We compare in-context learning with fixed queries and agentic learning with adaptive queries for uniform approximation of task families. We consider two settings: an unrestricted regime, where querying and approximation are arbitrary functions, and a realizable regime, where we require these operations to be implemented by ReLU neural networks. In both settings, adaptivity never hinders approximation performance. However, this advantage can change when one passes from the unrestricted regime to the realizable regime. We identify four distinct approximation scenarios, each witnessed by an explicit task family: (a) no advantage of adaptivity; (b) an advantage in the unrestricted regime that persists under ReLU realizability; (c) an advantage that arises only under realizability; and (d) an advantage that disappears under realizability. This demonstrates that representational constraints interact profoundly with the effect of adaptivity.