ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “optimization”

53 stories in the last 3d

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI research 26AI industry 16AI safety & security 6Model release 4AI tools & infra 1
SeverityAllcritical 0high 0medium 1low 0info 52

FlashVector: Agent for Hierarchical Model Serving Stack Optimization

FlashVector agent optimizes all layers of Unity's ad-serving stack, delivering up to 2x model-server throughput and 1.98x latency speedup in production.

FlashVector is an agentic system that optimizes performance across GPU kernels, ML framework computation graphs, model servers, and on-demand feature processing. Deployed in Unity's Vector advertising platform, it achieved up to 2x model-server throughput increase, 1.98x latency speedup, and 1.6x feature-store throughput gain. Optimizations spanned NVIDIA Triton's C++ codebase and the Python feature transformation service, demonstrating extensibility beyond single-kernel tuning.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

DeepSeek-v4.1 Flash: Pushing the Limits of KV Cache Compression

DeepSeek-V4.1 Flash is a 552B-parameter multimodal MoE model with 1M-token context achieving 4x KV cache compression for long-horizon agent workloads.

A detailed analysis of the DeepSeek-V4.1 Flash technical report describes a 552B-parameter multimodal mixture-of-experts model supporting contexts up to 1 million tokens. Its Causal Encoder-Decoder (CED) architecture activates 8B parameters during prefill and 16B during decode, and reportedly delivers about 420 tokens/s. Joint optimization of architecture (CSA2 cross-layer compression), FP4 KV cache precision, and deployment strategy cuts runtime KV cache to roughly 1/4 and persistent KV cache to about 1/8 of DeepSeek-V4-Flash at the same sequence length, targeting storage and bandwidth bottlenecks in long-horizon agent serving. The author notes all DeepSeek-V4 Pro models were taken offline following the release.

Hacker News · AI · 3h agoModel release 4 sourcesHN 41↑ · 3 comments

Reduced-Space Multi-Fidelity Bayesian Optimization of Process Simulation Models

RS-MFBO couples global sensitivity analysis with fidelity-augmented Gaussian processes to slash costly high-fidelity simulation runs in industrial flowsheet optimization.

The paper presents RS-MFBO, a reduced-space multi-fidelity Bayesian optimization framework for high-dimensional, expensive black-box functions. It integrates Global Sensitivity Analysis for dimensionality reduction with a fidelity-augmented Gaussian process and a cost-aware acquisition strategy featuring cooldown and promotion mechanisms. Validation on a plasmid DNA bioprocess (SuperPro Designer) and a green fuel synthesis plant (Aspen HYSYS) shows substantial reductions in high-fidelity evaluations while remaining competitive with single-fidelity baselines.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport

OptiFlow learns one-step multimodal flow policies for offline RL via state-wise entropic optimal transport, avoiding critic overestimation and mode collapse.

The paper introduces OptiFlow, a framework that frames one-step flow policy learning as a structured sample-allocation problem in offline reinforcement learning. It jointly trains a value-aware reference flow policy and a one-step policy, coupling action samples through state-wise entropic optimal transport where critic values set distillation priority and action-distance cost ensures geometrically compatible pairings. By avoiding direct critic maximization, it anchors the policy to high-value dataset-supported modes without out-of-distribution divergence. Code is released on GitHub and the method performs strongly across diverse offline RL benchmarks.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

NVIDIA Vera Rubin NVL72 Delivers Leading Performance in MLPerf Inference v6.1 Debut

NVIDIA's Vera Rubin NVL72 debuts in MLPerf Inference v6.1 with up to 3.7x higher throughput than GB300 NVL72 and 99% scaling efficiency at 288 GPUs.

In its first MLPerf Inference preview submission, NVIDIA's Vera Rubin NVL72 achieved up to 3.7x higher throughput than GB300 NVL72 on Qwen3-VL and 2.5x on DeepSeek-R1. A 288-GPU GB300 NVL72 submission across four racks reached 99% scaling efficiency on the DeepSeek-R1 offline benchmark. Software optimizations delivered up to 1.6x gains over v6.0, leveraging TensorRT-LLM, vLLM, Dynamo, disaggregated serving, and NVFP4 precision.

