Alexander Apartsin

Dr. Alexander Apartsin

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 March 2025 in Education Sciences
Verified
Journal Article
Open access
PDF file
YAYehudit Aperstein
Yehudit Aperstein
Yuval CohenYuval Cohen
Yuval Cohen
AAAlexander Apartsin
Alexander Apartsin
This paper begins with a comprehensive review of the deliberate teaching practice literature related to generative AI training platforms. It then introduces a conceptual framework for a generative AI-powered system designed to simulate dynamic classroom environments, allowing teachers to engage in repeated, goal-oriented practice sessions. Leveraging recent advances in large language models (LLMs) and multiagent systems, the platform features virtual student agents configured to demonstrate varied learning styles, prior knowledge, and behavioral traits. In parallel, mentor agents—built upon the same generative AI technology—continuously provide feedback, enabling teachers to adapt their strategies in real time. By offering an accessible, controlled space for skill development, this framework addresses the challenge of scaling and personalizing teacher training. Grounded in pedagogical theory and supported by emerging AI capabilities, the proposed platform enables educators to refine teaching methods and adapt to diverse classroom contexts through iterative practice. A detailed outline of the system’s main components, including agent configuration, interaction workflows, and a deliberate practice feedback loop, sets the stage for more personalized, high-quality teacher training experiences, and contributes to the evolving field of AI-mediated learning environments.

8 December 2025 in Information
Verified
Journal Article
Open access
PDF file
YAYehudit Aperstein
Yehudit Aperstein
AGAlon Gottlib
Alon Gottlib
GBGal Benita
Gal Benita
AAAlexander Apartsin
Alexander Apartsin
Understanding semantic relations between two texts is crucial for many information and document management tasks, in which one must determine whether the content fully overlaps, is completely superseded by another document, or overlaps only partially, with unique information in each. Beyond establishing this relation, it is equally important to provide explainable outputs that specify which pieces of information are present, missing, or newly added between the text pair. In this study, we formally define semantic relations between two texts through the set-theoretic relation between their respective Answerable Question Sets (AQS), the sets of questions each text can answer. Under this formulation, Semantic Text Relation (STR), such as equivalence, inclusion, and mutual overlap, becomes a well-defined set relation between the corresponding texts’ AQSs. The set differences between the AQSs also serve as an explanation or diagnostic tool for identifying how the information in the texts diverges. Using this definition, we construct a synthetic benchmark that captures fine-grained informational relations through controlled paraphrasing and deliberate information removal supported by AQS manipulations. We then use this dataset to evaluate several discriminative and generative models for classifying text pairs into STR categories, assessing how well different model architectures capture semantic relations beyond surface-level similarity. We publicly release both the dataset and the data generation code to support further research.

16 May 2026 in Electronics
Verified
Journal Article
Open access
PDF file
YAYehudit Aperstein
Yehudit Aperstein
AAAlexander Apartsin
Alexander Apartsin
Early-exit cascades over a frozen convolutional backbone enable adaptive inference but suffer from three sources of train–inference mismatch: branches train on samples they will never see at inference; their per-class precision thresholds are calibrated on the wrong distribution; the standard cross-entropy target on backbone argmax labels discards the backbone’s uncertainty signal. We close all three gaps with CalexNet (cascade-aligned early exits), a training-recipe-only modification: branches train under continuously weighted importance sampling that matches the cascade-survivor distribution; per-class precision thresholds are calibrated on the actual cascade-survivor subset of the validation set; the classification head is trained against the backbone’s full softmax via a temperature-scaled KL objective. Combined with an augmented prototype-pooling branch head, CalexNet is evaluated on ResNet18 and ResNet50 backbones across CIFAR-100 (20-supe-class coarse, the harder primary setting) and CINIC-10 (10-class, the easier cross-validation counterpart). On the accuracy–FLOPs Pareto frontier, CalexNet matches or exceeds three published baselines (PTEEnet, ZTW, BoostNet) and a within-paper “no-alignment, no-KD” reference. The largest gains appear in the practically relevant 30–70% FLOPs-reduction regime and show consistent trends across n=3 training seeds. CalexNet requires no inference-time architectural change and is a drop-in for any frozen-backbone early-exit cascade.

