BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Ye Jin

Ye Jin contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Information RetrievalInformation TheoryMachine Learningmath.ITphysics.chem-ph

Trust snapshot

Quick read

Trust 15 - UnverifiedVerification L1Unclaimed author
3works
0followers
5topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

3 published item(s)

preprint2026arXiv

Hierarchical Long-Term Semantic Memory for LinkedIn's Hiring Agent

Large Language Model (LLM) agents are increasingly used in real-world products, where personalized and context-aware user interactions are essential. A central enabler of such capabilities is the agent's long-term semantic memory system, which extracts implicit and explicit signals from noisy longitudinal behavioral data, stores them in a structured form, and supports low-latency retrieval. Building industrial-grade long-term memory for LLM agents raises five challenges: scalability, low-latency retrieval, privacy constraints, cross-domain generalizability, and observability. We introduce the Hierarchical Long-Term Semantic Memory (HLTM) framework, which organizes textual data into a schema-aligned memory tree that captures semantic knowledge at multiple levels of granularity, enabling scalable ingestion, privacy-aware storage, low-latency retrieval, and transparent provenance; HLTM further incorporates an adaptation mechanism to generalize across diverse use cases. Extensive evaluations on LinkedIn's Hiring Assistant show that HLTM improves answer correctness and retrieval F1 significantly by more than 10%, while significantly advancing the Pareto frontier between query and indexing latency. HLTM has been deployed in LinkedIn's Hiring Assistant to power core personalization features in production hiring workflows.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Integrated Sensing and Communication: Rate-Distortion Fundamental Limits of State Estimator

The state-dependent memoryless channel (SDMC) is employed to model the integrated sensing and communication (ISAC) system, where the transmitter conveys messages to the receiver while simultaneously estimating the state parameter of interest via the received echo signals. However, the performance of sensing has often been neglected in existing works. To address this gap, we establish the rate-distortion function for sensing performance in the SDMC model, which is defined based on standard information-theoretic principles to ensure clear operational meaning. In addition, we propose a modified Blahut-Arimoto type algorithm for solving the rate-distortion function and provide convergence proofs for the algorithm. We further define the capacity-rate-distortion tradeoff region, which unifies information-theoretic results for communication and sensing within a single optimization framework. Finally, we numerically evaluate the capacity-rate-distortion region and demonstrate the benefit of coding in terms of estimation rate for certain channels.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Combining Localized Orbital Scaling Correction and Bethe-Salpeter Equation for Accurate Excitation Energies

We applied localized orbital scaling correction (LOSC) in Bethe-Salpeter equation (BSE) to predict accurate excitation energies for molecules. LOSC systematically eliminates the delocalization error in the density functional approximation and is capable of approximating quasiparticle (QP) energies with accuracy similar or better than the $GW$ Green's function approach and with much less computational cost. The QP energies from LOSC instead of commonly used $G_{0}W_{0}$ and ev$GW$ are directly used in BSE. We show that the BSE/LOSC approach greatly outperforms the commonly used BSE/$G_{0}W_{0}$ approach for predicting excitations with different characters. For the calculations for Truhlar-Gagliardi test set containing valence, charge transfer (CT) and Rydberg excitations, BSE/LOSC with the Tamm-Dancoff approximation provides a comparable accuracy to time-dependent density functional theory (TDDFT) and BSE/ev$GW$. For the calculations of Stein CT test set and Rydberg excitations of atoms, BSE/LOSC considerably outperforms both BSE/$G_{0}W_{0}$ and TDDFT approaches with a reduced starting point dependence. BSE/LOSC is thus a promising and efficient approach to calculate excitation energies for molecular systems.

0 citations0 reviewsNo code linkedOpen access