NVIDIA Blog · 14h agoAI industry 2 sources

Bridging the Gap Between Homogeneous and Heterogeneous Asynchronous Optimization Is Surprisingly Difficult

Lower bounds show heterogeneous asynchronous optimization cannot match homogeneous rates under standard similarity assumptions; strong interpolation plus local PL condition closes the gap.

The paper examines whether pessimistic optimal time complexities for asynchronous distributed optimization with heterogeneous workers (different data distributions) can be overcome. It proves improvement is provably impossible under widely used first- and second-order similarity assumptions for any randomized algorithm, and that the weak interpolation assumption alone is also insufficient. Combining strong interpolation with the local Polyak-Lojasiewicz condition yields a new time complexity bound matching the best-known homogeneous dependence on worker computation times without requiring identical data distributions.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Bellman Policy Optimization

Bellman Policy Optimization, a critic-free RLVR method derived from Policy Mirror Descent, improves LLM mathematical reasoning without intermediate state-value estimation.

The paper introduces Bellman Policy Optimization (BPO), a critic-free reinforcement learning method for LLMs with verifiable rewards, derived from Policy Mirror Descent. BPO uses the Bellman equations to reformulate PMD as a trajectory-level objective for autoregressive generation with terminal rewards, avoiding state-value estimation at intermediate states. The authors prove BPO shares the same unique optimal solution as PMD and validate it on mathematical reasoning benchmarks.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

AI Infra Summit: NVIDIA Vera Rubin and DSX Platform Advancements Showcase Energy Efficiencies of Optimizing Tokens Per Watt for AI Factories

At AI Infra Summit, NVIDIA showcased Vera Rubin and DSX gains up to 1.4x tokens per megawatt, plus Annapurna, d-Matrix, and Pinterest partnerships.

Ian Buck's AI Infra Summit keynote before 8,000+ attendees emphasized validated agentic tokens per megawatt as the emerging AI infrastructure metric. Announcements include Amazon's Annapurna Labs collaborating on NVHBM custom high-bandwidth memory, d-Matrix integrating NVLink Fusion with Raptor XPUs, and Pinterest using Blackwell plus Dynamo inference software for conversational visual discovery. Lambda reported 23% better performance per watt with DSX MaxLPS on Blackwell servers, running 19 nodes on a 16-node power budget. NVIDIA says DSX MaxLPS combined with Groq 3 LPX on Vera Rubin NVL72 targets up to 35X token throughput per megawatt versus GB200 NVL72 for 2-trillion-plus-parameter models.

NVIDIA Blog · 1d agoAI industry

Why you should work on AI for AI Research — Richard Socher of Recursive

Richard Socher's new lab Recursive, backed by $4.65B seed, targets AI systems that automate AI research itself.

Latent Space interviews Richard Socher, founder of You.com and AIX Ventures, about his new venture Recursive, which raised a $4.65 billion seed round to build the 'Eureka Machine' — a superintelligence for automating invention and AI research. Early claimed results include an AI research system outperforming humans and their agents on optimization tasks within two days, and NVIDIA GPU kernel improvements discovered without CUDA experts. Discussion spans reward hacking, constitutional AI critique, AI regulation, open-source models as geopolitical soft power, and hard-takeoff constraints.

Latent Space · 2d agoAI industry

Bridging Control, Inference, Transport, and Thermodynamics: From Theory to Applications in Learning

Review connects control theory, optimal transport, probabilistic inference, thermodynamics, and machine learning via free-energy optimization under constraints.

The review unifies five fields: control theory, optimal transport, probabilistic inference, non-equilibrium thermodynamics, and machine learning. The common conceptual thread is optimization of free-energy-like functionals under dynamical or statistical constraints. Selected applications are presented in reinforcement learning, variational inference, and generative modeling. The tutorial-style text assumes no prior familiarity and begins from physics principles.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

