Jump to content

Google llc (20250069382). Machine Learning Models Featuring Resolution-Flexible Multi-Axis Attention Blocks

From WikiPatents
Revision as of 08:12, 17 March 2025 by Unknown user (talk) (Creating a new page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Machine Learning Models Featuring Resolution-Flexible Multi-Axis Attention Blocks

Organization Name

google llc

Inventor(s)

Yinxiao Li of Sunnyvale CA (US)

Zhengzhong Tu of Austin TX (US)

Hossein Talebi of San Jose CA (US)

Han Zhang of Sunnyvale CA (US)

Feng Yang of Sunnyvale CA (US)

Peyman Milanfar of Menlo Park CA (US)

Machine Learning Models Featuring Resolution-Flexible Multi-Axis Attention Blocks

This abstract first appeared for US patent application 20250069382 titled 'Machine Learning Models Featuring Resolution-Flexible Multi-Axis Attention Blocks

Original Abstract Submitted

provided are machine learning systems and models featuring resolution-flexible multi-axis attention blocks. in particular, the present disclosure provides example multi-axis mlp based architectures (example implementations of which can be generally referred to as maxim) that can serve as an efficient and flexible general-purpose vision backbone for image processing tasks. in some implementations, maxim can use a unet-shaped hierarchical structure and supports long-range interactions enabled by spatially-gated mlps. specifically, some example implementations of maxim can contain two mlp-based building blocks: a multi-axis gated mlp that allows for efficient and scalable spatial mixing of local and global visual cues, and a cross-gating block, an alternative to cross-attention, which accounts for cross-feature mutual conditioning.

(Ad) Transform your business with AI in minutes, not months

Custom AI strategy tailored to your specific industry needs
Step-by-step implementation with measurable ROI
5-minute setup that requires zero technical skills
Get your AI playbook

Trusted by 1,000+ companies worldwide

Cookies help us deliver our services. By using our services, you agree to our use of cookies.