本文にスキップ
AI News HubLIVE

モデル価格の最新ニュース

翻訳待ち:Cohere Releases North Small Translate: A 218B MoE Translation Model That Scores 83.6 on WMT26 Across 50 Languages

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Cohere has released North Small Translate, an open-weight Mixture-of-Experts model built for machine translation across 50 languages. It uses 25B of its 218B parameters per token and scores 83.6 on Cohere's WMT26 evaluation. Weights are free for non-commercial use, with commercial access through Cohere Model Vault or RWS Language Weaver. The post Cohere Releases North Small Translate: A 218B MoE Translation Model That Scores 83.6 on WMT26 Across 50 Languages appeared first on MarkTechPost.

MarkTechPostサイト内本文翻訳待ち:Cohere Releases North Small Translate: A 218B MoE Translation Model That Scores 83.6 on WMT26 Across 50 Languages

翻訳待ち:Sakana AI Launches Fugu Max and Fugu Ultra v2 for Cheaper, Stronger Multi-Agent Orchestration

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Sakana AI has released Fugu Max and Fugu Ultra v2, 2 models built on the same learned orchestration architecture. Fugu Max routes tasks to lean open and specialized models, including NVIDIA Nemotron, at $2/$6 per 1M tokens. Fugu Ultra v2 targets peak capability, scoring 48.3 on Chartography and 74.3 on DeepSWE. The post Sakana AI Launches Fugu Max and Fugu Ultra v2 for Cheaper, Stronger Multi-Agent Orchestration appeared first on MarkTechPost.

MarkTechPostサイト内本文翻訳待ち:Sakana AI Launches Fugu Max and Fugu Ultra v2 for Cheaper, Stronger Multi-Agent Orchestration

翻訳待ち:DeepSeek AI Released DeepSeek-V4.1-Flash with 1M Context, FP4 KV Cache, and Cross-Layer Attention Reuse

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Long-horizon agents have turned LLM serving into an input-heavy workload. Repeated prefills and million-token contexts leave KV caches that strain HBM, SSD capacity, and bandwidth. DeepSeek AI built its newest release around that exact bottleneck. DeepSeek-V4.1-Flash is a multimodal Mixture-of-Experts model with 552B backbone parameters, 196B additional Engram parameters, and a 1M-token context window. It […] The post DeepSeek AI Released DeepSeek-V4.1-Flash with 1M Context, FP4 KV Cache, and Cross-Layer Attention Reuse appeared first on MarkTechPost.

MarkTechPostサイト内本文翻訳待ち:DeepSeek AI Released DeepSeek-V4.1-Flash with 1M Context, FP4 KV Cache, and Cross-Layer Attention Reuse

翻訳待ち:TEFM: Token-Efficient Faithful Modeling for Structured Data

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2609.09552v1 Announce Type: new Abstract: In this paper, we solve two fundamental obstacles in applying LLMs to critical domains: token efficiency and faithfulness. To address both constraints jointly, we present TEFM (Token-Efficient Faithful Modeling), a framework designed for structured data analysis in critical domains. TEFM achieves token efficiency by compressing lengthy structured observations into compact Behavioral Code tokens, dramatically reducing token consumption with minimal information loss. Moreover, TEFM enables faithful rationalization through a dual-fidelity objective that jointly optimizes code-level reconstruction and prediction-level fidelity, identifying minimal sufficient feature subsets grounded in input data. Comprehe…

arXiv Computational Linguisticsサイト内本文翻訳待ち:TEFM: Token-Efficient Faithful Modeling for Structured Data

翻訳待ち:Osprey: Target-agnostic Pre-training Makes Stronger Drafters in Speculative Decoding

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2609.09338v1 Announce Type: new Abstract: Speculative decoding is critical for accelerating LLM inference. However, the speedup is fragile: drafters are typically trained against a narrow distribution for a single target model, and their acceptance rate collapses under workload shifts. This is a striking inversion of modern LLM development, where target models are valued precisely for the broad generalization they acquire through large-scale pretraining. We argue that the natural remedy, pretraining, has been hard to apply to drafters because existing recipes are target-specific: the drafter consumes the target's hidden states and is distilled on the target's logits, so pretraining must be repeated for each target. We introduce Osprey, which i…

arXiv Computational Linguisticsサイト内本文翻訳待ち:Osprey: Target-agnostic Pre-training Makes Stronger Drafters in Speculative Decoding

翻訳待ち:X-CoSD: Communication-Efficient Cross-Vocabulary Collaborative Speculative Decoding

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2609.09166v1 Announce Type: new Abstract: This paper investigates collaborative speculative decoding (CoSD), a distributed large language model (LLM) inference framework in which an on-device small language model (SLM) drafts candidate tokens and a server LLM verifies them. Existing CoSD methods assume a shared vocabulary between the SLM and the LLM and incur substantial communication load because residual resampling requires token distribution exchange between the user device and the edge server. To address these limitations, we propose cross-vocabulary CoSD (X-CoSD), a lossless and communication-efficient CoSD framework for heterogeneous SLM-LLM vocabularies. X-CoSD is built on hybrid resampling (HR), which splits residual resampling across…

