← All speakers

Bio, Work & Ideas

Jeff Vestal

Conference affiliation: Elastic

On this page

Jeff Vestal is an AI specialist at Elastic and co-author, with Bahaaldine Azarmi, of Vector Search for Practitioners with Elastic. His projects explain the choices behind retrieval-augmented AI: combining semantic search with exact keyword matches, enforcing document permissions before generation, and measuring what vector compression loses. His agent-memory work applies those retrieval methods to decisions and tasks that need to survive across coding sessions.

Jeff’s earlier career included work with proprietary traders and market makers, followed by commercial online brokerages. At E*TRADE, he was a senior systems engineer in the real-time data pipeline group. He led the adoption of Elastic machine learning and created an Elastic Slackbot integration, as described in his career biography. His E*TRADE presentation examined anomaly detection in an operational intelligence pipeline aggregating text and performance data.

His 2023 ElasticDocs_GPT project combined keyword and vector searches over Elasticsearch documentation, passed the retrieved document to GPT, and returned an answer with the original documentation link. The implementation made the dependence between retrieval and generation explicit: the model needed relevant documentation to answer the question, and the reader needed a source to inspect. Jeff deliberately used a single result for the demonstration; his implementation guide explained why other applications might need several documents or smaller chunks to provide enough context.

Published in November 2023, his book with Bahaaldine extended this practical treatment of vectors beyond documentation assistants. It covers model deployment, resource planning, performance testing, image search, observability, cybersecurity, and retrieval-augmented generation, connecting search implementation to the demands of different applications.

Choosing what reaches the model

Jeff’s technical examples address distinct decisions in a retrieval system:

  • Preserve both meaning and exact references. In his persistent agent-memory implementation, semantic search can recover conceptually related decisions, while keyword search can recover a specific task identifier. Rank fusion combines the results, and recency weighting favors newer context. These methods address different ways a useful memory can be missed: its wording may differ from the query, or its exact identifier may matter more than semantic similarity.
  • Measure the effect of vector compression. His quantized-vector search experiment compares approximate retrieval with exhaustive search over the same embedded data, measuring overlap between their top-ten results. That measures nearest-neighbor recall rather than the usefulness of a generated answer. Jeff explains how compressed vectors can select candidates before full-precision rescoring, and presents the small experiment as a method to repeat on a reader’s own data rather than a quality guarantee across datasets.
  • Enforce permissions before supplying context. His RAG and role-based access control example uses an internal HR assistant with general policies and manager-only compensation information in separate indices. The user’s permissions determine which indices can be searched, so restricted material is excluded before the model receives its context. The example locates access control in retrieval, where it can govern the information available for an answer.

Memory across coding sessions

Jeff’s agent-memory project extends retrieval from external documentation to an agent’s working history: decisions, tasks, session records, and project relationships. Claude Code hooks synchronize memory and index structured Markdown, while a shared Elasticsearch store supports handoffs between machines.

His account of the implementation also identifies its constraints. The approach is most attractive when Elasticsearch is already part of the stack, and its relationship layer depends on consistently structured documents. Persistent storage alone does not supply usable project history; the structure and retrieval methods determine whether an agent can recover the decision or task it needs.

Read the topics behind these talks

1 conference talk

Key ideas

Scroll to read ↓

Jeff Vestal and James Williams work through semantic search, BM25, ranking fusion and agent tools in Elasticsearch, then examine when reranking earns its extra inference cost.

  • Semantic retrieval handles varied phrasing; lexical retrieval helps preserve precise terms and opaque identifiers. Test both against the queries that matter.
    16:54 ↗
  • RRF combines result positions. Linear combination normalizes scores and exposes weights that should be evaluated against judgment sets.
    38:08 ↗
  • Filters narrow the candidate pool, while search templates let a routing layer choose among prepared retrieval strategies. Neither requires automatic learning of relevance weights.
    39:57 ↗
  • Inspect an agent’s searches, returned documents and stored source URLs to understand what evidence produced its answer.
    59:19 ↗
  • Rerank a shortlist when better ordering justifies fresh inference. Pointwise scoring evaluates pairs independently; listwise scoring compares candidates together.
    1:06:42 ↗

References