THE NEXT THING, IN PERSPECTIVEIndependent AI news

The latest AI news, in focus.

Official announcements and industry reporting. Follow the timeline of AI.

Latest news

News feed
AI NEWS × FOXAIFind your next step

From the latest news to tools that work for you.

Explore AI tools

Discover AI tools

Swipe to explore →
ClaudeAI Assistants & Search

Claude 是 Anthropic 推出的 AI 助手,可通过对话协助写作、阅读资料、分析数据和编程,并将部分任务整理为可继续编辑的文档、表格或演示文件。适合希望把想法、资料和初稿衔接起来的个人与团队。

WritingAnalysisCodingFree entry availableView details
GeminiAI Assistants & Search

Gemini 是 Google 的 AI 助手,可通过对话协助写作、规划、整理资料和分析上传文件,也可用 Deep Research 围绕一个主题检索资料并生成研究报告。

Q&AWritingAssistantPricing unverifiedView details
MidjourneyImage Generation & Editing

Midjourney 是从文字和参考图片生成视觉作品的 AI 创作工具。可在网页 Create 页面输入提示,比较生成版本,再使用变体、编辑、放大或图像转视频等功能继续创作。

Image generationText to imageVisual ideasPaidView details
KreaImage Generation & Editing

Krea 是 AI 视觉创作工作空间,可从文字或参考图生成图片,比较不同模型与变体,再进行编辑、细节增强和放大,也提供视频及其他创意工具入口。

Image generationVideo3DPricing unverifiedView details
RunwayVideo & Animation

Runway 是集视频生成、视觉编辑和创作流程于一体的 AI 平台。可从文字、图片或已有片段开始,生成或修改镜头,再进行延长、放大和导出,服务于概念短片、广告及其他视觉制作。

Video generationCreative videoVisual creationFree entry availableView details
SunoMusic & Audio

Suno 是通过文字描述、歌词和参考素材创作歌曲的 AI 音乐平台。用户可生成带人声的歌曲或音乐,再使用编辑、重混与音轨分离等功能继续制作和分享。

Music generationSongsAudioFree entry availableView details
ElevenLabsSpeech & Transcription

ElevenLabs 是提供 AI 语音生成、音频创作和语音智能体的平台。创作者可以制作配音、有声书、播客及本地化内容,开发者则可通过 API 接入语音生成、转录和对话能力。

VoiceoverText to speechVoice agentsFree entry availableView details
Notion AIOffice & Productivity

Notion AI 是集成在 Notion 工作空间中的 AI 助手,用于查找团队知识、生成和编辑页面、处理数据库及整理会议内容。它结合工作空间和已连接应用的上下文,帮助把资料查询、内容整理和后续任务放在同一工作环境中完成。

Knowledge baseDocumentsOfficeFree entry availableView details
GammaOffice & Productivity

Gamma 是用 AI 协助制作演示文稿、文档、网页和视觉内容的产品,可从目标、提纲或已有资料开始生成内容,再通过对话、布局与自由编辑调整成品。

PPTPresentationsDocumentsFree entry availableView details
CursorCoding & Development

Cursor 是围绕软件开发任务工作的 AI 编程产品,可在代码上下文中协助规划、修改、测试和审查代码,并提供桌面、命令行及云端智能体等使用方式。

CodingCodeAI IDEFree entry availableView details

AI, as it happens

643 published stories
研究与论文 · 96 storiesClear filters ×
2026-06-10
Follow the timeline
2026-06-05
Follow the timeline
2026-06-04
Follow the timeline
2026-05-29
Follow the timeline
2026-05-28
Follow the timeline
2026-05-27
Follow the timeline
2026-05-20
Follow the timeline
2026-05-16
Follow the timeline
2026-05-12
Follow the timeline
2026-05-08
Follow the timeline
17:00

Adaptive Parallel Reasoning: The Next Paradigm in Efficient Inference Scaling

