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

Amirreza Kazemi

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

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 52% Reinforcement learning · 30% Representation and self-supervised learning · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
causal inference
0.812024
Adversarially Balanced Representation for Continuous Treatment Effect Estimation · AAAI 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation
continuous treatment
0.812024
Adversarially Balanced Representation for Continuous Treatment Effect Estimation · AAAI 2024
Machine learning › Representation and self-supervised learning › representation learning
representation balancing
0.812024
Adversarially Balanced Representation for Continuous Treatment Effect Estimation · AAAI 2024
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal effect estimation
treatment effect estimation
0.812024
Adversarially Balanced Representation for Continuous Treatment Effect Estimation · AAAI 2024
Machine learning › Reinforcement learning
actor-critic methods
0.712023
Decision-Aware Actor-Critic with Function Approximation and Theoretical Guarantees · NeurIPS 2023
Machine learning › Reinforcement learning › policy optimization
policy improvement
0.712023
Decision-Aware Actor-Critic with Function Approximation and Theoretical Guarantees · NeurIPS 2023

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

attention mechanism · 0.8adversarial training · 0.8temporal difference learning · 0.7policy gradient · 0.7function approximation · 0.7
YearPublicationVenuePosition
2024 Adversarially Balanced Representation for Continuous Treatment Effect Estimation
abstract
Individual treatment effect (ITE) estimation requires adjusting for the covariate shift between populations with different treatments, and deep representation learning has shown great promise in learning a balanced representation of covariates. However the existing methods mostly consider the scenario of binary treatments. In this paper, we consider the more practical and challenging scenario in which the treatment is a continuous variable (e.g. dosage of a medication), and we address the two main challenges of this setup. We propose the adversarial counterfactual regression network (ACFR) that adversarially minimizes the representation imbalance in terms of KL divergence, and also maintains the impact of the treatment value on the outcome prediction by leveraging an attention mechanism. Theoretically we demonstrate that ACFR objective function is grounded in an upper bound on counterfactual outcome prediction error. Our experimental evaluation on semi-synthetic datasets demonstrates the empirical superiority of ACFR over a range of state-of-the-art methods.
Amirreza Kazemi, Martin Ester
AAAI1
2023 Decision-Aware Actor-Critic with Function Approximation and Theoretical Guarantees
abstract
Actor-critic (AC) methods are widely used in reinforcement learning (RL), and benefit from the flexibility of using any policy gradient method as the actor and value-based method as the critic. The critic is usually trained by minimizing the TD error, an objective that is potentially decorrelated with the true goal of achieving a high reward with the actor. We address this mismatch by designing a joint objective for training the actor and critic in a decision-aware fashion. We use the proposed objective to design a generic, AC algorithm that can easily handle any function approximation. We explicitly characterize the conditions under which the resulting algorithm guarantees monotonic policy improvement, regardless of the choice of the policy and critic parameterization. Instantiating the generic algorithm results in an actor that involves maximizing a sequence of surrogate functions (similar to TRPO, PPO), and a critic that involves minimizing a closely connected objective. Using simple bandit examples, we provably establish the benefit of the proposed critic objective over the standard squared error. Finally, we empirically demonstrate the benefit of our decision-aware actor-critic framework on simple RL problems.
Sharan Vaswani, Amirreza Kazemi, Reza Babanezhad 0001, Nicolas Le Roux
NeurIPS2
2022 Pan-cancer integrative analysis of whole-genome De novo somatic point mutations reveals 17 cancer types
abstract
BACKGROUND: The advent of high throughput sequencing has enabled researchers to systematically evaluate the genetic variations in cancer, identifying many cancer-associated genes. Although cancers in the same tissue are widely categorized in the same group, they demonstrate many differences concerning their mutational profiles. Hence, there is no definitive treatment for most cancer types. This reveals the importance of developing new pipelines to identify cancer-associated genes accurately and re-classify patients with similar mutational profiles. Classification of cancer patients with similar mutational profiles may help discover subtypes of cancer patients who might benefit from specific treatment types. RESULTS: In this study, we propose a new machine learning pipeline to identify protein-coding genes mutated in many samples to identify cancer subtypes. We apply our pipeline to 12,270 samples collected from the international cancer genome consortium, covering 19 cancer types. As a result, we identify 17 different cancer subtypes. Comprehensive phenotypic and genotypic analysis indicates distinguishable properties, including unique cancer-related signaling pathways. CONCLUSIONS: This new subtyping approach offers a novel opportunity for cancer drug development based on the mutational profile of patients. Additionally, we analyze the mutational signatures for samples in each subtype, which provides important insight into their active molecular mechanisms. Some of the pathways we identified in most subtypes, including the cell cycle and the Axon guidance pathways, are frequently observed in cancer disease. Interestingly, we also identified several mutated genes and different rates of mutation in multiple cancer subtypes. In addition, our study on "gene-motif" suggests the importance of considering both the context of the mutations and mutational processes in identifying cancer-associated genes. The source codes for our proposed clustering pipeline and analysis are publicly available at: https://github.com/bcb-sut/Pan-Cancer .
Amin Ghareyazi, Amirreza Kazemi, Kimia Hamidieh, Hamed Dashti, Maedeh-sadat Tahaei, Hamid R. Rabiee 0001, Hamid Alinejad-Rokny, Iman Dehzangi
BMC Bioinform.2