
Apple · Machine Learning Research
| 热搜话题 | 最高排名 | 首次上榜 | 离榜时间 | 在榜时长 | 上榜次数 |
|---|---|---|---|---|---|
01 Theoretical Limits of Language Model Alignment Language model (LM) alignment improves model outputs to reflect human preferences while preserving the capabilities of the base model. The most common alignment approaches are (i) reinforcement learning, which maximizes the expected reward under a KL-divergence constraint, and (ii) best-of-NNN alignment, which selects the highest-reward output among NNN independent samples. Despite their widespread use, the fundamental limits of reward improvement under a KL budget remain poorly understood. We c | #100:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
02 Evaluating the Evaluators: Investigating LLM Judges for Personalized Writing Style Assessment This paper was accepted at the Can We Trust AI Evaluation? Workshop at NeurIPS 2026. We evaluate how good large language model (LLM) judges are for personalized writing tasks. This is important when a user’s preferred writing style is known (e.g., “upbeat”) and an LLM judge is used to evaluate whether generated text adheres to this preference. We examine how the writing task, the combination of generator and judge LLM, the evaluation objective, and general commonsense and reasoning ability impac | #200:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
03 On the Importance of Gating: Memorization vs. In-Context Learning in State Space Models State Space Models (SSMs) have emerged as a compelling alternative to Transformers, enabling sequence modeling with constant memory and linear compute. Although SSMs exhibit reasonable performance and favorable computational characteristics, they continue to lag behind Transformers on tasks that require in-context learning and precise retrieval, slowing their adoption for large-scale language modeling. In this work, we demonstrate that both the success and failure of SSMs in these domains can be | #300:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
04 Weighted State Souping for Efficient Long-Context Retrieval This paper was accepted at the Workshop on Personalized, Aligned, Long-term Memory for AI Systems (PALM) at NeurIPS 2026. State space models (SSMs) combine fast inference and fixed state size with competitive language-modeling performance. Recently, state souping has been proposed as a procedure whereby an SSM independently encodes chunks of tokens like documents, tool definitions, or memory records. The resulting state encodings may be cached and recombined to cheaply construct a context for do | #400:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
05 Faster Retrieval for Better, More Efficient RAG Maximum inner product search (MIPS) sits at the core of recommendation systems, search, and retrieval-augmented generation (RAG). Given a query vector, MIPS systems search within a database of millions of candidate key vectors for the one that best matches the query. The original data point associated with that best-matching key is then used to handle the query: in RAG, the document that is best suited to answer the question is typically prefixed to the query. As the number of keys grows to mill | #500:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
06 Attention to Mamba: A Recipe for Cross-Architecture Distillation State Space Models (SSMs) such as Mamba have become a popular alternative to Transformer models, due to their reduced memory consumption and higher throughput at generation compared to their Attention-based counterparts. On the other hand, the community has built up a considerable body of knowledge on how to train Transformers, and many pretrained Transformer models are readily available. To facilitate the adoption of SSMs while leveraging existing pretrained Transformers, we aim to identify an | #600:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
07 GHARP: Real-Time Gaussian Head Animation from Large-Scale Reconstruction Prior We present GHARP (Real-time Gaussian Head Animation from Large-scale Reconstruction Prior), a method that animates 3D human heads in real time from a few input images of a subject and a driving expression signal. We decouple the problem into an identity stage that builds a representation of the subject’s geometry and appearance offline, and an animation stage that predicts expression-dependent residuals on top of it at runtime. This separation offers a favorable trade-off with respect to fidelit | #700:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
08 Pixels to Tokens: Token Space Efficient Active Learning for Low-Budget Semantic Segmentation While foundation models and vision transformers (ViTs) have redefined visual representations, current active learning (AL) strategies for these backbones largely operate at the patch or region level, where annotation requirements remain high due to extensive pixel labeling. Extending ViT-based AL to the pixel-level, low-budget regime is uniquely challenging: with as little as one pixel query per image, a method must simultaneously identify the most informative locations and train a reliable deco | #800:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
09 Local and Distributed Large LLM Inference with MLX and RDMA on Mac Studio MLX on Mac with Apple silicon lets AI researchers and developers experiment locally with the latest models and methods in a private environment. The open-source array framework leverages the unified memory architecture of Apple silicon, enabling anyone to run new inference and fine-tuning methods on their own hardware and explore other AI techniques. In a previous post , we highlighted the advantages of the M5 architecture and its GPU Neural Accelerators. | #900:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
10 Selection-Based Structured Reasoning: Toward Efficient Multimodal Search Agents Multimodal agents commonly generate freeform reasoning before each action. For small models, limited model capacity can result in lengthy reasoning that provides little useful guidance for action generation while incurring substantial inference cost. To address this challenge, we introduce Selection-based Structured Reasoning (SSR), a framework that reformulates reasoning as selection instead of open-ended generation. SSR represents recurring high-level reasoning as pre-specified, reusable natur | #1000:00 达到 | 00:00首次采集时已在榜 | —结束时仍在榜 | 4小时48分累计在榜 | 1无重入 |
































































