arXiv Computational Linguisticsサイト内本文翻訳待ち:X-CoSD: Communication-Efficient Cross-Vocabulary Collaborative Speculative Decoding

翻訳待ち:PAC-Private Autoregressive Generation: Calibrating Noise to Ensemble Disagreement

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2609.05676v1 Announce Type: new Abstract: Language models adapted on private text are often served through APIs, so privacy leakage occurs through generated outputs rather than exposed weights. Private prediction protects these releases. Methods such as PMixED incur privacy cost at each release and increasingly rely on the public model over long horizons. PAC privacy instead calibrates noise to output variability across possible secrets, adding less noise when predictions are stable. To our knowledge, PAC-private prediction has not previously been extended from classification to autoregressive generation. We construct $m=128$ overlapping worlds from the private corpus, with each record appearing in exactly $m/2$ worlds, and train one adapter p…

arXiv Machine Learningサイト内本文翻訳待ち:PAC-Private Autoregressive Generation: Calibrating Noise to Ensemble Disagreement

翻訳待ち:AI Models Are Watermarking Text—Will You Notice?

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:On 11 August, Anthropic announced that all future Claude models will generate text that contains a watermark that identifies its results as AI generated. The company is not alone. Google has its own text watermark (which Anthropic’s is based on) it uses on the output of its Gemini models. OpenAI has yet to introduce a text watermark but it plans to do so. The rapid spread of watermarking is in part a response to the European Union’s AI Act, which mandates watermarks for AI models released after 2 August, 2026, along with other planned and proposed regulations aimed at curbing the spread of deceptive or manipulative AI-generated content. But the new rules may come at a cost for AI users who simply want the best possible results. AI watermarks can app…

IEEE Spectrum AIサイト内本文翻訳待ち:AI Models Are Watermarking Text—Will You Notice?

翻訳待ち:[AINews] OpenAI reports Navier-Stokes singularity find in 88 hours using Astra-next, roughly 10,000 agents and 130B tokens (>$40M), a contender for second ever Millennium Prize awarded

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Overshadowing Cognition's $48B Series E, Mistral's $24B Series D, Meta's Muse agent, and GPT Image 2.5. The most jam packed, feel the AGI day in the history of AI.

Latent Spaceサイト内本文翻訳待ち:[AINews] OpenAI reports Navier-Stokes singularity find in 88 hours using Astra-next, roughly 10,000 agents and 130B tokens (>$40M), a contender for second ever Millennium Prize awarded

HarvestBench:LLMエージェントが動物を殺すのを避けるために対価を払うかを測る

HarvestBenchは、LLMエージェントがトウモロコシ収穫のため2台のトラクターを操作する農場シミュレーション。動物が進路を塞ぐと、直進(燃料不要)か迂回(燃料コスト)かをモデルに選択させる。9モデル・7201件の価格付き意思決定で動物に関するものは3951件、殺傷率は0.4%〜98.8%とばらつき、能力順とは一致しなかった。6モデル中4つは価格に有意に反応し、すべてのモデルが野生動物を家畜より多く轢いた。道徳的ブリーフィングがあると6推論モデル中5つで殺傷率が6%未満になるが、取り除くと全モデルで84%超になった。判定にLLMを使わずログの事象を数えるため再現可能。

arXiv AIサイト内本文HarvestBench:LLMエージェントが動物を殺すのを避けるために対価を払うかを測る

【AINews】GPT-6 Astra:OpenAI史上最大規模のLLMリリース

OpenAIが新フラッグシップモデル「GPT-6 Astra」を発表。「最も知的で整合したモデル」とされ、コンピュータ操作やソフトウェアエンジニアリング、数学・科学分野での飛躍がうたわれた。一方、第三者評価では能力向上は一様ではなく、トークン価格の上昇と思考連鎖の監視可能性の低下が、ベンチマーク飽和や安全性、ガバナンスをめぐる激しい議論を呼んでいる。

Latent Spaceサイト内本文【AINews】GPT-6 Astra:OpenAI史上最大規模のLLMリリース

OpenAI、GPT-6 Astraを公開 1.05Mコンテキストのコンピュータ操作モデル、重大なサイバー閾値で制限

OpenAIは2026年9月3日、GPT-6 Astraを公開した。チャットモデルではなくコンピュータ操作を主目的とする旗艦モデルで、OSWorld V2-Offlineで72.6%、Codexのコンパクションを検索可能なノートに置き換え、105万トークンのコンテキストを持ち、価格は入力100万トークンあたり10ドル、出力100万トークンあたり50ドル。またOpenAI初のCriticalサイバーセキュリティ閾値到達モデルとなり、標準アクセスではエクスプロイト開発などが制限される。

MarkTechPostサイト内本文OpenAI、GPT-6 Astraを公開 1.05Mコンテキストのコンピュータ操作モデル、重大なサイバー閾値で制限

Google DeepMind、Gemini 3.8 FlashとGemini 3.8 Flash Cyberをリリース—1つのコアモデルに2つのアクセス境界