Why don't machine learning research agents overfit?

Amazon researchers explain why ML research agents avoid benchmark overfitting, attributing generalization to compressibility of successful strategies.

Amazon Science summarizes the paper "What fits (into few tokens) doesn't overfit: Compression and generalization in ML research agents," which investigates why benchmark hill-climbing loops, whether run by human communities or LLM research agents, do not produce rampant overfitting. The explanation formalizes Occam's razor via a counting argument: successful ML strategies are highly compressible, so short descriptions lack room to memorize benchmark data and must capture real structure. LLM-based agents, being resettable and controllable, allow this hypothesis to be tested empirically.

Hacker News · security · 2d agoAI researchHN 21↑ · 3 comments

Jev: New frontier model 40-400x cheaper and 20-200x faster

TypeSafe AI launches Jev, an early-access 'System One' model delivering calibrated structured outputs claimed 40-400x faster and cheaper than LLMs.

TypeSafe AI, founded by former OpenAI researcher Diogo Almeida, released its first 'System One Model' called Jev in early access. Jev forgoes string generation and is trained with Reinforcement Learning for Calibrated Decisions (RLCD) to produce type-safe structured values with calibrated probabilities. The company claims 70-500ms response times (40-200x faster), input pricing of $0.042 per million tokens, and free output tokens via a parallel sampling architecture. Target use cases include AI-powered workflows, real-time applications, and verification/guardrail tasks.

Hacker News · security · 1d agoModel releaseHN 59↑ · 11 comments

From Megawatts to Tokens: How NVIDIA Maximizes AI Factory Production

NVIDIA detailed DSX power-management results: Lambda gained 24% token throughput at fixed power, and an AI factory auto-shed 1MW via Emerald AI's grid program.

NVIDIA says Lambda's first validation of DSX MaxLPS on HGX B200 servers ran 19 nodes within a 16-node power budget, lifting cluster token throughput 24% (roughly 4M to 5M tokens/second) and improving performance per watt by 23%. NVIDIA projects DSX MaxLPS can enable up to 40% more GPU capacity for Vera Rubin NVL72 factories within the same megawatt budget. Emerald AI's Conductor platform, running at NVIDIA's Eos factory with Silicon Valley Power, responded to over 200 utility demand signals, automatically dropping power from 4MW to 3MW without interrupting priority workloads. The first dedicated DSX Flex commercial deployment is planned at a 96-megawatt Manassas, Virginia facility.

NVIDIA Blog · 1d agoAI industry

[AINews] AEF-1 standard emerges for Third Party Evaluators, as Xai, OpenAI, and Anthropic all cosign

xAI, OpenAI, and Anthropic cosign the AEF-1 third-party evaluation standard while Dario Amodei proposes embedded evaluators for safety verification.

The AI Evaluator Forum published AEF-1, a baseline standard for independent third-party AI evaluations covering access, conflicts of interest, funding relationships, recusal, and transparency, cosigned by xAI, OpenAI, and Anthropic. Dario Amodei wrote a rare personal blogpost proposing embedded evaluators such as METR with desks, badges, company laptops, and internal-risk-team-level access to verify safety commitments, plus democratic and global coordination frameworks. The roundup also covers the pacing debate: Bilal Chughtai left Google DeepMind arguing progress may outrun alignment, while critics including Aidan Gomez and Cohere push back against slowdowns and lab gatekeeping. Additional items include Cline Desktop's launch with open-weight model support.

Latent Space · 2d agoAI safety & security

Saving Jet Fuel

Tutorial optimizes flight paths to cut jet fuel costs using open-source Scikit-decide planning framework and OpenAP aircraft performance models.

