CORTEXA
← Browse
arxivcs.SDcs.IRcs.LG2026-07-24

Reflector: Arrangement-Aware Harmonic Retrieval for Sample-Based Composition

Austin Rockman

Sample retrieval tools can help composers find harmonically compatible material, but querying from a fixed reference sample becomes less informative as arrangements evolve and the harmonic context shifts with each musical decision. We present Reflector, an interactive audio workstation that tracks harmonic combinations as they accumulate on the composer's timeline and adapts retrieval as the arrangement develops. The system is organized around a fixed interval-class oracle: a hand-designed table of weights that scores how pitch-class content combines between sources. An encoder trained entirely on synthetic audio learns to approximate the oracle in a 128-dimensional embedding space, where dot products stand in for compatibility scores at interactive speed. As the composer arranges material on a multi-track timeline, a sweep-line analysis discovers co-sounding regions, computes oracle-weighted centroids, and retrieves against the composite harmonic identity of the session as it evolves. Session centroids projected into a navigable 3-D space reveal structural harmonic relations across the composer's body of work. This paper is a systems account: we give the design rationale for each architectural decision, characterize Reflector's behavior through intrinsic measurements on a working sample library, and describe the implementation. The characterization yields a central finding: the learned embedding preserves the kernel's pairwise judgments while covering the whole library, something the kernel cannot do when used directly as a retrieval rule, because the embedding's normalized geometry cannot express the degenerate solutions that direct scoring favors. The entire pipeline runs locally with no copyrighted training data. Reflector is free, and the training pipeline is open source.

View free PDFSource page

Related papers

arxivcs.IRcs.LG2026-07-03

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls

Kirill Shevkunov, Andrey Ploskonosov, Liudmila Prokhorenkova

In many machine learning applications, the most relevant items for a query should be efficiently retrieved. The relevance function is usually an expensive similarity model, making the exhaustive search infeasible. A typical solution is to train another model that separately embed…

View free PDFSource page
arxivcs.ITcs.CLcs.IRcs.LG2026-06-28

An Information-Geometric Justification for Composite Coherence in Event-Based Narrative Extraction

Brian Keith-Norambuena

Graph-based narrative extraction relies on a coherence function to score transitions between events, but the coherence metrics in current use are defined operationally and lack an information-theoretic foundation. We study the composite metric $C=\sqrt{A\cdot T}$, where $A$ is th…

View free PDFSource page
arxivcs.IRcs.LG2026-06-29

Diagnosing and Mitigating Retrieval Bottlenecks in LLM-Based Cold-Start Recommendation

Zhe Dong, Fang Qin, Manish Shah, Yicheng Wang

Large language models (LLMs) are increasingly used as rerankers in recommender systems, with the expectation that semantic understanding will help in cold-start and long-tail regimes. We test this assumption with a five-domain benchmark that explicitly separates reranking quality…

View free PDFSource page
arxivcs.IRcs.LG2026-07-10

Tokenizing Numerical and Embedding Features for LLM RecSys

Zhe Xu, Ankit Peshin, Chiyu Zhang, Feng Qi, Johnson Lui, Anil Ramakrishna, et al.

Large language models (LLMs) are increasingly used as backbone architectures for recommender systems because of their strong sequence modeling and representation learning capabilities. However, most LLM-based recommenders operate primarily on discrete textual tokens, whereas prac…

View free PDFSource page