Googleは2026年9月2日、Gemini 3.8 FlashとGemini 3.8 Flash Cyberを発表した。両バリアントは同じ基盤インテリジェンスを共有し、モデル規模ではなく安全性の対策によって区別される。3.8 FlashはGemini APIやAI Studioなどで一般提供され、100万トークンあたり0.75ドル/3.75ドルの価格が2026年12月31日まで適用される。Flash CyberはCWE-Benchで47.2%のpass@1を達成する一方、Fairwind Programを通じて審査された防御側のみが利用できる。本稿ではベンチマーク、トークンと精度のトレードオフ、導入条件をまとめる。

MarkTechPostサイト内本文Google DeepMind、Gemini 3.8 FlashとGemini 3.8 Flash Cyberをリリース—1つのコアモデルに2つのアクセス境界

Anthropic、Fable 5.1を発表しAI価格競争に参入

AnthropicはFable 5.1のキャッシュ読み取り価格を引き下げ、同モデルはMythos 5.1に類似しているが、安全対策が異なると述べています。

AI Businessサイト内本文Anthropic、Fable 5.1を発表しAI価格競争に参入

電力価格予測とバッテリーアービトラージのための基盤モデル:市場固有の予測モデルを置き換えられるか?

この研究は、2021年から2025年にかけてドイツ、ポーランド、スペインの電力市場において、5つの基盤モデルファミリーから選ばれた9つのバリアント(ゼロショットモード)を、2つの最先端の電力価格予測ベンチマークと比較しました。統計的にはTabPFNモデルのみが全市場で一貫してベンチマークを大幅に上回りましたが、経済的優位性は限定的で、無制限入札やリスクの高いクォンタイル戦略ではTabPFNが最適である一方、リスク許容度が低い場合にはDistributional Deep Neural Networkベンチマークの方が収益性が高いことが示されました。したがって、基盤モデルは市場固有のモデルを普遍的に置き換えることはできず、その価値はモデルアーキテクチャと意思決定問題に依存します。

arXiv Machine Learningサイト内本文電力価格予測とバッテリーアービトラージのための基盤モデル:市場固有の予測モデルを置き換えられるか?

Anthropic、Claude Fable 5.1を発表、エージェント作業で最大45%安価と主張

Anthropicは、価格、データ保持、過剰な安全対策に関する顧客の批判に対応するため、最新AIモデルFable 5.1とMythos 5.1を発表した。Fable 5.1は性能が向上し、価格は通常25%低く、複雑なエージェント作業では最大45%低くなる。初期ユーザーからの評価は好評だが、Mythos 5.1はProject Glasswing参加者のみが利用できる。

The Verge AIサイト内本文Anthropic、Claude Fable 5.1を発表、エージェント作業で最大45%安価と主張

MetaのClaude Code対抗ツールがベータ版を卒業し、3つの新しいサブスクリプションプランを導入——価格で強気に攻める

Metaはコーディングエージェント「Muse Code」を正式にベータ版からリリースした。新機能としてセッション間メッセージング、ワークフロー、巻き戻し機能を追加し、月額5ドル、15ドル、50ドルのサブスクリプションプランを導入。価格は競合を大幅に下回るが、テストではトークン消費が多く、リファクタリング結果が弱いことが判明。Metaのデータ収集目的への懸念も残る。

The New Stack AIサイト内本文MetaのClaude Code対抗ツールがベータ版を卒業し、3つの新しいサブスクリプションプランを導入——価格で強気に攻める

翻訳待ち:RoboGesture: Real-Time Semantic-aligned Co-Speech Gestures Generation for Humanoid Interaction

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.28693v1 Announce Type: new Abstract: Enabling humanoid robots to respond to human speech with synchronized and semantically meaningful gestures is fundamental to natural human-robot interaction. However, this task faces three critical barriers: the scarcity of semantically rich datasets, the "modality eclipse" where models ignore audio cues in favor of kinematic inertia, and the sim-to-real gap regarding physical safety. We propose RoboGesture, a robot-centric framework that co-designs data, modeling, and control to power a complete interactive human-humanoid system in which the robot listens, responds, and gestures in real time. We first establish the RoboGesture dataset featuring over 300 gesture categories and develop an automated pipe…

arXiv Roboticsサイト内本文翻訳待ち:RoboGesture: Real-Time Semantic-aligned Co-Speech Gestures Generation for Humanoid Interaction

翻訳待ち:RedLight-VLA: Models for traffic-rule grounding and behavioral emphasis in driving policies

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.28656v1 Announce Type: new Abstract: Behavior-cloned Vision-Language-Action (VLA) driving policies struggle with rare rule-governed maneuvers at signalized intersections. Braking and launching examples contribute little to averaged trajectory loss, while fused representations lack explicit supervision for the governing traffic-light and stop-line state. We present RedLight-VLA, a training objective that uses expert futures and automatically generated perception targets without additional manual rule annotation. First, trajectory-derived behavioral reweighting (BR) emphasizes rare deceleration and acceleration using rotation-invariant longitudinal dynamics and a scale-preserving reduction that exactly recovers the baseline when disabled. S…

arXiv Roboticsサイト内本文翻訳待ち:RedLight-VLA: Models for traffic-rule grounding and behavioral emphasis in driving policies