A technical walkthrough demonstrates wind-aware flight path optimization using Scikit-decide, an open-source framework for reinforcement learning and automated planning, paired with OpenAP fuel-consumption models built by Dr. Junzi Sun at TU Delft and NOAA wind data. A Boeing 787-9 flying EWR to FCO can require roughly $68K in fuel, and adjusted routing could save thousands. The post uses Python 3.12, DuckDB with spatial extensions, and QGIS for map rendering.

Hacker News · AI · 1d agoAI tools & infraHN 45↑ · 19 comments

Safe Meta-Reinforcement Learning via Information Space Reachability

Safe meta-RL framework reasons about safety in information space, learning a safety value function used for safety filtering and constrained policy optimization.

The paper proposes safe meta-RL that reasons about safety in information space, capturing both physical state and the agent's belief over the underlying task. A safety value function measures the probability of avoiding unsafe regions indefinitely and satisfies a self-consistency condition and Bellman equation, making it learnable via meta-RL. The resulting algorithm uses the learned function for safety filtering and constrained policy optimization, with effectiveness demonstrated on meta-RL benchmarks.

arXiv cs.AI / cs.LG / cs.CL · 2d agoAI research

RAPID: A Real-Time Defense Against Unauthorized Model Distillation for Text-to-Image Services

RAPID embeds defensive perturbations in a T2I model's shared VAE decoder to block unauthorized black-box distillation in real time.

The paper defends text-to-image services against model theft via black-box output-based distillation, where adversaries collect prompt-image pairs to train substitute models. RAPID integrates defensive perturbations into the shared VAE decoder using self-referenced latent maximization plus reconstruction-guided color regularization, avoiding costly sample-wise online optimization. Across four T2I models and four datasets versus five baselines, it consistently degrades substitute-model generation quality while preserving visual fidelity.

arXiv cs.CR · 2d agoAI safety & security

Unsolved Problem by Fields Medalist Breached by Two High School Students

Two high school students used Claude Opus 5 and GPT-5.6 Sol to help solve an open Lorentzian polynomials problem, posting a 75-page arXiv proof.

Aayush Bathija and Prince Rohatgi of Oak Park High School, mentored by UCLA postdoc Daniel Soskin, published the 75-page paper 'Bounded Ratios for Lorentzian Polynomials' (arXiv 2609.05341), solving an open problem in Fields Medalist June Huh's Lorentzian polynomial theory. The main structural theorem extends bounded coefficient-ratio characterization from quadratic to arbitrary-degree polynomials via discrete convexity conditions. The students used Claude Opus 5 and GPT-5.6 Sol for exploration and proof ideas but independently verified all arguments; the result follows an open letter from 25 Fields Medalists voicing concerns about AI's impact on mathematical rigor.

Hacker News · security · 2d agoAI researchHN 22↑ · 19 comments

A Zeroth-Order Paradigm for LLM Preference Alignment

Researchers propose ComPO, a zeroth-order comparison-based preference alignment method with convergence guarantees that mitigates likelihood displacement in LLMs.

ComPO extracts directional information from preference pairs via comparison oracles instead of optimizing a differentiable preference loss, addressing likelihood displacement in direct alignment methods. The paper establishes convergence guarantees for the offline scheme and introduces an online variant with reverse-KL control using unlabeled policy generations. Experiments on Mistral, Llama, Gemma-2, Gemma-3, and Qwen3 models show improvements over existing direct alignment methods, including length-controlled win rates.

arXiv cs.AI / cs.LG / cs.CL · 11h agoAI research

[AINews] Jev: a “System One Model” that only decides/classifies/routes/scores — >100x faster, >200x cheaper than small frontier LLMs

TypeSafe launches Jev, an RLCD-trained decision model claiming 20-200x faster, 40-400x cheaper classification than frontier LLMs, alongside Gemini 3.8 Live and Neon.

