• Home
  • Technology
  • Gaming
  • Entertainment
  • World & Business
  • Science
  • Sports
  • AI
HomeTechnologyGamingEntertainmentWorld & BusinessScienceSportsAI
  • HomeTechnologyGamingEntertainmentWorld & BusinessScienceSportsAI
    • Home
    • Technology
    • Gaming
    • Entertainment
    • World & Business
    • Science
    • Sports
    • AI
    AI

    Perplexity Describes Its Vector Embedding Approach

    Official account outlines embedding workloads for indexing and queries.

    PE
    1 Source, 26d ago, first seen 26d ago

    TLDR

    Perplexity's official account stated that the company embeds queries and documents into one vector space and searches by nearest vectors. This approach leads to two distinct workloads according to the post: bulk batch embedding focused on throughput for indexing and scoring, along with per-query online embedding aimed at low latency for live search. The message comes from the verified company account on the platform.

    Combined views

    4.2K

    1 Source, first seen 26d ago

    Combined views

    4.2K

    1 Source, first seen 26d ago

    35 likes
    35 likes
    2 comments
    1 saves
    2 reposts

    Sentiment

    Positive——Negative

    Summary

    Not enough discussion yet.

    No sentiment analysis available yet.

    2 comments
    1 saves
    2 reposts

    Sentiment

    Positive——Negative

    Summary

    Not enough discussion yet.

    No sentiment analysis available yet.

    Today's Rank

    —

    Not ranked yet

    Today's Rank

    —

    Not ranked yet

    1 Source

    @perplexity_aiPerplexity embeds queries and documents into one vector space, then searches by nearest vectors. This creates two workloads: bulk batch embedding for indexing and scoring (throughput‑focused) and per‑query online embedding for live search (latency‑focused).

    1 Source

    @perplexity_aiPerplexity embeds queries and documents into one vector space, then searches by nearest vectors. This creates two workloads: bulk batch embedding for indexing and scoring (throughput‑focused) and per‑query online embedding for live search (latency‑focused).