翻訳待ち:SemKV: Semantic Mixed-Precision KV Cache Quantization Guided by the Quality Cliff for Long-Context LLM Inference

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.28911v1 Announce Type: new Abstract: The key-value (KV) cache is the dominant memory bottleneck of long-context large language model (LLM) inference, growing linearly with context length. We show that uniform KV quantization on a fractional-bit grid does not degrade gracefully: under a prespecified multi-seed statistical protocol, Llama-3.1-8B-Instruct with an affine quantizer is statistically indistinguishable from FP16 KV down to 2.322 code bits/value and collapses at 2.0 bits - a quality cliff in (2.0, 2.322] that reappears in generation-time quantization and multi-turn dialogue and transfers to Mistral-7B. The cliff reframes importance-aware mixed precision: above it, eight model-internal importance indicators are statistically interc…

arXiv Machine Learningサイト内本文翻訳待ち:SemKV: Semantic Mixed-Precision KV Cache Quantization Guided by the Quality Cliff for Long-Context LLM Inference

翻訳待ち:Accelerating LLM Inference via Vector Index Based Output Embeddings

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.27460v1 Announce Type: new Abstract: Large output embedding matrices create a significant memory bandwidth bottleneck during autoregressive decoding, especially for compact LLMs with large multilingual vocabularies. We reformulate the output projection followed by top-k token selection as a maximum inner product search over token embeddings and replace the dense vocabulary projection with an HNSW-based vector index. The resulting output head retrieves only a small candidate set of high-scoring tokens and can be integrated into existing decoding pipelines by scattering retrieved logits into a sparse full-vocabulary tensor. On CPU inference with Gemma 3, Llama 3.2, and Qwen 3 models, our method substantially accelerates the output projectio…

arXiv Computational Linguisticsサイト内本文翻訳待ち:Accelerating LLM Inference via Vector Index Based Output Embeddings

翻訳待ち:Show HN: 1endpoint – Cheaper access to AI models

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:One API · usage-based pricing Multiple models. One endpoint. Use one compatible API, switch models without rewriting your integration, and pay for the tokens you actually use. Base URL /api/v1/chat/completions Start bui…

Hacker News AIサイト内本文翻訳待ち:Show HN: 1endpoint – Cheaper access to AI models