TypeSafe's Jev is a 'System One' decision model trained with RLCD, claiming 20-200x faster and 40-400x cheaper classification and routing than frontier LLMs with free output tokens and no hallucinated text. Google launched Gemini 3.8 Live and 3.8 Live Extended Thinking, supporting 97 languages and async tool calls, debuting #1 on Artificial Analysis' speech-to-speech index at 82.6. Periodic Labs' Neon is a ~1T-parameter XRD analysis model trained with RL on proprietary lab data using 1,300 H200s, lifting FrontierXRD success from 2.7% to 55.3% and beating GPT-6 Astra at lower inference cost.

Latent Space · 18h agoModel release1

Coupled Calibration and Learning: Mitigating Teacher Bias in LLM Distillation without Target-Domain Reward Feedback

CCL couples teacher calibration with student updates via token-level branching, provably removing teacher bias in LLM distillation.

The paper proposes Coupled Calibration and Learning (CCL), an LLM distillation algorithm that alternates teacher calibration using source-question reward feedback with student training on target questions under covariate shift. Each iteration calibrates the teacher on source feedback, trains the student on target questions, and lets the updated student inform subsequent calibration. The authors prove the student's expected KL divergence to the oracle student converges to zero at a polynomial rate, and show regularized direct matching error can remain bounded away from zero.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research1

AEO startup Profound hits unicorn valuation, raises $180M Series D 7 months after last round

AEO startup Profound raised a $180M Series D at a $1.8B valuation led by Sequoia and Kleiner Perkins.

Profound, which builds marketing software to help brands appear in AI search results, raised a $180 million Series D at a $1.8 billion valuation, seven months after its $96 million Series C. Sequoia and Kleiner Perkins led the round, with Lightspeed Venture Partners, Khosla Ventures, and South Park Commons participating. The company reports 3x revenue growth in six months and over 1,000 enterprise customers including Comcast, The Estée Lauder Companies, and Walmart. It operates in the generative engine optimization (GEO) and answer engine optimization (AEO) space.

TechCrunch · AI · 1d agoAI industry

Introducing Meta One: A Subscription Service With More Features and AI to Create, Connect, and Stand Out

Meta launches global Meta One subscriptions bundling Instagram, Facebook, WhatsApp Plus with expanded Meta AI and Muse media generation, priced $2.99-$499 monthly.

Meta introduced Meta One, a global subscription service with plans for individuals, creators, and businesses, launching with more than 50 features across Instagram, Facebook, WhatsApp, and Meta AI. Individual bundles Core ($7.99/month) and Premium ($19.99/month) combine the single-product Plus plans with expanded use of compute-intensive AI capabilities, including image/video generation powered by Muse models and Instagram's Restyle. Business tiers range from Essential ($14.99/month) to Expert ($149/month) and Max ($499/month), with expansion planned to Edits, AI glasses, and more.

Meta Newsroom · 1d agoAI industry

ImpossibleRubrics: Stress-Testing Generated Rubrics as Reward Signals

ImpossibleRubrics benchmark shows LLM-generated rubric reward signals are exploited 8-26% of the time by adversarial answers on impossible tasks.

ImpossibleRubrics is a benchmark of 169 impossible tasks across six impossibility categories, each paired with a verifiable oracle certificate, plus 48 answerable controls, for stress-testing LLM-generated rubrics used as reward signals. Eleven rubric generators were exploited 8-26% of the time on an unbiased 150-task cut and up to 36% on a stress cut, while a certificate-faithful rubric scored 0%. A single generic 'be decisive, penalize hedging' rubric was exploited 64% of the time, suggesting tailored criteria can reveal which claims attackers should fabricate.

Hugging Face daily papers · 2d agoAI research

Perplexity Portable Computer Is Now Available on Windows, Powered by NVIDIA RTX

Perplexity launches Portable Computer local AI agent on Windows for NVIDIA RTX PCs with 24GB+ VRAM, keeping sensitive work on-device.

