Pith. sign in

REVIEW 1 cited by

IR2: Information Regularization for Information Retrieval

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.16200 v2 pith:37H4ZDH5 submitted 2024-02-25 cs.IR cs.AIcs.CLcs.LG

IR2: Information Regularization for Information Retrieval

classification cs.IR cs.AIcs.CLcs.LG
keywords regularizationdatainformationsyntheticgenerationretrievalapproachcomplex
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Effective information retrieval (IR) in settings with limited training data, particularly for complex queries, remains a challenging task. This paper introduces IR2, Information Regularization for Information Retrieval, a technique for reducing overfitting during synthetic data generation. This approach, representing a novel application of regularization techniques in synthetic data creation for IR, is tested on three recent IR tasks characterized by complex queries: DORIS-MAE, ArguAna, and WhatsThatBook. Experimental results indicate that our regularization techniques not only outperform previous synthetic query generation methods on the tasks considered but also reduce cost by up to 50%. Furthermore, this paper categorizes and explores three regularization methods at different stages of the query synthesis pipeline-input, prompt, and output-each offering varying degrees of performance improvement compared to models where no regularization is applied. This provides a systematic approach for optimizing synthetic data generation in data-limited, complex-query IR scenarios. All code, prompts and synthetic data are available at https://github.com/Info-Regularization/Information-Regularization.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach

    cs.CL 2026-07 reject novelty 5.0

    A 0.6B router trained by SFT+RL on retrieval-quality rewards reaches 0.771 NDCG@10 across 11 agents, beating intent-prompted LLMs and cutting latency by 82%.