Technology
OmniVCus: Feedforward Subject-driven Video Customization with Multimodal Control Conditions
Existing feedforward subject-driven video customization methods mainly study single-subject scenarios due to the difficulty of constructing multi-subject training data pairs. Another challenging problem that how to use the signals such as depth, mask, camera, and text prompts to control and edit the subject in the customized video is still less explored. In this paper, we first propose a data construction pipeline, VideoCus-Factory, to produce training data pairs for multi-subject customization from raw videos without labels and control signals such as depth-to-video and mask-to-video pairs. Based on our constructed data, we develop an Image-Video Transfer Mixed (IVTM) training with image editing data to enable instructive editing for the subject in the customized video. Then we propose a diffusion Transformer framework, OmniVCus, with two embedding mechanisms, Lottery Embedding (LE) and Temporally Aligned Embedding (TAE). LE enables inference with more subjects by using the training subjects to activate more frame embeddings. TAE encourages the generation process to extract guidance from temporally aligned control signals by assigning the same frame embeddings to the control and noise tokens. Experiments demonstrate that our method significantly surpasses state-of-the-art methods in both quantitative and qualitative evaluations.
2026 NBA Finals: New York Knicks at San Antonio Spurs Game 5 best bets for side, total and player props
Pat McAfee wages war on Omaha's famous Jell-o shot bar after crew gets cold reception at College World Series NASCAR legend Tony Stewart calls mourning fans'a--holes' in tone-deaf rant about Kyle Busch Brewers' Jacob Misiorowski breaks brains and radar guns with hardest pitch ever by a starting pitcher US fans were out in full force ahead of the USMNT's first match of the 2026 FIFA World Cup MLB announces drive-in theater screenings of'The Sandlot' with live games and fireworks for July 4th California Democratic Party under fire for'you're not allowed to watch' World Cup post Victor Wembanyama isn't good or mature enough to be the face of the NBA -- at least not yet Rep. Byron Donalds shares his faith redemption story amid Florida gubernatorial run Iran's foreign minister says peace with US'has never been closer' GOP lawmaker says it's'really important' that US continues cartel crackdown Spencer Pratt's use of AI to boost campaign sparks debate FBI arrests first suspect on'most wanted fraudsters' list Accused Charlie Kirk killer's attorneys seek to BLOCK death penalty Kayleigh McEnany: Capitalism isn't the big evil Bernie Sanders would have you believe Stephen A. Smith says he takes no offense to President Donald Trump's social media criticism, but stands by blaming him for the Knicks' Game 3 loss in the NBA Finals on'Hannity.' Can the San Antonio Spurs bounce back from blowing the biggest lead in NBA Finals history and keep their season alive by beating the New York Knicks in Game 5 Saturday? According to San Antonio phenom Victor Wembanyama: Everybody thinks -- everybody knows -- we're going to do it. Well, Mr. Wembanyama, the Spurs would become just the 16th team in NBA history to win a series after going down 3-1. New York is on the brink of winning its first NBA title in 53 years, thanks to a full team effort.
Surprise3D: A Dataset for Spatial Understanding and Reasoning in Complex 3D Scenes
The integration of language and 3D perception is critical for embodied AI and robotic systems to perceive, understand, and interact with the physical world. Spatial reasoning, a key capability for understanding spatial relationships between objects, remains underexplored in current 3D vision-language research. Existing datasets often mix semantic cues (e.g., object name) with spatial context, leading models to rely on superficial shortcuts rather than genuinely interpreting spatial relationships. To address this gap, we introduce Surprise3D, a novel dataset designed to evaluate language-guided spatial reasoning segmentation in complex 3D scenes. Surprise3D consists of more than 200k vision language pairs across 900+ detailed indoor scenes from ScanNet++ v2, including more than 2.8k unique object classes. The dataset contains 89k+ human-annotated spatial queries deliberately crafted without object name, thereby mitigating shortcut biases in spatial understanding. These queries comprehensively cover various spatial reasoning skills, such as relative position, narrative perspective, parametric perspective, and absolute distance reasoning. Initial benchmarks demonstrate significant challenges for current state-of-the-art expert 3D visual grounding methods and 3D-LLMs, underscoring the necessity of our dataset and the accompanying 3D Spatial Reasoning Segmentation (3D-SRS) benchmark suite. Surprise3D and 3D-SRS aim to facilitate advancements in spatially aware AI, paving the way for effective embodied interaction and robotic planning.
Low-degree evidence for computational transition of recovery rate in stochastic block model
We investigate implications of the (extended) low-degree conjecture (recently formalized in [moitra et al2023]) in the context of the symmetric stochastic block model. Assuming the conjecture holds, we establish that no polynomial-time algorithm can weakly recover community labels below the Kesten-Stigum (KS) threshold. In particular, we rule out polynomial-time estimators that, with constant probability, achieve $n^{-0.49}$
A Latent Multilayer Graphical Model For Complex, Interdependent Systems
Networks have been extensively used and have provided novel insights across a wide variety of research areas. However, many real-world systems are, in fact, a ``network of networks'', or a multilayer network, which interact as components of a larger multimodal system. A major difficulty in this multilayer framework is the estimation of interlayer edges or connections. In this work, we propose a new estimation method, called multilayer sparse + low-rank inverse covariance estimation (multiSLICE), which estimates the interlayer edges.
Skrull: Towards Efficient Long Context Fine-tuning through Dynamic Data Scheduling
Long-context supervised fine-tuning (Long-SFT) plays a vital role in enhancing the performance of large language models (LLMs) on long-context tasks. To smoothly adapt LLMs to long-context scenarios, this process typically entails training on mixed datasets containing both long and short sequences. However, this heterogeneous sequence length distribution poses significant challenges for existing training systems, as they fail to simultaneously achieve high training efficiency for both long and short sequences, resulting in sub-optimal end-to-end system performance in Long-SFT. In this paper, we present a novel perspective on data scheduling to address the challenges posed by the heterogeneous data distributions in Long-SFT. We propose Skrull, a dynamic data scheduler specifically designed for efficient long-SFT.
SimSort: A Data-Driven Framework for Spike Sorting by Large-Scale Electrophysiology Simulation
Spike sorting is an essential process in neural recording, which identifies and separates electrical signals from individual neurons recorded by electrodes in the brain, enabling researchers to study how specific neurons communicate and process information. Although there exist a number of spike sorting methods which have contributed to significant neuroscientific breakthroughs, many are heuristically designed, making it challenging to verify their correctness due to the difficulty of obtaining ground truth labels from real-world neural recordings. In this work, we explore a data-driven, deep learning-based approach. We begin by creating a large-scale dataset through electrophysiology simulations using biologically realistic computational models.
Pat McAfee wages war on Omaha's famous Jell-o shot bar after crew gets cold reception at College World Series
NASCAR legend Tony Stewart calls mourning fans'a--holes' in tone-deaf rant about Kyle Busch Brewers' Jacob Misiorowski breaks brains and radar guns with hardest pitch ever by a starting pitcher US fans were out in full force ahead of the USMNT's first match of the 2026 FIFA World Cup MLB announces drive-in theater screenings of'The Sandlot' with live games and fireworks for July 4th California Democratic Party under fire for'you're not allowed to watch' World Cup post Victor Wembanyama isn't good or mature enough to be the face of the NBA -- at least not yet Rep. Byron Donalds shares his faith redemption story amid Florida gubernatorial run Iran's foreign minister says peace with US'has never been closer' GOP lawmaker says it's'really important' that US continues cartel crackdown Spencer Pratt's use of AI to boost campaign sparks debate FBI arrests first suspect on'most wanted fraudsters' list Accused Charlie Kirk killer's attorneys seek to BLOCK death penalty Kayleigh McEnany: Capitalism isn't the big evil Bernie Sanders would have you believe OutKick Sports Pat McAfee wages war on Omaha's famous Jell-o shot bar after crew gets cold reception at College World Series McAfee says the general manager was unhappy he didn't call ahead and mocked his ability to pay for shots Dan Dakich asks how ESPN's relevance has changed since adding Pat McAfee. We've got drama at the College World Series, and it has nothing to do with baseball. Pat McAfee has waged war with Rocco's -- the famous Omaha-based bar known for its Jell-O shot challenge during the 12-day tournament. And by war, I mean McAfee stuffed the GM in a locker during a heated segment on his ESPN and YouTube show Friday afternoon. It was nowhere near what I thought it was going to be like, McAfee said of the crew's experience at the bar earlier this week.
Optimal Regret of Bandits under Differential Privacy
As sequential learning algorithms are increasingly applied to real life, ensuring data privacy while maintaining their utilities emerges as a timely question. In this context, regret minimisation in stochastic bandits under $\epsilon$-global Differential Privacy (DP) has been widely studied. The present literature poses a significant gap between the best-known regret lower and upper bound in this setting, though they ``match in order''. Thus, we revisit the regret lower and upper bounds of $\epsilon$-global DP bandits and improve both. First, we prove a tighter regret lower bound involving a novel information-theoretic quantity characterising the hardness of $\epsilon$-global DP in stochastic bandits.