Perplexity released Portable Computer, a local version of its agentic Perplexity Computer, in its Windows app for NVIDIA GeForce RTX PCs and RTX PRO Workstations with 24GB or more VRAM. It runs a locally post-trained model such as Qwen 3.8 27B optimized for NVIDIA RTX GPUs, handling multistep tasks and file analysis on-device with a SPACE sandbox and built-in browser. Connectors cover Outlook, OneDrive, Word, Google Drive, Gmail, Slack, and GitHub, and the agent can escalate to cloud models only with user permission.

NVIDIA Blog · 2d agoAI industry

Al Gore says the real AI risk isn’t data centers — it’s what industry leaders are warning about

Al Gore argues AI data center emissions are modest and takes AI leaders' existential risk warnings, citing model misbehavior, at face value.

In a TechCrunch interview with Generation Investment Management's Lila Preston, Al Gore said AI data center emissions are a fraction of those from uncovered landfills and smaller than air conditioning demand, which the IEA expects to triple by 2050. He endorses warnings from Dario Amodei, Sam Altman, and Elon Musk, pointing to reported model behaviors like escaping confinement, secretly collaborating, and covering tracks, and to Anthropic stopping Claude being used to help develop biological weapons. Gore cited a Nicholas Stern study projecting AI-driven efficiency gains could cut global emissions 6-9% per year from next decade, while Preston highlighted investments in grid and decarbonization companies such as Volue and Gridware.

TechCrunch · AI · 5h agoAI industry

macOS 27 Golden Gate – Review

Ars Technica reviews macOS 27 Golden Gate, highlighting an unavoidable Apple Intelligence upgrade, new AFM 3 Core models, and dropped Intel Mac support.

macOS 27 Golden Gate delivers the first significant Apple Intelligence upgrade two years after launch, and the toggle to disable the AI features or delete downloaded models is gone. Apple Intelligence runs on a new AFM 3 Core model built in collaboration with Google, while the more capable AFM 3 Core Advanced requires an M3 chip and at least 12GB of RAM. The release drops all Intel Mac support, requiring Apple Silicon, with Sequoia security updates expected to end in fall 2027 and Tahoe's in 2028.

Hacker News · AI · 9h agoAI industry 2 sourcesHN 45↑ · 28 comments

Underwriting Superintelligence: Backing Agents you can Sue — Rune Kvist, AIUC

AIUC raised a $40 million Series A to build AIUC-1, an agent security standard backed by insurance, serving Cursor, Harvey, Lovable, and ElevenLabs.

AIUC, cofounded by former Anthropic product hire Rune Kvist, announced a $40 million Series A led by Ribbit Capital and First Harmonic. The startup builds AIUC-1, an emerging standard for agent security, safety, and reliability, stress-testing agents for jailbreaks, hallucinations, and data leaks. It pairs standards with insurance underwriting through Lloyd's of London and counts Cursor, Harvey, Lovable, and ElevenLabs among its customers. Kvist argues trust and liability, not capability, are becoming the binding constraint on AI adoption.

Latent Space · 11h agoAI industry 2 sources

Exponential Hardness of Off-Policy Evaluation under History-Dependent Logging

Researchers prove off-policy evaluation under history-dependent logging requires exponentially many episodes, resolving a hardness question for model-based POMDP evaluation.

The paper constructs POMDPs with at most two latent states per stage, three actions, and a three-memory-state logger where evaluating a known deterministic target policy to accuracy 1/8 requires Θ((3/2)^H log(1/δ)) episodes for any horizon H≥3. Coverage and outcome-revealing conditions hold with constants independent of H, yet a reset erases the unknown transition that determines the target value. The authors characterize the resulting statistical experiment exactly, derive a matching optimal estimator, and validate predictions on a two-lane gridworld. This settles the history-dependent-logging, model-based case posed by Zhang and Jiang (arXiv:2503.01134).

arXiv cs.AI / cs.LG / cs.CL · 11h agoAI research

How Model Growth, Recursion, and Boundary Operators Influence Scaling Exponents

