Ivan Malashin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ivan Malashin has a total of 97 co-authors. Here are the top co-authors by number of shared publications:
- Vadim Sergeevich Tynchenko
Bauman Moscow State Technical University, Moscow, Russian Federation
66 shared publications - Andrei Gantimurov
Bauman Moscow State Technical University, Moscow, Russian Federation
47 shared publications - Aleksei Borodulin
Bauman Moscow State Technical University, Moscow, Russian Federation
45 shared publications - Vladimir Nelyub
Bauman Moscow State Technical University, Moscow, Russian Federation
40 shared publications - Dmitry Martysyuk
Bauman Moscow State Technical University, Moscow, Russian Federation
22 shared publications - Igor S. Masich
Bauman Moscow State Technical University, Moscow, Russian Federation
15 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 21-28
Both-or-Neither: Counterfactual Joint-Evidence Auditing for Reliable Audio-Visual Event Localization
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 21-28
Open AccessBoth-or-Neither: Counterfactual Joint-Evidence Auditing for Reliable Audio-Visual Event Localization
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 81-90
Reliability-Aware Intervention Policies for Interactive Gaussian SLAM
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 81-90
Open AccessReliability-Aware Intervention Policies for Interactive Gaussian SLAM
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
PhysMelt: Physics-Anchored Temporal Regime Discovery for Edge Monitoring of Laser Powder Bed Fusion
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessPhysMelt: Physics-Anchored Temporal Regime Discovery for Edge Monitoring of Laser Powder Bed Fusion
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3-12
IconoBench: Can VLMs Understand Cultural Symbols and Iconography?
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 3-12
Open AccessIconoBench: Can VLMs Understand Cultural Symbols and Iconography?
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
GreenToken: Visual Token Pruning for Efficient Underwater Biodiversity Recognition
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessGreenToken: Visual Token Pruning for Efficient Underwater Biodiversity Recognition
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 46-53
PolarShift-Bench: Snow Segmentation under Geographic and Spectral Domain Shift
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 46-53
Open AccessPolarShift-Bench: Snow Segmentation under Geographic and Spectral Domain Shift
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 28-36
Provenance-Aware Detection of Recontextualized Multimodal Disinformation
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 28-36
Open AccessProvenance-Aware Detection of Recontextualized Multimodal Disinformation
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
TrustLift: When Images Make False Claims Look True
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessTrustLift: When Images Make False Claims Look True
- Open Access
- 26 October 2026
- Published by MDPI AG in Fractal and Fractional
- Vol. 10 (11) , 746
Valence-Aware Gradient Memory and Fractional Kernel Comparisons for LoRA-Based Language Model Unlearning
Selective machine unlearning aims to suppress targeted information while preserving retained and general knowledge. We investigate valence-aware gradient memory within low-rank adaptation (LoRA), separating retention-supporting and forgetting-related directions. Earlier experiments used Gamma-scaled exponential moving averages rather than genuine fractional dynamics; we preserve that distinction and introduce a normalized finite-history Grünwald–Letnikov (GL) fractional-integral accumulator with algebraically decaying coefficients. The study progresses from synthetic transformer optimization and pretrained text classification to causal language model experiments, including a new controlled evaluation on TOFU Forget10 using Qwen2.5-0.5B-Instruct. A SciQ- and WikiText-regularized teacher reduces reference-answer NLL on original and paraphrased TOFU questions while exhibiting a small World Facts penalty in a separate audit. From this fixed teacher, four unlearning methods were compared for 120 updates over three random seeds. Dual GL yields the largest paraphrased forget-set NLL increase (), exceeding dual EMA (), but incurs greater retain-set ( versus ) and World Facts ( versus ) degradation. Exact paired sign-flip tests do not establish statistical significance ( for GL versus EMA). The stronger suppression achieved with fractional memory is accompanied by greater disruption of retained and general factual knowledge, suggesting a shift in model behavior rather than more selective forgetting. Whether the targeted information becomes genuinely inaccessible rather than merely less likely to be reproduced remains unresolved.- 26 October 2026
- Published by MDPI AG in Fractal and Fractional
- Vol. 10 (11) , 746
Open AccessValence-Aware Gradient Memory and Fractional Kernel Comparisons for LoRA-Based Language Model Unlearning
Selective machine unlearning aims to suppress targeted information while preserving retained and general knowledge. We investigate valence-aware gradient memory within low-rank adaptation (LoRA), separating retention-supporting and forgetting-related directions. Earlier experiments used Gamma-scaled exponential moving averages rather than genuine fractional dynamics; we preserve that distinction and introduce a normalized finite-history Grünwald–Letnikov (GL) fractional-integral accumulator with algebraically decaying coefficients. The study progresses from synthetic transformer optimization and pretrained text classification to causal language model experiments, including a new controlled evaluation on TOFU Forget10 using Qwen2.5-0.5B-Instruct. A SciQ- and WikiText-regularized teacher reduces reference-answer NLL on original and paraphrased TOFU questions while exhibiting a small World Facts penalty in a separate audit. From this fixed teacher, four unlearning methods were compared for 120 updates over three random seeds. Dual GL yields the largest paraphrased forget-set NLL increase (), exceeding dual EMA (), but incurs greater retain-set ( versus ) and World Facts ( versus ) degradation. Exact paired sign-flip tests do not establish statistical significance ( for GL versus EMA). The stronger suppression achieved with fractional memory is accompanied by greater disruption of retained and general factual knowledge, suggesting a shift in model behavior rather than more selective forgetting. Whether the targeted information becomes genuinely inaccessible rather than merely less likely to be reproduced remains unresolved. - Open Access
- 21 October 2026
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 8, 1915137
Structurally conditioned counterfactual generation and validation for question answering from scientific text
Introduction: A large language model (LLM)-based pipeline is presented for structured processing of scientific abstracts and for generating paired factual and counterfactual question-answer (QA) instances under document-level intervention constraints. Methods: The implemented system extracts entities, events, and relations; induces a lightweight structural causal model (SCM) over scientific variables such as method, data, intervention, outcome, and metric; generates five factual QA pairs per abstract; rewrites them under one selected intervention; and filters inconsistent counterfactuals. The source export contains 100 Scopus abstracts, of which 67 documents with complete pipeline artifacts form the validation cohort. Generation uses gpt-4.1 , while automated validation uses gpt-5-mini under a 15-criterion checklist; three human annotators independently score the same 67 documents. Results: Human agreement is moderate, with a mean pairwise Cohen's kappa of approximately 0.54. Automated validation is high for original QA and relation-level correctness (0.97 and 0.89) but very low for document-level global consistency (0.07), revealing a substantial gap between local correctness and cross-stage coherence. Under the score-based intervention analysis, 25.4% of documents exhibit a validation decrease above the predefined threshold. Discussion: We refer to this quantity as the intervention degradation rate rather than as bias propagation, because the interventions concern scientific-content variables rather than protected attributes. The study evaluates generation quality, intervention sensitivity, and cross-stage consistency; it does not train a foundation model or claim training-time bias mitigation.
- 21 October 2026
- Published by Frontiers Media SA in Frontiers in Computer Science
- Vol. 8, 1915137
Open AccessStructurally conditioned counterfactual generation and validation for question answering from scientific text
Introduction: A large language model (LLM)-based pipeline is presented for structured processing of scientific abstracts and for generating paired factual and counterfactual question-answer (QA) instances under document-level intervention constraints. Methods: The implemented system extracts entities, events, and relations; induces a lightweight structural causal model (SCM) over scientific variables such as method, data, intervention, outcome, and metric; generates five factual QA pairs per abstract; rewrites them under one selected intervention; and filters inconsistent counterfactuals. The source export contains 100 Scopus abstracts, of which 67 documents with complete pipeline artifacts form the validation cohort. Generation uses gpt-4.1 , while automated validation uses gpt-5-mini under a 15-criterion checklist; three human annotators independently score the same 67 documents. Results: Human agreement is moderate, with a mean pairwise Cohen's kappa of approximately 0.54. Automated validation is high for original QA and relation-level correctness (0.97 and 0.89) but very low for document-level global consistency (0.07), revealing a substantial gap between local correctness and cross-stage coherence. Under the score-based intervention analysis, 25.4% of documents exhibit a validation decrease above the predefined threshold. Discussion: We refer to this quantity as the intervention degradation rate rather than as bias propagation, because the interventions concern scientific-content variables rather than protected attributes. The study evaluates generation quality, intervention sensitivity, and cross-stage consistency; it does not train a foundation model or claim training-time bias mitigation.