Industry
How to Watch the Knicks Parade on NYC Traffic Surveillance Cameras
Artist Morry Kolman will be livestreaming feeds of the NBA champions' ticker-tape parade from NYC's traffic cameras--and this time, the city's Department of Transportation isn't demanding he stop. For the first time in 53 years, New York Knicks fans will be celebrating the team's NBA championship win with a parade through lower Manhattan. Many New Yorkers will be showing up to party in person on Thursday morning, but not everyone will be able to make it to the event. For those who are celebrating from afar (or begrudgingly stuck at the office while the procession takes place), artist Morry Kolman has an option for you: watching via several traffic cameras along the parade route and surrounding City Hall, where the parade will end. Kolman is livestreaming the camera feeds as part of his project, GardenCam, which has been streaming and archiving traffic camera footage of street revelers throughout the Knicks' historic finals run against the San Antonio Spurs.
Will robot lawn mowers replace mowing? Experts say that's the wrong question
PCWorld's testing of the Luba 3 AWD robot lawn mower reveals advanced navigation capabilities and effective autonomous cutting, though occasional mapping errors require manual correction. High prices like the Segway Navimow X350 at $3,499, plus many homeowners' emotional connection to manual mowing as routine and identity, hinder widespread adoption. The real question isn't whether robot mowers can replace traditional mowing, but whether people want to give up this personal lawn care ritual. Robot lawn mowers are here, and they work. Having just finished testing Mammotion's Luba 3 AWD robot lawn mower, I've got a whole new perspective on the category.
Efficient Multi-bit Quantization Network Training via Weight Bias Correction and Bit-wise Coreset Sampling
Multi-bit quantization networks enable flexible deployment of deep neural networks by supporting multiple precision levels within a single model. However, existing approaches suffer from significant training overhead as full-dataset updates are repeated for each supported bit-width, resulting in a cost that scales linearly with the number of precisions. Additionally, extra fine-tuning stages are often required to support additional or intermediate precision options, further compounding the overall training burden. To address this issue, we propose two techniques that greatly reduce the training overhead without compromising model utility: (i) Weight bias correction enables shared batch normalization and eliminates the need for fine-tuning by neutralizing quantization-induced bias across bit-widths and aligning activation distributions; and (ii) Bit-wise coreset sampling strategy allows each child model to train on a compact, informative subset selected via gradient-based importance scores by exploiting the implicit knowledge transfer phenomenon. Experiments on CIFAR-10/100, TinyImageNet, and ImageNet-1K with both ResNet and ViT architectures demonstrate that our method achieves competitive or superior accuracy while reducing training time up to 7.88 . Our code is released at this link.
NorLow mlearaliznied ng scCapacoreity neuron ratio
Deep reinforcement learning (RL) agents frequently suffer from neuronal activity loss, which impairs their ability to adapt to new data and learn continually. A common method to quantify and address this issue is the ฯ-dormant neuron ratio, which uses activation statistics to measure the expressive ability of neurons. While effective for simple MLP-based agents, this approach loses statistical power in more complex architectures. To address this, we argue that in advanced RL agents, maintaining a neuron's learning capacity, its ability to adapt via gradient updates, is more critical than preserving its expressive ability. Based on this insight, we shift the statistical objective from activations to gradients, and introduce GraMa (Gradient Magnitude Neural Activity Metric), a lightweight, architecture-agnostic metric for quantifying neuron-level learning capacity. We show that GraMaeffectively reveals persistent neuron inactivity across diverse architectures, including residual networks, diffusion models, and agents with varied activation functions. Moreover, resetting neurons guided by GraMa (ReGraMa) consistently improves learning performance across multiple deep RL algorithms and benchmarks, such as MuJoCo and the DeepMind Control Suite. We make our code available2.
Advanced Sign Language Video Generation with Compressed and Quantized Multi Condition
Sign Language Video Generation (SLVG) seeks to generate identity-preserving sign language videos from spoken language texts. Existing methods primarily rely on the single coarse condition (e.g., skeleton sequences) as the intermediary to bridge the translation model and the video generation model, which limits both the naturalness and expressiveness of the generated videos. To overcome these limitations, we propose SignViP, a novel SLVG framework that incorporates multiple fine-grained conditions for improved generation fidelity. Rather than directly translating error-prone high-dimensional conditions, SignViP adopts a discrete tokenization paradigm to integrate and represent fine-grained conditions (i.e., fine-grained poses and 3D hands). SignViP contains three core components.
721dbcfed36ef373f19a03e3e3130729-Paper-Conference.pdf
Federated Continual Learning (FCL) aims to enable sequential privacy-preserving model training on streams of incoming data that vary in edge devices by preserving previous knowledge while adapting to new data. Current FCL literature focuses on restricted data privacy and access to previously seen data while imposing no constraints on the training overhead. This is unreasonable for FCL applications in real-world scenarios, where edge devices are primarily constrained by resources such as storage, computational budget, and label rate. We revisit this problem with a large-scale benchmark and analyze the performance of state-of-the-art FCL approaches under different resource-constrained settings. Various typical FCL techniques and six datasets in two incremental learning scenarios (Class-IL and Domain-IL) are involved in our experiments. Through extensive experiments amounting to a total of over 1,000+ GPU hours, we find that, under limited resource-constrained settings, existing FCL approaches, with no exception, fail to achieve the expected performance. Our conclusions are consistent in the sensitivity analysis. This suggests that most existing FCL methods are particularly too resource-dependent for real-world deployment. Moreover, we study the performance of typical FCL techniques with resource constraints and shed light on future research directions in FCL.
Revealed: The popular UK pet foods that contain the most microplastics - so, is your dog or cat at risk?
Every emotional moment from the Gilgo Beach killer's sentencing: Rex Heuermann's shocking first words... and the chilling exchange that silenced the room Don Trump Jr. says Ted Cruz is'lying through his teeth' as GOP infighting over Iran deal continues to spiral LIZ JONES: The cracks in Harry and Meghan's perfect facade have started to show. It's so obvious he's tiring of her tone-deaf approach... and I predict there's serious trouble in store All my friends are suddenly getting divorced. Mid-life wives share taboo sex confessions about why they really leave... including common position that made one hate her husband: JANA HOCKING Trump says'fools who think I haven't been tough enough on Iran' are'jealous or stupid' after signing widely-criticised deal that includes giving Tehran $300billion Taylor Swift's bottomless thirst for attention, her greed and sheer tackiness are now truly unbearable... this latest stunt has shown her true colors: MAUREEN CALLAHAN The Ring star Daveigh Chase's friends searched for her on LA's Skid Row in months before her shock death at 35 Horrific new videos blow Texas woman's mystery death wide open: Her agonizing'final gasp'... unthinkably vile corpse claims... and sick past of man who saw her last'I can still see you': Princess of Wales shares adorable moment with shy little girl at Royal Ascot Brooklyn Beckham is savaged by fans for yet another'classless' swipe at his estranged family as new DoorDash ad is branded a'giant PR mess' Sensational REAL reason Jelly Roll is divorcing Bunnie XO: Insiders reveal'preacher's wife' bombshell that's the talk of Nashville... truth about legendary rocker cuckolding rumor... and G-string mishap Watch horrifying drone video that follows woman's plunge to death after bungee team threw her from bridge without rope Kylie Jenner and Timothee Chalamet put on VERY affectionate display during NYC bike ride... as it's revealed how the relationship has'changed' the actor Luxury fashion tycoon beloved by the stars hangs her head in shame as she's indicted for allegedly exploiting her workers and stealing $50k from their wages NBA star's fiancee breaks her silence after friend, 26, mysteriously dropped dead at her luxury bachelorette party in St Barts Tragedy as 8-year-old dies during World Cup watch party with cops blaming'accidental drowning' Instead, I lost a stone and dropped a dress size in one MONTH with a meal plan that's not even a diet. It's packed with carbs and so simple - anyone can do it in time for summer Revealed: The popular UK pet foods that contain the most microplastics - so, is your dog or cat at risk? The popular UK pet foods that contain the most microplastics have been revealed in a new study.
Value-Guided KVCompression for LLMs via Approximated CURDecomposition
Key-value (KV) cache compression has emerged as a critical technique for reducing the memory and latency overhead of autoregressive language models during inference. Prior approaches predominantly rely on query-key attention scores to rank and evict cached tokens, assuming that attention intensity correlates with semantic importance. However, this heuristic overlooks the contribution of value vectors, which directly influence the attention output. In this paper, we propose CurDKV, a novel, value-centric KV compression method that selects keys and values based on leverage scores computed from CUR matrix decomposition. Our approach approximates the dominant subspace of the attention output softmax(QK)V, ensuring that the retained tokens best preserve the model's predictive behavior. Theoretically, we show that attention score approximation does not guarantee output preservation, and demonstrate that CUR-based selection minimizes end-to-end attention reconstruction loss.
SpaceServe: Spatial Multiplexing of Complementary Encoders and Decoders for Multimodal LLMs
Recent multimodal large language models (MLLMs) marry modality-specific vision or audio encoders with a shared text decoder. While the encoder is computeintensive but memory-light, the decoder is the opposite, yet state-of-the-art serving stacks still time-multiplex these complementary kernels, idling SMs or HBM in turn. We introduce SpaceServe, a serving system that space-multiplexes MLLMs: it decouples all modality encoders from the decoder, and co-locates them on the same GPU using fine-grained SM partitioning available in modern runtimes. A cost-model-guided Space-Inference Scheduler (SIS) dynamically assigns SM slices, while a Time-Windowed Shortest-Remaining-First (TWSRFT) policy batches encoder requests to minimise completion latency and smooth decoder arrivals. Evaluation shows that SpaceServe reduces time-per-output-token by 4.81 on average and up to 28.9 on Nvidia A100 GPUs.
ASustainable AIEconomy Needs Data Deals That Work for Generators
We argue that the machine learning value chain is structurally unsustainable due to an economic data processing inequality: each state in the data cycle from inputs to model weights to synthetic outputs refines technical signal but strips economic equity from data generators. We show, by analyzing seventy-three public data deals, that the majority of value accrues to aggregators, with documented creator royalties rounding to zero and widespread opacity of deal terms. This is not just an economic welfare concern: as data and its derivatives become economic assets, the feedback loop that sustains current learning algorithms is at risk. We identify three structural faults--missing provenance, asymmetric bargaining power, and nondynamic pricing--as the operational machinery of this inequality. In our analysis, we trace these problems along the machine learning value chain and propose an Equitable Data-Value Exchange (EDVEX) Framework to enable a minimal market that benefits all participants. Finally, we outline research directions where our community can make concrete contributions to data deals and contextualize our position with related and orthogonal viewpoints.