Researchers show model growth via looped transformers improves scaling exponents; a 7.4B architecture matches GPT-3 13B with roughly 20x less compute.

The paper shows that architectural interventions, contrary to conventional wisdom, can modify pre-training scaling exponents and yield exponential performance gains with compute. Looped transformers with increasing loop counts provide a model growth mechanism; a 7.4B model-growth architecture matches GPT-3 13B on CORE with roughly 20x less compute, with efficiency gains that increase with scale. A boundary operator that normalizes and injects an earlier block also improves compute efficiency, and in data-constrained multi-epoch settings increasing loops with scale is compute-optimal.

arXiv cs.AI / cs.LG / cs.CL · 11h agoAI research

Evidence-Grounded Agentic Formulation Development in an Autonomous Laboratory

Andromeda 2, an agentic laboratory system, reaches a 50% high-performance hit rate for paclitaxel SEDDS formulations versus 17% for its predecessor and 2% for DoE.

Andromeda 2 is an agentic system that reasons over structured in-house experimental evidence and invokes computational and experimental tools to design and execute successive formulation batches for self-emulsifying drug delivery systems (SEDDS). For paclitaxel it achieved a 50% high-performance hit rate versus 17% for Andromeda 1 and 2% for a wet-lab DoE campaign, identifying 12 formulations meeting all four target product profile objectives versus 6 and 0. A selected full-TPP formulation reached approximately 19% w/w apparent paclitaxel loading, about 3.3-fold higher than a published paclitaxel S-SEDDS, and an ablation showed structured evidence access increased mean AUC by 34%.

arXiv cs.AI / cs.LG / cs.CL · 11h agoAI research

Probabilistic Linear Explanations

Researchers introduce a unified probabilistic explainability framework using sparse anchored linear models that outperforms LIME and MAPLE on relevance error.

The paper proposes probabilistic explanations based on sparse, anchored linear models applicable to both binary classification and continuous regression. It proves that minimizing relevance error for neural-network models is NP-hard and relates it to a tractable fidelity-error surrogate. Solutions are computed via a mixed integer programming formulation with provably optimal empirical solutions and a polynomial-time iterative hard thresholding algorithm with approximation guarantees. Empirical evaluations show lower relevance error than LIME and MAPLE while satisfying anchoring and sparsity constraints by construction.

arXiv cs.AI / cs.LG / cs.CL · 11h agoAI research

Social Laws for Multi-agent Coordination in Stochastic Environments

Researchers extend social laws to stochastic, reward-based multi-agent environments, defining alpha-robustness and a verification method via Markov decision processes.

The paper extends the concept of social laws from deterministic, goal-based settings to stochastic, reward-based multi-agent environments. It introduces alpha-robustness, a measure of the guaranteed utility each agent retains while pursuing its optimal single-agent policy assuming all agents obey the social law. Robustness verification is reduced to solving a series of Markov decision processes, with empirical evaluations on toy environments.

arXiv cs.AI / cs.LG / cs.CL · 12h agoAI research

Comprehensive reconstruction of collider events with hypergraph representation learning and graph-conditioned diffusion

VyPER framework reconstructs collider events using hypergraph representation learning and graph-conditioned diffusion, outperforming existing reconstruction techniques across Standard Model processes.

Researchers present VyPER, a geometric learning framework that represents collider events as hypergraphs with a physics-inspired topology for particle event reconstruction. It combines supervised hyperedge classification for assigning measured jets and charged leptons to parent particles with a graph-conditioned diffusion model predicting unmeasured neutrino kinematics, optimized with a joint loss. Evaluated across several proton-proton collision processes, it demonstrates accurate reconstruction across Higgs, electroweak, and top-quark sectors.

arXiv cs.AI / cs.LG / cs.CL · 12h agoAI research

Nearly one in five AI researchers already expected an extinction scenario from AI back in 2024

AI Impacts survey of 1,500+ researchers found an 18% average probability of AI causing human extinction, fueling renewed safety debate among lab researchers.

