Search papers, labs, and topics across Lattice.
100 papers published across 8 labs.
LLM ensembles excel at classifying narrative similarity, but simpler embedding models can achieve comparable performance with clever pre- and post-processing.
Unleash your AI agent's business acumen: this framework lets AI not just analyze experiments, but actively ideate, personalize, and optimize business strategies within a safe, unified software interface.
Seemingly innocuous choices in table serialization format (CSV vs. HTML) can drastically alter retrieval performance, but a simple centroid-based correction can restore semantic consistency.
See where your citations are coming from with a single command, thanks to CiteRadar's open-source platform that automatically generates interactive maps and detailed researcher profiles from your Google Scholar ID.
Dependency-controlled context and explicit evidence sufficiency criteria are key to preventing premature stopping and improving the consistency of enterprise research outputs.
Unleash your AI agent's business acumen: this framework lets AI not just analyze experiments, but actively ideate, personalize, and optimize business strategies within a safe, unified software interface.
Seemingly innocuous choices in table serialization format (CSV vs. HTML) can drastically alter retrieval performance, but a simple centroid-based correction can restore semantic consistency.
See where your citations are coming from with a single command, thanks to CiteRadar's open-source platform that automatically generates interactive maps and detailed researcher profiles from your Google Scholar ID.
Dependency-controlled context and explicit evidence sufficiency criteria are key to preventing premature stopping and improving the consistency of enterprise research outputs.
LLMs re-rank documents better when you learn to route each query to the specific attention heads that matter, instead of relying on static subsets or everything at once.
Explicitly enumerating skills in-context doesn't scale for agentic LLMs, but retrieving skills on demand can substantially improve performance – if the LLM can figure out when and which skill to load.
Asymptotically shorter secret keys in Information-Theoretic Distributed Point Functions are now possible, thanks to a novel construction leveraging private information retrieval.
LLMs can bootstrap their understanding of private APIs by autonomously learning from their own coding attempts, outperforming retrieval-augmented generation by 16% on code generation tasks.
6G-enabled Internet of Everything promises a unified intelligent ecosystem, but faces critical scalability, security, and privacy challenges that demand innovative research.
Sequence recommendation models can achieve near-perfect scaling efficiency in distributed training, slashing wasted GPU cycles by up to 90%.
GraphRAG's black-box reasoning gets a spotlight: XGRAG reveals how specific knowledge graph components influence LLM outputs, boosting explanation quality by 14.81% over standard RAG explainability methods.
Sub-linear attention is now possible without sacrificing complete long-range dependency retention, thanks to learnable summary tokens that compress context.
Generative recommendation gets a boost: modeling behavior intensity and transitions yields 15-23% gains in prediction accuracy.
Storing user interaction histories in a normalized, immutable tier and reconstructing sequences just-in-time slashes data infrastructure costs and unlocks the potential of ultra-long sequence DLRMs.
Self-supervised vision models that ace linear probing can still flop at semantic image retrieval because of skewed latent space geometry that breaks approximate nearest neighbor search.
LLMs can denoise sequential recommendations by disagreeing with the recommendation model itself, leading to more robust performance against noisy user data.
Semantic grounding, not token probability, is the key to better multimodal RAG.
Species identification and discovery, traditionally treated as separate problems, can be unified into a single framework that leverages retrieval-augmented reasoning for improved accuracy and interpretability.
Many recommender system fairness metrics are flawed, producing scores that are uninterpretable, inexpressive, or even incalculable in common scenarios.
Stop relying on LLMs to "hallucinate" reasoning paths – SEARCH-R uses a fine-tuned Llama3.1-8B model and dependency tree-based retrieval to navigate multi-hop question answering more reliably.
Multi-node spot instance configurations recommended by SpotVista offer 81% greater availability and 26% more cost savings than current state-of-the-art and publicly available services.
Stop blindly trusting LLMs: PageGuide visually grounds AI answers directly in the webpage, slashing task times by up to 70% and boosting accuracy by 26%.
By reconstructing extractions and comparing them to the original document, RaV-IDP offers a grounded, label-free quality signal that dramatically improves the fidelity of intelligent document processing pipelines.
Finding similar analog circuits across netlists, schematics, and descriptions just got way easier: a new model achieves 75% recall, unlocking better circuit design automation.
Highlighting pivotal evidence can boost LLM performance without altering the original context, leading to substantial improvements in reasoning tasks.
LLMs, when combined with efficient indexing, can extract actionable incidents from just a handful of noisy user descriptions in real-time, enabling rapid anomaly detection in large-scale cloud services.
Forget polling every user on every idea – this algorithm learns to find common ground by strategically asking for feedback on a few key statements.
Scale up your nearest neighbor search without blowing your budget: this work shows how to use Dask to parallelize Product Quantization and Inverted Indexing, achieving accuracy comparable to single-machine methods on much larger datasets.
Get LLM-boosted recommendations without the LLM latency: this distillation method lets you bake rich user profiles into efficient sequential recommenders.
A surprisingly simple, linear-time algorithm, MinCov, nearly matches the performance of much slower metaheuristics in identifying critical nodes in bipartite dependency networks.
MemPalace's impressive memory recall isn't due to its fancy "memory palace" spatial organization, but rather its simple "store everything verbatim" approach combined with a strong embedding model.
Sentence embeddings can be objectively evaluated for conceptual stability without relying on downstream classifiers, revealing their true capacity to capture meaning.
Enterprise LLM agents leak sensitive information in up to 50% of interactions, and surprisingly, performing better at tasks makes the problem *worse*.
Structured graph memory can outperform full-context prompting for cross-session LLM reasoning, but optimizing for specific reasoning skills can hurt overall performance.
Multi-modification image retrieval is now possible: TEMA handles complex, real-world instructions that go beyond simple changes, outperforming existing methods on new datasets M-FashionIQ and M-CIRR.
Data portability in recommender systems doesn't guarantee better outcomes for users, as its impact varies significantly depending on the specific recommendation algorithm employed.
LLMs can now directly predict geographic coordinates with high accuracy, even for vague locations and complex regions, bypassing the need for traditional geocoding pipelines.
Achieve state-of-the-art sequential recommendations by aligning multi-resolution temporal dynamics with graph propagation at matching scales.
Turns out, the best way to represent tabular data depends heavily on the task at hand, so a one-size-fits-all tabular foundation model may be a mirage.
Predicting pre-promotion conversions in e-commerce gets a boost with a new model that understands how users "window shop" before sales actually start.
Fine-tuning a single LLM to both reason about and predict future occupations surprisingly beats using two separate fine-tuned LLMs for each task.
SPLADE models can ditch their token-based vocabularies for a latent semantic space learned by Sparse Auto-Encoders, maintaining retrieval performance while boosting efficiency.
LLMs can now reliably extract job skills from text, even in low-resource settings, thanks to a novel framework that enforces output validity and reduces hallucinations.
LLM ensembles excel at classifying narrative similarity, but simpler embedding models can achieve comparable performance with clever pre- and post-processing.
LLMs can rewrite bad job descriptions and category-aware MoEs can better match candidates, leading to a 19.4% boost in recruitment click-through rates and millions saved.
Early fusion UMR models lean too heavily on text, while late fusion struggles to relate semantically similar content – MiMIC offers a fix.
Quantifying vague software requirements doesn't have to be a guessing game: this method slashes the ambiguity with interactive preference elicitation, achieving 40x better results.
Systematic coverage gaps in retrieval evaluations can lead to misleading assessments, but semantic stratification offers a clearer, more trustworthy framework for understanding retrieval performance.
Short-term A/B test metrics can be misleading: this paper shows how to accurately estimate long-term value changes by modeling treatment effects as a decaying function learned from multiple cohorts.
SmartVector nearly doubles the accuracy of retrieval-augmented generation systems by embedding temporal and relational context directly into vector representations.
CDLF outperforms traditional forecasting methods by adapting to new product data in real-time, even in the absence of historical outcomes.
Achieve up to 74% improvement in stock ranking accuracy by disentangling temporal trends and purifying structural relationships, sidestepping the crosstalk problem that plagues existing graph-based methods.
Forget retraining: LEVER lets you snap together pre-trained RL policies at inference time, matching or beating from-scratch performance in some cases.
SiPeR reveals how integrating scene dynamics with Bayesian inference can dramatically enhance the relevance of conversational recommendations in real-world contexts.
ORPHEAS outperforms state-of-the-art multilingual models, proving that specialized fine-tuning can enhance retrieval capabilities for morphologically complex languages.
Stop penalizing your ANN search algorithms for failing to retrieve irrelevant neighbors – Semantic Recall offers a more nuanced and effective way to measure retrieval quality.
Achieve unbounded historical video association for popularity prediction without unbounded storage growth by clustering videos in a topology-aware memory bank and updating cluster features instead of storing individual videos.
Forget RAG's indirect knowledge injection – Knowledge Capsules let external knowledge directly influence LLM attention, boosting performance and stability in complex reasoning tasks.
Leaking user queries through disk access patterns in sensitive ANN search? Onyx flips the script on prior work to achieve up to 9.9x cost reduction and 12.3x latency improvement.
Key contribution not extracted.
Enterprise AI agents don't need stateful memory to be effective: a stateless architecture called Deterministic Projection Memory (DPM) actually *beats* stateful approaches in regulated domains when memory is constrained, while also being faster and more auditable.
Stop passively waiting for retrieval cues – ProactAgent proactively asks for information from its memory and skills, leading to significant gains in lifelong learning performance.
Turns out, the best external knowledge source for multilingual medical QA depends on whether you're working with a high- or low-resource language, and blindly adding PubMed might not be the answer.
Discover expertise and collaborators in battery research at a global scale, grounded in semantic understanding rather than just citations.
Retrieval-based memory is out: schema-constrained generation ensures agents recall contextually relevant information without hallucinating memory keys, leading to substantial performance gains.
LIS scholars get more basic as they age: bibliometric methods dominate the twilight of their careers.
CIR models struggle with noisy data because "hard noise" breaks the small loss hypothesis, but ConeSep's novel unlearning approach overcomes this to achieve state-of-the-art results.
Key contribution not extracted.
Quantizing user preferences into discrete tokens unlocks personalized multimodal content generation with improved consistency between modalities.
LLM-enhanced recommenders stumble because of representation norm disparities and semantic misalignment, but a simple normalization and PCA-inspired alignment can unlock their potential.
Ditch your old MSS evaluation metrics: MERT-based embeddings correlate far better with human perception.
LLMs are poised to flip the script on personalization, giving users unprecedented control over their data and how it's used across platforms.
Achieve state-of-the-art remote sensing image-text retrieval without the computational burden of large-scale vision-language model pre-training, thanks to a novel two-stage approach.
Speed up your RAG pipelines by up to 37% without sacrificing accuracy by speculatively retrieving documents based on query homology.
Forget generic image-text embeddings – teaching models to generate and reason about product *attributes* unlocks SOTA e-commerce retrieval.
Multilingual RAG systems are systematically suppressing "answer-critical" documents in non-English languages, crippling their ability to leverage global knowledge.
By clustering users based on the geometry of their feature spaces *before* training, FB-NLL sidesteps the vulnerability of existing federated learning methods to noisy labels and corrupted updates.
Forget picking influencers by headcount; this new framework lets you maximize influence based on your actual ad budget, and it even sharpens the math for the old way of doing things.
Achieve up to 17.6% recall and 16% NDCG gains in sequential recommendation by modeling transitions directly in the discrete semantic code space, effectively capturing fine-grained semantic dependencies often lost in aggregated item representations.
CKGE benchmarks overestimate performance by up to 25% because they fail to account for "entity interference," a newly identified phenomenon where embeddings of new entities disrupt previously learned relationships.
FOCAL-Attention resolves the inherent coverage-anchoring conflict in heterogeneous graph learning, outperforming existing methods in multi-label node classification.
LLMs can be effectively combined with graph-based methods to capture both semantic and structural information in tables, leading to state-of-the-art performance in table annotation tasks.
Forget relying on implicit reasoning: A-MAR's explicit reasoning plans unlock better artwork understanding by strategically retrieving relevant evidence.
Forget generic assistants – EgoSelf learns your habits from your first-person view data to predict your future interactions.
Stop optimizing generative engines in isolation: MAGEO learns reusable editing strategies that dramatically improve visibility and citation fidelity across diverse engines.
Ditch ROUGE and unstable LLM rankings: SCURank leverages Summary Content Units to identify and select the most semantically rich summaries from diverse LLMs, boosting distillation performance.
Forget single-shot QA: this paper introduces a new task of generating follow-up insights that extend and improve initial answers, enabling richer, more iterative user interactions.
Unlock the black box of late-interaction retrieval models: Diagnosable ColBERT lets you directly inspect what the model "understands" by aligning token embeddings to a clinically-grounded latent space.
Forget relying on symbols or version strings – this new method pinpoints vulnerabilities in stripped IoT firmware across different architectures with impressive accuracy.
Stop feeding your LLM-based bug reproduction tools irrelevant code: iCoRe's correlation-aware retrieval boosts test generation accuracy by up to 31.7%.
Train smarter, not bigger: LoopCTR unlocks state-of-the-art CTR prediction by decoupling computation from parameter growth through recursive layer reuse.
Uncover misleading half-truths by pitting a Politician agent against a Scientist agent in a debate moderated by a Judge, revealing what's left unsaid.
MLLMs can be distilled into lightweight arbiters that dramatically improve the robustness of composed image retrieval by disentangling noisy training signals.
DINO, not CLIP, might be the better foundation for open-set 3D object retrieval, especially when paired with dynamic view integration and virtual feature synthesis to avoid overfitting.
Academic paper "highlights" sections are a surprisingly rich source of keywords, boosting unsupervised extraction when combined with abstracts.
The widely-held belief that GNNs outperform feature-only methods for Bitcoin fraud detection crumbles under rigorous, leakage-free evaluation, revealing that the graph structure can actually hurt performance.
Reproducibility crisis hits RAG: closed-source LLM updates, missing implementation details, and unreleased prompts make replicating MetaRAG's original performance a challenge, despite confirming relative gains.
LLMs are unreliable ranking engines on their own, but fusing them with graph-grounded IRL creates a recommender system that's more than the sum of its parts, boosting NDCG@10 by up to 16.8%.
Forget web search, dense retrieval augmented with hierarchical metadata achieves 94% hit rate in semantic search for electronic components, blowing away traditional methods.
Counterfactual explainers for recommender systems don't generalize as well as we thought: their effectiveness and sparsity depend heavily on the evaluation setting, and graph-based methods struggle to scale.