Verified
Journal Article
Open access
PDF file
YAYehudit Aperstein
Yehudit Aperstein
EMEden Moran
Eden Moran
AAAlexander Apartsin
Alexander Apartsin
When people recount personal memories, they often refer to people, places, and events indirectly, relying on contextual cues rather than explicit names. Such implicit references are central to reminiscence narratives: first-person accounts of lived experience used in therapeutic, archival, and social settings. They pose a difficult computational problem because the intended entity must be inferred from dispersed narrative evidence rather than from a local mention. We introduce IRC-Bench, the Implicit Reminiscence Context Benchmark, for evaluating implicit entity recognition in reminiscence transcripts. The benchmark targets non-locality: entity-identifying cues are distributed across multiple, non-contiguous clauses, unlike named entity recognition, entity linking, or coreference resolution. IRC-Bench comprises 25,136 samples constructed from 12,337 Wikidata-linked entities across 1994 transcripts spanning 11 thematic domains. Each sample pairs an Entity-Grounded Narrative, in which the target entity is explicitly mentioned, with an Entity-Elided Narrative, in which direct mentions are removed. We evaluate 19 configurations across LLM generation, dense retrieval, RAG, and fine-tuning. QLoRA-adapted Llama 3.1 8B performs best in the open-world setting (38.94% exact match; 51.59% Jaccard), while fine-tuned DPR leads in closed-world retrieval (35.38% Hit@1; 71.49% Hit@10). We release IRC-Bench with data, code, and evaluation tools.

30 October 2026 in IoT
Verified
Journal Article
Open access
PDF file
AAAlexander Apartsin
Alexander Apartsin
YAYehudit Aperstein
Yehudit Aperstein
The Industrial Internet of Things (IIoT) instruments physical processes with networked sensors and controllers that stream multivariate telemetry, and monitoring this telemetry for faults and cyberattacks is essential to reliability and safety. Machine learning is the natural tool, but failures are rare and seldom labeled, so supervised detection is impractical: a detector must learn normal behavior from unlabeled telemetry alone. In cyber-physical systems, this normal law is structured: a union of many imbalanced operating regimes shaped by physics and control, formalized as ten Massive, Implicit, Imbalanced Multimodality (MIIM) assumptions. That structure exposes a blind spot of the dominant approach: a fault can be individually normal on every sensor and reconstruct accurately, yet improbable under normal joint operation, so reconstruction-based detectors measure reachability rather than probability and miss it. Our detector, LatAD (Latent-density Anomaly Detector), learns a latent Gaussian-mixture clustering of regimes (VaDE, Variational Deep Embedding), scores anomalies by density, and factorizes that density over correlation-community subsystems combined by a cohesion-weighted Higher Criticism statistic. On three real IIoT testbeds, LatAD attains the best All-subset AUROC of any learned detector on HAI (0.948) and leads the difficult subset on HAI (0.845; a significant +0.088, 95% CI [0.042, 0.157]); USAD and TranAD fall to 0.44–0.50 on these reconstructable-but-improbable faults.

25 June 2026 in AI
Verified
Journal Article
Open access
PDF file
IAIgor Adamenko
Igor Adamenko
OAOrpaz Ben Aharon
Orpaz Ben Aharon
YAYehudit Aperstein
Yehudit Aperstein
AAAlexander Apartsin
Alexander Apartsin
Urban environments are saturated with imaging sensors deployed for purposes unrelated to vehicle identification, from ATM and dashboard cameras to pole-mounted CCTV and smartphones. We term the use of such non-purpose-built sensors for secondary inference “opportunistic sensing”; its central question is where, under uncontrolled capture conditions, AI-enabled restoration remains reliable. This paper introduces recoverability maps, a task-agnostic methodology for quantifying that boundary, and applies it to oblique-view license plate recognition (LPR). It pairs a full-grid synthetic sweep of the degradation space with two summary measures: a boundary area-under-curve for coverage and a reliability score F for the frequency and depth of interior unrecovered pockets. For LPR, the space is the oblique-angle grid [0°,89°]2 sampled by Scrambled Sobol sequences, and the utility is plate-level optical character recognition (OCR) accuracy. Within this synthetic benchmark, approximately 90–92% of the angle grid is recoverable (best single model to union of restoration arms), recovery degrades sharply beyond roughly 80° in both axes, and lateral rotations are harder to reconstruct than elevational ones. Five restoration architectures cluster within a narrow AUC band of 0.89–0.93, and share the same α/β asymmetry, so the recoverable region is set primarily by sensing geometry, with architecture affecting efficiency and interior consistency; discriminative architectures outperform generative models. The methodology is validated on real plates: on CCPD and the Brazilian legacy and Mercosur layouts of RodoSol-ALPR, restoration raises held-out extreme-angle recognition by +15 to +38 exact-match points under plate-specialized recognizers, and the discriminative-over-generative ordering reproduces on real data.