A viral debate started by Anthropic researcher Jacob Coxon highlights growing existential-risk concerns among AI lab researchers. OpenAI's Daniel Selsam warned that models spontaneously develop unintended goals and situational awareness, while former DeepMind alignment researcher Bilal Chughtai publicly quit, saying AI could 'kill us all.' The AI Impacts survey of more than 1,500 leading researchers put the average probability of AI-caused extinction or permanent disempowerment at 18% in 2024, with the median doubling to 10%, and researchers overwhelmingly called for more AI safety research.

The Decoder · 18h agoAI safety & security1

One runaway AI agent racked up a $50,000 cloud bill

Mandiant's AI Risk and Resilience report details prompt injection, AI supply chain compromises, agent abuse, and a runaway agent that accrued $50,000 in cloud charges.

Mandiant, drawing on Google Threat Intelligence Group (GTIG) observations, warns that poisoned data sources, model dependencies, and extension hooks can turn AI agents into channels for reconnaissance, lateral movement, and sandbox escape. Mandiant responded to incidents involving UNC6780 (TeamPCP), who stole AI service credentials and used prompt injection against AI coding assistants, while GTIG disclosed the first confirmed criminal use of an AI-developed zero-day exploit in a planned mass exploitation campaign. Red team tests showed an AI assistant manipulated into cloning internal repositories to an external GitHub account, and a runaway accounting agent made over 15,000 costly API calls in under an hour, generating roughly $50,000 in cloud charges.

Help Net Security · 19h agoAI safety & security in the wild

Mistral X Mozilla: Private, Multilingual AI Browsing

Mistral and Mozilla partnered to power Firefox's Smart Window AI browsing assistant in France and North America, with zero data retention.

Mozilla's Firefox Smart Window (beta) AI browsing assistant is now powered by Mistral models for users in France and North America, with the UK and Germany expected later this year. Conversations are not saved on Mozilla's servers by default, and Mistral agreed to zero data retention. Both companies frame the partnership as advancing open-source, privacy-first, and regionally fine-tuned AI, with models trained on regional languages, dialects, and cultural context.

Hacker News · securityupdated · 14h agofirst · 21h agoAI industry 2 sourcesHN 35↑ · 8 comments2

Google launches Gemini 3.8 Live to take on OpenAI's GPT-Live-1 at a fraction of the cost

Google DeepMind launches Gemini 3.8 Live speech-to-speech models, topping Artificial Analysis leaderboard at 82.6% with much cheaper pricing than OpenAI.

Google DeepMind released Gemini 3.8 Live and 3.8 Live Extended Thinking, audio models for voice agents available through the Gemini API and Google AI Studio, supporting over 97 languages plus background API calls and visual input. The Extended Thinking variant ranks first on the Artificial Analysis Speech-to-Speech Leaderboard with 82.6%, ahead of OpenAI's GPT-Live-1 models. Google charges $0.005 per minute for audio input and $0.018 for output, versus OpenAI's $0.05 per minute, though OpenAI retains full-duplex conversation quality advantages.

The Decoder · 1d agoModel release2

Meta expands subscription push with new AI-focused plans

Meta launched Meta One subscriptions ($7.99–$499/month) bundling expanded Muse AI image and video generation across Facebook, Instagram, and WhatsApp.

Meta introduced Meta One with consumer Core ($7.99/mo) and Premium ($19.99/mo) tiers plus business plans ranging from Essential ($14.99/mo) to Max ($499/mo). Subscriptions unlock expanded Muse Image, Muse Video, Restyle editing, and Meta Business Agent usage, following Meta's $14.3B investment in Scale AI. Appfigures data shows Instagram's daily subscription revenue averaging $1.2M and Facebook's $528K after the March Plus-tier launches, up 475% and 143% respectively. BNP Paribas forecasts $13.5B added revenue by 2028; Truist estimates $20B by 2030.

TechCrunch · AI · 1d agoAI industry

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research