Overview of adaptive parallel reasoning. What if a reasoning model could decide for itself when to decompose and parallelize independent subtasks, how many concurrent threads to spawn, and how to coordinate them based on the problem at hand? We provide a detailed analysis of recent progress in the field of parallel reasoning, especially Adaptive Parallel Reasoning. Disclosure: this post is part landscape survey, part perspective on adaptive parallel reasoning. One of the authors (Tony Lian) co-led ThreadWeaver (Lian et al., 2025), one of the methods discussed below. The authors aim to present each approach on its own terms. Motivation Recent progress in LLM reasoning capabilities has been largely driven by inference-time scaling, in addition to data and parameter scaling (OpenAI et al., 20

# 研究Read original Timeline and related coverage
2026-04-20
Follow the timeline
17:00

Gradient-based Planning for World Models at Longer Horizons

GRASP is a new gradient-based planner for learned dynamics (a “world model”) that makes long-horizon planning practical by (1) lifting the trajectory into virtual states so optimization is parallel across time, (2) adding stochasticity directly to the state iterates for exploration, and (3) reshaping gradients so actions get clean signals while we avoid brittle “state-input” gradients through high-dimensional vision models. Large, learned world models are becoming increasingly capable. They can predict long sequences of future observations in high-dimensional visual spaces and generalize across tasks in ways that were difficult to imagine a few years ago. As these models scale, they start to look less like task-specific predictors and more like general-purpose simulators. But having a powe

# 研究Read original Timeline and related coverage
2026-03-13
Follow the timeline
17:00

Identifying Interactions at Scale for LLMs

Understanding the behavior of complex machine learning systems, particularly Large Language Models (LLMs), is a critical challenge in modern artificial intelligence. Interpretability research aims to make the decision-making process more transparent to model builders and impacted humans, a step toward safer and more trustworthy AI. To gain a comprehensive understanding, we can analyze these systems through different lenses: feature attribution, which isolates the specific input features driving a prediction (Lundberg & Lee, 2017; Ribeiro et al., 2022); data attribution, which links model behaviors to influential training examples (Koh & Liang, 2017; Ilyas et al., 2022); and mechanistic interpretability, which dissects the functions of internal components (Conmy et al., 2023; Sharkey et al.

# 研究Read original Timeline and related coverage
2026-01-10
Follow the timeline
17:00

Information-Driven Design of Imaging Systems

An encoder (optical system) maps objects to noiseless images, which noise corrupts into measurements. Our information estimator uses only these noisy measurements and a noise model to quantify how well measurements distinguish objects. Many imaging systems produce measurements that humans never see or cannot interpret directly. Your smartphone processes raw sensor data through algorithms before producing the final photo. MRI scanners collect frequency-space measurements that require reconstruction before doctors can view them. Self-driving cars process camera and LiDAR data directly with neural networks. What matters in these systems is not how measurements look, but how much useful information they contain. AI can extract this information even when it is encoded in ways that humans cannot

# 研究Read original Timeline and related coverage
2025-11-01
Follow the timeline
17:00

RL without TD learning

In this post, I’ll introduce a reinforcement learning (RL) algorithm based on an “alternative” paradigm: divide and conquer. Unlike traditional methods, this algorithm is not based on temporal difference (TD) learning (which has scalability challenges), and scales well to long-horizon tasks. We can do Reinforcement Learning (RL) based on divide and conquer, instead of temporal difference (TD) learning. Problem setting: off-policy RL Our problem setting is off-policy RL. Let’s briefly review what this means. There are two classes of algorithms in RL: on-policy RL and off-policy RL. On-policy RL means we can only use fresh data collected by the current policy. In other words, we have to throw away old data each time we update the policy. Algorithms like PPO and GRPO (and policy gradient meth

# 研究Read original Timeline and related coverage
2025-09-01
Follow the timeline
17:00

What exactly does word2vec learn?

What exactly does word2vec learn, and how? Answering this question amounts to understanding representation learning in a minimal yet interesting language modeling task. Despite the fact that word2vec is a well-known precursor to modern language models, for many years, researchers lacked a quantitative and predictive theory describing its learning process. In our new paper, we finally provide such a theory. We prove that there are realistic, practical regimes in which the learning problem reduces to unweighted least-squares matrix factorization. We solve the gradient flow dynamics in closed form; the final learned representations are simply given by PCA. Learning dynamics of word2vec. When trained from small initialization, word2vec learns in discrete, sequential steps. Left: rank-increment

# 研究Read original Timeline and related coverage
Every update links back to its source.
STAY CURIOUS. STAY INFORMED.

Stay informed about the changes that matter.

Give your curiosity direction. Make every day of reading count.

Subscribe via RSS