Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Shima Adeli

dblp:396/8688 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Medical and health informatics
radiation therapy planning
0.812024
Randomized Sparse Matrix Compression for Large-Scale Constrained Optimization in Cancer Radiotherapy · NeurIPS 2024
Mathematical optimization
constrained optimization
0.812024
Randomized Sparse Matrix Compression for Large-Scale Constrained Optimization in Cancer Radiotherapy · NeurIPS 2024
Mathematical optimization
large-scale optimization
0.812024
Randomized Sparse Matrix Compression for Large-Scale Constrained Optimization in Cancer Radiotherapy · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

sparse matrix compression · 1.5randomized sketching · 1.5
YearPublicationVenuePosition
2024 Randomized Sparse Matrix Compression for Large-Scale Constrained Optimization in Cancer Radiotherapy
abstract
Radiation therapy, treating over half of all cancer patients, involves using specialized machines to direct high-energy beams at tumors, aiming to damage cancer cells while minimizing harm to nearby healthy tissues. Customizing the shape and intensity of radiation beams for each patient leads to solving large-scale constrained optimization problems that need to be solved within tight clinical time-frame. At the core of these challenges is a large matrix that is commonly sparsified for computational efficiency by neglecting small elements. Such a crude approximation can degrade the quality of treatment, potentially causing unnecessary radiation exposure to healthy tissues—this may lead to significant radiation-induced side effects—or delivering inadequate radiation to the tumor, which is crucial for effective tumor treatment. In this work, we demonstrate, for the first time, that randomized sketch tools can effectively sparsify this matrix without sacrificing treatment quality. We also develop a novel randomized sketch method with desirable theoretical guarantees that outperforms existing techniques in practical application. Beyond developing a novel randomized sketch method, this work emphasizes the potential of harnessing scientific computing tools, crucial in today's big data analysis, to tackle computationally intensive challenges in healthcare. The application of these tools could have a profound impact on the lives of numerous cancer patients. Code and sample data available at https://github.com/PortPy-Project/CompressRTP
Shima Adeli, Mojtaba Tefagh, Gourav Jhanwar, Masoud Zarepisheh
NeurIPS1