Tech Meridian
LIVE FEED
PROMY MERIDIAN FEATURES MODELS ENTITIES
EN RU

AI INDUSTRY INTELLIGENCE

WHAT MATTERS.
AS IT HAPPENS.

One event, every source. Classified, ranked and summarized in real time.

MY MERIDIAN · PLANS

MAKE THE FEED YOURS.

The public feed stays open. An account adds personalization; Pro adds working lists and a daily brief.

FREE

$0
  • Personal feed and saved stories
  • Up to 20 companies, models and topics
  • Weekly Meridian Brief by email
CREATE ACCOUNT →

PRO

$7/MONTH

$70 yearly · save two months

  • A ranked 24-hour brief across your interests
  • 5 named lists with source and importance filters
  • Mute companies and topics across your feed, brief and daily email
  • Share a collection by link when you choose to publish it
  • Up to 200 interests and a daily email brief
  • Billing portal and downloadable invoices
EXPLORE PRO →
ARCHIVE DATE
1354 RESULTS · PAGE 46 OF 46
RESEARCH1 SOURCE · Google Research

Google Research proposes 'early readouts' and a 'feature sieve' to mitigate spurious features and simplicity bias

Google Research authors Rishabh Tiwari and Pradeep Shenoy describe two interventions—using predictions from early intermediate layers ('early readouts') and inducing 'feature forgetting' via a 'feature sieve'—to detect and reduce reliance on spurious features and the simplicity bias in deep networks. They apply the early-readout signal to reweight teacher contributions during distillation and use a feature-sieving intervention to encourage models to find more predictive features, reporting improved worst-group accuracy across benchmarks (Waterbirds, CelebA, CivilComments, MNLI) and better generalization to unseen domains compared with prior methods.

Why it matters: This matters because the methods offer automated diagnostics and practical interventions to reduce spurious-feature reliance and simplicity bias, improving worst‑group robustness and cross‑domain generalization in common benchmark tasks.

OPEN EVENT →
7.0IMPORTANCE
MODELS1 SOURCE · Google Research

MobileDiffusion: subsecond on-device text-to-image generation with a 520M-parameter latent diffusion model

MobileDiffusion is an efficient latent text-to-image diffusion model designed for mobile devices that combines a compact CLIP-ViT/L14 text encoder with a streamlined diffusion UNet and image decoder. By adopting DiffusionGAN for one-step sampling and focusing on architectural efficiency, the 520M-parameter model can produce a 512×512 image in about half a second on tested premium iOS and Android devices.

Why it matters: Faster, smaller on-device text-to-image models enable real-time mobile user experiences and improved privacy by avoiding server-side inference, making deployment of high-quality generative models on phones more feasible.

OPEN EVENT →
8.0IMPORTANCE
RESEARCH1 SOURCE · Google Research

Google Research outlines software optimizations for mixed-input matmul on NVIDIA Ampere (CUTLASS)

A Google Research blog post by Manish Gupta presents software techniques to implement mixed-input matrix multiplication (e.g., F16 inputs × U8 weights) on NVIDIA Ampere Tensor Cores by handling data-type conversion and layout conformance; the methods are released in the open-source NVIDIA/CUTLASS repository and are reported to add minimal software overhead while approaching hardware peak performance. The work targets memory- and compute-heavy LLM workloads by enabling weight-only quantization patterns that reduce model memory footprint.

Why it matters: Efficient software mapping of mixed-input matmul enables reduced-memory 8-bit weight formats for large LLMs on existing GPU hardware, improving deployment efficiency without hardware changes.

OPEN EVENT →
7.0IMPORTANCE
MODELS1 SOURCE · Google Research

Exphormer: using expander graphs to scale graph transformers

Exphormer is a sparse-attention framework for graph transformers proposed by Google Research (presented at ICML 2023) that replaces the dense full-attention interaction graph with a sparse d-regular expander graph (using a randomized Friedman near-Ramanujan construction). The approach combines expander edges with the input graph and virtual nodes to achieve linear edges and reports strong empirical results across diverse graph datasets; an implementation is available on GitHub.

Why it matters: Reducing the quadratic cost of full attention on graphs by using expander-based sparse interaction graphs makes transformer architectures practical for much larger graph-structured datasets.

OPEN EVENT →
7.0IMPORTANCE
EVENT
LOADING EVENT