ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “Sentence Transformers”

48 stories

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllMalware 7Policy & legal 6Data breach 6Ransomware 4AI research 4Phishing & fraud 4Threat actor 3Exploit / PoC 2AI policy 2Research 2AI tools & infra 2AI safety & security 2Vulnerability 1Model release 1
SeverityAllcritical 13high 8medium 8low 9info 10

Multi-Vector (Late Interaction) Embedding Models with Sentence Transformers

Hugging Face details building and using multi-vector late-interaction embedding models with Sentence Transformers for retrieval workloads.

Hugging Face published a guide on multi-vector, late-interaction embedding models (ColBERT-style) supported through Sentence Transformers. The post covers how practitioners can build and use these models for retrieval and RAG pipelines. It is a developer tooling and technique write-up, not a security advisory.

Hugging Face Blog · 29d agoAI tools & infra1

Training and Finetuning Multi-Vector Embedding Models with Sentence Transformers

Hugging Face published a tutorial on training and finetuning multi-vector embedding models using the Sentence Transformers library.

Hugging Face's blog walks through training and finetuning multi-vector embedding models with Sentence Transformers. Multi-vector approaches store multiple vectors per document to support late-interaction retrieval. The post is a practical guide for developers building retrieval pipelines with the library.

Hugging Face Blog · 21d agoAI tools & infra1

ukisai/Swift-Qwen3.8-27b — new model trending #30 on Hugging Face

UkisAI releases Swift-Qwen3.8-27B, a Qwen3.8-27B derivative using 58.3% fewer thinking tokens with <1% performance loss and ~1.95x speed-up.

UkisAI released Swift-Qwen3.8-27B, a reasoning-efficient derivative of Qwen3.8-27B that cuts thinking-token usage by 58.3% while staying within 1% of base performance, yielding a 1.95x speed-up on several tasks. The model was fine-tuned by penalizing reasoning-marker tokens that trigger overthinking, plus a transfer component from BottleCap AI's ThinkingCap-Qwen3.6-27B. Benchmarks include GPQA-Diamond 88.28% (base 88.38%), MMLU-Pro 84.95% (base 85.47%), and AIME 2026 94.00% (base 98.67%), with mean-token reductions of roughly 27-46% across tests. GGUF weights are available on Hugging Face alongside enterprise licensing options.

Hugging Face trending models · 7d agoModel release

I wrote an AI textbook — how long until AI can do it better?

AI researcher Nathan Lambert argues LLMs remain weak at long-form technical writing, questioning whether models can autonomously organize scientific knowledge for breakthroughs.

Nathan Lambert describes writing a post-training textbook, Reinforcement Learning from Human Feedback, and finds today's LLMs weak at organizing long-form technical content despite becoming superhuman at coding and math. He notes GPT 5.5 Pro found deep typos across a 200-300 page manuscript while Claude models proved more useful as editors. He argues that compressing knowledge through writing is a prerequisite for autonomous scientific insight and tempers expectations for near-term AI-driven open science.

Interconnects · Aug 12, 2026AI research

IndicTriMix: Developing Language Identification Datasets and Models for Tri-Language Code-Mixing

Researchers release IndicTriMix benchmarks and fine-tuned MuRIL and XLM-RoBERTa models for token-level language identification in tri-language code-mixed text.

The paper formulates token-level language identification in code-mixed text as a sequence labeling task and fine-tunes MuRIL and XLM-RoBERTa transformer models for Indian languages. It evaluates on Hindi, Gujarati, and Bengali configurations with manually annotated test sets and proposes two code-mixed generation approaches using parallel trilingual sentences. A public benchmark, annotated test sets, and fine-tuned models are released for reproducibility.

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

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 · 1d agoAI researchHN 22↑ · 19 comments

Microsoft says virtually nobody was grabbing NYT articles through its chatbot

Microsoft files summary judgement briefs in NYT copyright lawsuit, arguing only 59,545 of 8.2M Copilot logs show substantial overlap with news content.

Microsoft filed new legal filings in the consolidated copyright lawsuit brought by The New York Times, authors, and publishers against Microsoft and OpenAI, arguing for summary judgement. Analysis of 8.2 million Copilot chat logs found only 59,545 contained at least 16 words in common with news content, with just 24 responses showing at least 30 matching words in the authors' case. Microsoft argues the numbers support fair use, claiming Copilot rarely reproduces substantive chunks; the Times says discovery shows Microsoft and OpenAI stole from it, and the Trump administration filed a statement of interest supporting OpenAI.

The Verge · AI · 11d agoAI policy1

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 · 1d agoAI researchHN 21↑ · 3 comments