モデル情報

yoso-4096

uw-madison · yoso-4096

The YOSO model was proposed in You Only Sample (Almost) Once: Linear Cost Self-Attention Via Bernoulli Sampling by Zhanpeng Zeng, Yunyang Xiong, Sathya N. Ravi, Shailesh Acharya, Glenn Fung, Vikas Singh. Transformer-based models are widely used in natural language processing (NLP). Central to the transformer model is the self-attention mechanism, which captures the interactions of token pairs in the input sequences and depends quadratically on the sequence length. Training such models on longer sequences is expensive. In this paper, we show that a Bernoulli sampling attention mechanism based on Locality Sensitive Hashing (LSH), decreases the quadratic complexity of such models to linear. We bypass the quadratic cost by considering self-attention as a sum of individual tokens associated with Bernoulli random variables that can, in principle, be sampled at once by a single hash (although in practice, this number may be a small constant). This leads to an efficient sampling scheme to estimate self-attention which relies on specific modifications of LSH (to enable deployment on GPU architectures). We evaluate our algorithm on the GLUE benchmark with standard 512 sequence length where we see favorable performance relative to a standard pretrained Transformer. On the Long Range Arena (LRA) benchmark, for evaluating performance on long sequences, our method achieves results consistent with softmax self-attention but with sizable speed-ups and memory savings and often outperforms other efficient self-attention methods. Our code is available at this https URL

翻訳待ちのため原文を表示しています。

コンテキスト長非公開
入力 → 出力テキスト → テキスト
モデルウェイト未確認
情報更新日時2026/10/31 00:49:26
OVERVIEW

モデル紹介

The YOSO model was proposed in You Only Sample (Almost) Once: Linear Cost Self-Attention Via Bernoulli Sampling by Zhanpeng Zeng, Yunyang Xiong, Sathya N. Ravi, Shailesh Acharya, Glenn Fung, Vikas Singh. Transformer-based models are widely used in natural language processing (NLP). Central to the transformer model is the self-attention mechanism, which captures the interactions of token pairs in the input sequences and depends quadratically on the sequence length. Training such models on longer sequences is expensive. In this paper, we show that a Bernoulli sampling attention mechanism based on Locality Sensitive Hashing (LSH), decreases the quadratic complexity of such models to linear. We bypass the quadratic cost by considering self-attention as a sum of individual tokens associated with Bernoulli random variables that can, in principle, be sampled at once by a single hash (although in practice, this number may be a small constant). This leads to an efficient sampling scheme to estimate self-attention which relies on specific modifications of LSH (to enable deployment on GPU architectures). We evaluate our algorithm on the GLUE benchmark with standard 512 sequence length where we see favorable performance relative to a standard pretrained Transformer. On the Long Range Arena (LRA) benchmark, for evaluating performance on long sequences, our method achieves results consistent with softmax self-attention but with sizable speed-ups and memory savings and often outperforms other efficient self-attention methods. Our code is available at this https URL

主な特徴

特点摘要待依据来源补齐,不凭模型名称推断能力。

制約と注意点

具体的な制約を判断する出典が不足しています。実際の性能、遅延、データ方針、ライセンス、提供期間を確認してください。

PRICING & COST

出典別料金と費用分析

料金はチャネル・地域・設定によって異なります。各チャネルの料金は個別に表示し、提供元の統一公式料金とは見なしません。

出典・チャネル入力出力課金単位収集日時
確認可能な料金がありません。出典を確認してください。

月額の基本トークン費用を試算

—

試算はキャッシュ割引、段階料金、マルチモーダル追加料金、検索、税金、追加推論出力を含みません。

INDEPENDENT BENCHMARKS

公開評価と実行設定

暂无已采集的可核验公开评分。模型未上榜不代表能力较低。

収録済みの全ランキング →

よくある質問

オープンウェイトなら無料で商用利用できますか?

必ずしもそうではありません。バージョン別のライセンス、商用条件、利用方針を確認してください。自前運用には計算資源と保守費用も必要です。

これはリアルタイムの請求料金ですか?

収集日時付きの料金スナップショットです。最新のバージョン、地域、割引、課金方式は各チャネルで確認してください。

出典と追跡記録

许可证:来源未披露,须进一步核验。模型介绍与第三方评测均以原来源的具体版本和方法为准。