翻訳待ち:Introducing Hy4 Preview

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要: Introducing Hy4 Preview New open weight text input (no vision) LLM from Chinese company Tencent today: 770B total parameters, 49B active parameters, 1M token context window, 1.56TB on Hugging Face. This is a big size increase from their previous Hy3 in July, which was 295B, 21B active, 256,000 context, 598GB. I recently started using model chat templates to better understand their capabilities. Here's Hy4's chat_template.jinja on Hugging Face, which includes this section: {%- if not reasoning_effort is defined %} {%- set reasoning_effort = 'high' %} {%- elif reasoning_effort not in ['high', 'no_think'] %} {%- if reasoning_effort is none %} {{- raise_exception('reasoning_effort error : None, should be no_think/high') }} {%- else %} {{- raise_excepti…

Simon Willison's Weblogサイト内本文翻訳待ち:Introducing Hy4 Preview

翻訳待ち:The Latent Diagnostic Taxonomy: A Framework for Constructing Classifiers and Diagnosing Their Decisions, Applied to Prompt Injection Detection

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.26423v1 Announce Type: new Abstract: This paper proposes a framework for constructing a classifier as a safeguard layer, and for developing a complementary diagnostic that identifies which of the classifier's confident decisions can be trusted. This framework, the Latent Diagnostic Taxonomy, consists of (i) constructing a dimensionality-optimized classifier, in which the embedding dimensionality is empirically selected via cross-validated performance rather than fixed a priori, (ii) locating a relatively small set of latent support vectors (~ 29% of total training examples) representing influential prompts for identifying tokens that alter the classifier's predicted labels, and (iii) utilizing such tokens and their associated attack magni…

arXiv Machine Learningサイト内本文翻訳待ち:The Latent Diagnostic Taxonomy: A Framework for Constructing Classifiers and Diagnosing Their Decisions, Applied to Prompt Injection Detection

翻訳待ち:SLM-Conditioned Hierarchical Relation Routing for Labeled Property Graph Learning

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.26132v1 Announce Type: new Abstract: Labeled property graphs combine relational structure with heterogeneous textual and categorical properties attached to both nodes and relationships. Conventional graph neural networks typically represent these properties as static feature vectors, limiting their ability to determine which semantic evidence should influence message propagation for a particular prediction target. We propose SLM-Conditioned Hierarchical Relation Routing, an architecture that integrates a small language model directly into graph message selection. A topology GNN provides a stable structural representation and prediction anchor. For each target node, incident messages combine the neighbor's structural state, node-property e…

arXiv Machine Learningサイト内本文翻訳待ち:SLM-Conditioned Hierarchical Relation Routing for Labeled Property Graph Learning

翻訳待ち:LLMs for Academic Workflows: An Evaluation of Literature Reviews Generated with Short and Long Context Windows of LLMs

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.26145v1 Announce Type: new Abstract: Our research focuses on evaluating literature reviews generated in short and long context settings of large language models (LLMs) to investigate the impact of context window on the quality of AI-generated literature reviews and the role of AI in supporting literature review writing. Twenty AI-generated literature reviews based on research sources from Semantic Scholar and Arxiv were evaluated by two researchers across 15 dimensions. Our findings reveal that AI-generated literature reviews require human oversight to meet academic publishing standards. As context windows increase, LLMs can incorporate broader information and maintain coherence across longer inputs, but they also exacerbate issues such a…

arXiv AIサイト内本文翻訳待ち:LLMs for Academic Workflows: An Evaluation of Literature Reviews Generated with Short and Long Context Windows of LLMs

翻訳待ち:GaussVLA: Geometry-Aware Spatial Reasoning for Vision-Language-Action Model

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.24959v1 Announce Type: new Abstract: Vision-Language-Action (VLA) models encode visual observations as flat 2D patch tokens that carry no intrinsic geometric structure, and augmenting them with dense monocular depth injects per-pixel scalar values that encode neither surface orientation nor geometric confidence. This leaves the policy with limited structured spatial reasoning for action prediction. We propose GaussVLA, a Mamba-based VLA that incorporates two custom modules: Gaussian Spatial Tokenizer (GST) to lift frozen semantic and depth features into compact 3D Gaussian tokens, pools geometrically salient regions with learned queries, and \emph{Depth-Aware Chain-of-Thought (DA-CoT)} that performs structured, non-autoregressive geometri…

arXiv Roboticsサイト内本文翻訳待ち:GaussVLA: Geometry-Aware Spatial Reasoning for Vision-Language-Action Model

翻訳待ち:See More, Detect Less? Taming Information Leakage in Multi-View Anomaly Detection

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.25168v1 Announce Type: new Abstract: In multi-view anomaly detection, more cross-view information can actually hurt. When multiple inspection views are naively fused in a reconstruction-based pipeline, normal cues from intact views propagate to the decoder, which faithfully reconstructs anomalous regions, collapsing the reconstruction gap the detector depends on. We call this failure mode \emph{cross-view information leakage} and show that effective multi-view fusion must explicitly restrict the information reaching the decoder. Building on this insight, we present GLAD(Global-Local Attention Driven framework), the first framework combining vision foundation model features with local and global cross-view fusion for multi-view anomaly det…

arXiv Computer Visionサイト内本文翻訳待ち:See More, Detect Less? Taming Information Leakage in Multi-View Anomaly Detection

翻訳待ち:Targeting the Attention Heads Behind Object Hallucination in LLaVA

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.24966v1 Announce Type: new Abstract: Vision-language models such as LLaVA-1.5-7B often hallucinate objects absent from the image when generating captions. We ask whether an interpretability diagnosis of this failure can guide a targeted fix, and we measure what that fix actually changes. We rank attention heads by how much their image attention drops around hallucinated object words, then screen the shortlist by ablating candidate heads and measuring the change in hallucination-token log probability, yielding a 32-head set. We restrict two interventions to these heads: a head-sliced LoRA adapter and an inference-time grounding controller. On 400 held-out COCO images, the combined method lowers CHAIRs (the fraction of captions with a hallu…

arXiv Computer Visionサイト内本文翻訳待ち:Targeting the Attention Heads Behind Object Hallucination in LLaVA

翻訳待ち:The Dialect Tax: Dialectal Biases Persist throughout the Language Modeling Pipeline

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.24952v1 Announce Type: new Abstract: Systematic dialectal performance gaps in language models (LMs) are well documented, but the source of these disparities within the modern language modeling pipeline remains unclear. Our study traces this "dialect tax" across the natural language processing pipeline. Using parallel English dialect corpora that hold meaning fixed while varying surface form, we first confirm that LMs recognize matched Standard American English (SAE) and dialectal texts as semantically equivalent. However, we discover further representational gaps corresponding to downstream performance gaps. Across model families and generations, modern LMs still encode dialectal texts unequally during tokenization, pre-training, post-tra…

arXiv Computational Linguisticsサイト内本文翻訳待ち:The Dialect Tax: Dialectal Biases Persist throughout the Language Modeling Pipeline

翻訳待ち:Qwen3.8-Flash-Next

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要: Qwen3.8-Flash-Next Another open weights model from Qwen. This one is "a multimodal MoE model that also serves as an early preview of the architecture used in Qwen4". It's pretty big: 125B tokens, but only 6B active which means it gets a pretty big performance boost. I've been trying it out on a DGX Spark using these Unsloth quantized models. I'm still exploring the model - so far I've tried the 72.5GB UD-IQ1_S one (producing these pelicans) and the 78.9GB UD-Q2_K_XL (producing these). My favorite so far was this xhigh reasoning effort one from UD-Q2_K_XL: Via Hacker News Tags: ai, generative-ai, llms, qwen, pelican-riding-a-bicycle, ai-in-china, nvidia-spark

Simon Willison's Weblogサイト内本文翻訳待ち:Qwen3.8-Flash-Next

翻訳待ち:Z.ai Releases GLM-5.3-Flash: A 320B-A18B Natively Multimodal MoE With a 1M-Token Context

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Z.ai has released GLM-5.3-Flash, the first natively multimodal model in the GLM-5 series — a 320B-total / 18B-active MoE with a 1,048,576-token context window, MIT-licensed weights on Hugging Face, and API pricing at $0.15/M input and $0.50/M output. It scores 84.3 on Terminal-Bench 2.1 and 63.4 on DeepSWE v1.1, using hybrid KDA linear plus NoPE sparse MLA attention to cut attention compute ~3× and KV cache 4.4× versus GLM-5.3. The post Z.ai Releases GLM-5.3-Flash: A 320B-A18B Natively Multimodal MoE With a 1M-Token Context appeared first on MarkTechPost.

MarkTechPostサイト内本文翻訳待ち:Z.ai Releases GLM-5.3-Flash: A 320B-A18B Natively Multimodal MoE With a 1M-Token Context

翻訳待ち:Alibaba’s Qwen Team Releases Qwen3.8-Flash-Next: A 125B Multimodal MoE With 6B Active Parameters Previewing the Qwen4 Architecture

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:We look at Qwen3.8-Flash-Next, Alibaba's open-weight multimodal Mixture-of-Experts model and an early preview of the Qwen4 architecture. We break down where the 180B parameters actually sit: a 125B backbone, a 51B N-gram embedding table, and a 4B multi-token prediction module, with only 6B active per token. We walk through the four architectural changes — the Gated DeltaNet and Qwen Sparse Attention hybrid, Gated Residual, N-gram Embedding, and the Muon optimizer. We also cover the benchmark results, the reported 1/9 training cost against Qwen3.7-Plus, and what self-hosting a 172.78 GiB FP8 checkpoint really demands. The post Alibaba’s Qwen Team Releases Qwen3.8-Flash-Next: A 125B Multimodal MoE With 6B Active Parameters Previewing the Qwen4 Archite…

MarkTechPostサイト内本文翻訳待ち:Alibaba’s Qwen Team Releases Qwen3.8-Flash-Next: A 125B Multimodal MoE With 6B Active Parameters Previewing the Qwen4 Architecture

翻訳待ち:A survey detection channel overrides the pixels in an astronomical foundation model, and biases tomographic mean redshifts

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.23626v1 Announce Type: new Abstract: Foundation models for astronomy are trained on survey pixels together with the catalogue products derived from those pixels. Those catalogues are incomplete at a measurable rate, and a model trained on both inherits that incompleteness as a systematic. We audit AION-1, a 39-modality transformer trained on more than 200 million objects, using causal interventions on its inputs. Holding the image tokens byte-identical and editing only the survey segmentation map changes every quantity the model reports -- flux, size, ellipticity, redshift -- by 110-4400 times a matched placebo. The mechanism is detection gating, presence at the field centre (r = 0.47), not the light the mask encloses (r = 0.30); across 3…

arXiv AIサイト内本文翻訳待ち:A survey detection channel overrides the pixels in an astronomical foundation model, and biases tomographic mean redshifts

翻訳待ち:Mitigating Bias in Large Vision-Language Models via Counterfactual Ensemble Decoding

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.21415v1 Announce Type: new Abstract: Large Vision-Language Models (LVLMs) have achieved remarkable performance across a wide range of tasks; however, they often inherit social biases from their training data, resulting in biased behavior when processing portraits from different social groups. Existing debiasing approaches typically compare token probabilities between the original and biased generations during decoding, but they are fundamentally limited by their reliance on a single, stereotyped viewpoint and fail to account for the diversity of social perspectives. Inspired by the social science principle that diversity fosters fairness, we propose Counterfactual Ensemble Decoding (CED), a novel framework that constructs multi-group coun…

arXiv Computational Linguisticsサイト内本文翻訳待ち:Mitigating Bias in Large Vision-Language Models via Counterfactual Ensemble Decoding

翻訳待ち:SchemaRouter: Field-Aware Tool Routing for Efficient Heterogeneous Agentic RAG

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.21375v1 Announce Type: new Abstract: Heterogeneous agentic retrieval-augmented generation (RAG) systems increasingly orchestrate external APIs, internal databases, vector stores, and graph stores. Exposing all tool descriptions to an LLM agent, or selecting tools only by vector similarity, causes two costly failures: over-fetching, which increases payload size, token use, and latency, and under-fetching, which omits fields needed to answer the query. We present SchemaRouter, a lightweight routing layer that represents tools, endpoints, parameters, response fields, domain concepts, units, provenance, and license policies as a schema graph. Given a query, SchemaRouter emits an executable tool plan specifying which tools to call and which fi…

arXiv AIサイト内本文翻訳待ち:SchemaRouter: Field-Aware Tool Routing for Efficient Heterogeneous Agentic RAG

翻訳待ち:KVBoost: Chunk-Level Key-Value Cache Reuse with Deviation-Guided Recomputation for Efficient Large Language Model Inference

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.21362v1 Announce Type: new Abstract: Transformer-based large language models (LLMs) incur high prefill latency because key-value (KV) tensors must be recomputed for each request. Existing prefix-caching systems reduce this cost but require prompts to share a leading contiguous prefix, limiting effectiveness when shared content appears at arbitrary positions. We present KVBoost, a chunk-level KV cache reuse system for HuggingFace-compatible decoder models that enables reuse regardless of content position. KVBoost introduces a dual-hash keying scheme that separates positional identity (prefix hash) from content identity (content hash), supporting both exact and approximate cache matches. To address attention boundary errors from independent…

arXiv AIサイト内本文翻訳待ち:KVBoost: Chunk-Level Key-Value Cache Reuse with Deviation-Guided Recomputation for Efficient Large Language Model Inference

翻訳待ち:Generalist AI Releases GEN-1.5: A Robot Foundation Model That Learns New Tasks From One 3–12 Second Demo

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Generalist AI has released GEN-1.5, a robot foundation model that learns a new physical task from a single demonstration. Drop 3–12 seconds of sensorimotor data into its 30-second context window, and the robot performs the task. No gradient updates, no fine-tuning, no task-specific programming. Across 10 diverse manipulation tasks, this one-shot in-context prompting averaged 59% […] The post Generalist AI Releases GEN-1.5: A Robot Foundation Model That Learns New Tasks From One 3–12 Second Demo appeared first on MarkTechPost.

MarkTechPostサイト内本文翻訳待ち:Generalist AI Releases GEN-1.5: A Robot Foundation Model That Learns New Tasks From One 3–12 Second Demo

翻訳待ち:How to Use Kimi K3: Moonshot AI’s 2.8T Open-Weight Model

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Moonshot AI’s Kimi K3 is a 2.8-trillion-parameter open-weight model built with a Mixture-of-Experts architecture. It activates only a small fraction of its parameters per token, helping reduce inference costs while delivering strong coding and agentic performance. K3 combines near-frontier capabilities, open weights, and lower API pricing, making it an interesting alternative to proprietary models. In […] The post How to Use Kimi K3: Moonshot AI’s 2.8T Open-Weight Model appeared first on Analytics Vidhya.

Analytics Vidhyaサイト内本文翻訳待ち:How to Use Kimi K3: Moonshot AI’s 2.8T Open-Weight Model

翻訳待ち:Inhibitory Attention for Clinical Long-Context Reasoning: Characterizing and Mitigating Lost-in-the-Middle Effects in EHR Processing

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.20348v1 Announce Type: new Abstract: Electronic health records now routinely exceed 100,000 tokens per patient. Yet large language models exhibit the lost-in-the-middle (LitM) effect: information near the center of a long context is retrieved less reliably than information near the edges. In clinical use this is not benign: the single most consequential fact in a note can sit at its center. We term this the clinical lost-in-the-middle (CLitM) problem, give its first systematic characterization using MedAlign, and compare context-selection strategies as remedies. Across 2,196 instruction-response pairs and six language models, we observe a 21.9 percentage-point gap between peak accuracy (59.5%, 95% CI [46.3, 71.0], 20-30% decile) and troug…

arXiv Computational Linguisticsサイト内本文翻訳待ち:Inhibitory Attention for Clinical Long-Context Reasoning: Characterizing and Mitigating Lost-in-the-Middle Effects in EHR Processing

翻訳待ち:BF1: A Causal Dyadic Sparse-Attention Retrofit for Efficient Long-Context Transformers

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.20427v1 Announce Type: new Abstract: Dense causal attention remains expensive at long context even when implemented with highly optimized exact kernels. We study BF1, a deterministic block-aligned dyadic sparse-attention route that combines a small exact local neighborhood, a global first block, and logarithmically spaced historical blocks. The route is related to prior log-sparse and dilated attention patterns; our contribution is a correctness-gated pretrained-model retrofit, a matched topology-control study, and a systems characterization that connects per-layer sparsity to whole-model latency. For fixed block width, every converted layer uses O(n log n) selected token interactions and has O(log n) graph communication depth. On an NVID…

arXiv Machine Learningサイト内本文翻訳待ち:BF1: A Causal Dyadic Sparse-Attention Retrofit for Efficient Long-Context Transformers

翻訳待ち:Nexus: Depth-Adaptive KV-Cache Splicing and Retrieval-Decoupled Tool Routing for Agentic LLMs on Unified Memory

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.20397v1 Announce Type: new Abstract: Agentic large language models (LLMs) on the Model Context Protocol (MCP) re-encode verbose tool schemas every turn, so prefill - quadratic in sequence length - dominates time-to-first-token (TTFT) as the tool registry grows. Nexus's primary lever is to decouple routing from the schema-prefill cost: an INT8 semantic lookaside buffer (SLB) with a calibrated cross-encoder margin gate selects tools by retrieval, and arguments are generated over a compressed textual signature (median 19 tokens) rather than over spliced key/value (KV) cache. This path is depth-independent: routing accuracy stays near 89% as the registry scales to 250 tools - where a concatenate-all-schemas baseline overflows the context wind…

arXiv AIサイト内本文翻訳待ち:Nexus: Depth-Adaptive KV-Cache Splicing and Retrieval-Decoupled Tool Routing for Agentic LLMs on Unified Memory

翻訳待ち:Interpretable Multimodal Classification with Linear Discriminant Tree Ensembles

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.20384v1 Announce Type: new Abstract: Multimodal affect and behaviour classifiers that fuse heterogeneous text, audio, and visual streams must simultaneously achieve competitive accuracy and produce human-understandable explanations of the cues driving their decisions -- a dual objective that current high-capacity models, notably Transformers, only partially address. While Transformers attain strong predictive performance, their distributed representations and deep nonlinearity make it difficult to assign meaningful importance weights to individual multimodal features, limiting their use in trust-sensitive applications such as clinical affect monitoring and educational assessment. We address this gap by developing a framework based on tree…

arXiv AIサイト内本文翻訳待ち:Interpretable Multimodal Classification with Linear Discriminant Tree Ensembles

翻訳待ち:PrimeAgentOrchestrator: Memory-Primed Agent Spawning for Personal AI Infrastructure

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.20342v1 Announce Type: new Abstract: Large language model (LLM) coding agents start each session with an empty context window, discarding accumulated knowledge from prior work. We present PrimeAgentOrchestrator (PAO), a system that spawns new instances of Claude Code -- Anthropic's terminal-based coding agent -- pre-loaded with relevant memories compiled from the user's existing personal databases. At spawn time, PAO queries two independently-operated memory backends in parallel (a PostgreSQL entity-observation database and a Cloudflare Worker semantic search index), fuses results using backend-specific retrieval strategies, and delivers the compiled briefing via filesystem injection that exploits the host agent's configuration auto-read…

arXiv AIサイト内本文翻訳待ち:PrimeAgentOrchestrator: Memory-Primed Agent Spawning for Personal AI Infrastructure

翻訳待ち:SDAD: Spec-Driven Agentic Development for the AI-Native SDLC

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.20341v1 Announce Type: new Abstract: Frontier coding agents backed by large language models with context windows from hundreds of thousands to millions of tokens are restructuring the Software Development Life Cycle (SDLC). Rich context handling and multi-step reasoning now allow substantial Functional Requirement Documents (FRDs) and repository context to be ingested in a single workflow, making specification quality the execution fuel for autonomous delivery. This report formalises Spec-Driven Agentic Development (SDAD) as a synthesis of disciplined up-front formalisation and high-velocity implementation: intent capture, machine-readable specification, agentic synthesis, and independent multi-agent verification under human sign-off. We…

arXiv AIサイト内本文翻訳待ち:SDAD: Spec-Driven Agentic Development for the AI-Native SDLC

翻訳待ち:We burned 11.7B tokens to find the best cyber AI model

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:We burned 11.7bn tokens to find the best cyber AI model GLM5.3 and DeepSeek are now frontier-tier models Debarshi Philippe Dourassov Published on: Aug 21, 2026 We burned 11.7 billion tokens to benchmark the cyber capabi…

Hacker News AIサイト内本文翻訳待ち:We burned 11.7B tokens to find the best cyber AI model

翻訳待ち:PagedAttention vs. RadixAttention: Optimizing LLM KV Cache Management

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Modern LLMs rely on quantization, pruning, distillation, and faster attention kernels, but production performance often depends most on KV cache management. As context windows grow, the cache consumes significant GPU memory, limiting concurrency, throughput, and latency. Two breakthroughs transformed this challenge: PagedAttention improves memory allocation, while RadixAttention enables efficient prefix reuse. Together, these techniques make […] The post PagedAttention vs. RadixAttention: Optimizing LLM KV Cache Management appeared first on Analytics Vidhya.

Analytics Vidhyaサイト内本文翻訳待ち:PagedAttention vs. RadixAttention: Optimizing LLM KV Cache Management

翻訳待ち:Pretraining a Mini Kimi K3

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:Free preview available. Sign in and subscribe to unlock the full book. Vizuara AI Labs · advanced Pretraining a Mini Kimi K3 One H200, five billion tokens, $252.35 — the complete worklog of a Kimi K3 replica trained fro…

Hacker News AIサイト内本文翻訳待ち:Pretraining a Mini Kimi K3

翻訳待ち:Clustering and Token Denoising for Faster and More Robust VLMs

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.19285v1 Announce Type: new Abstract: Recent Visual-Language Models (VLMs) have enhanced the capabilities of pre-trained LLMs by adding vision tokens alongside text, with approaches like LLaVA showing impressive results. However, the computational burden of processing up to 576 or 729 visual tokens makes edge deployment challenging. While various token pruning techniques require retraining, some are training-free and thus can easily adapt to architecture changes. We introduce ClustRS, a two-part, training-free algorithm for robust token pruning. Its first component is an attention-weighted, clustering algorithm that selects representative tokens from each semantic cluster. The second component, Residual Shrinkage, is a one-pass denoising s…

arXiv Computer Visionサイト内本文翻訳待ち:Clustering and Token Denoising for Faster and More Robust VLMs

翻訳待ち:Active Inference as Context Acquisition for AI Agents

AI サービスが一時的に利用できないため、復旧後に翻訳を補完します。ソース概要:arXiv:2608.19202v1 Announce Type: new Abstract: Interactive AI agents must acquire the right context as efficiently as possible. When a user omits a constraint, preference, file, or task variable, an agent can proceed with a default assumption or spend tokens on a clarifying question, retrieval call, tool call, or prompt trial. We formulate this tradeoff as active inference for context acquisition. An inner inference step updates beliefs over a latent task state, and an outer decision selects the next context action, task action, or stop action to minimize expected free energy under cost. In deterministic settings, the epistemic term reduces to expected information gain, optionally normalized by token cost. We instantiate the framework in Optimal Qu…

arXiv AIサイト内本文翻訳待ち:Active Inference as Context Acquisition for AI Agents

その他の成長タグ

モデル価格 AI News | AI News Hub