Demo Data from EDBT 2026 / reviewers in the wild / expert
Sina Sharifi
dblp:332/1847
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0003-2681-2907ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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.
| Artificial intelligence
3 papers |
Trustworthy machine learning · 52% Deep learning architectures and training · 40% Motion planning and robot control · 4% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 50% Emerging computing paradigms · 50% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.8 | 1 | 2024 | Compositional Curvature Bounds for Deep Neural Networks · ICML 2024 |
Machine learning › Trustworthy machine learning › robustness
certified robustness |
0.8 | 1 | 2024 | Compositional Curvature Bounds for Deep Neural Networks · ICML 2024 |
Machine learning › Deep learning architectures and training › regularization
curvature regularization |
0.8 | 1 | 2024 | Compositional Curvature Bounds for Deep Neural Networks · ICML 2024 |
Machine learning › Deep learning architectures and training › regularization
neural network regularization |
0.8 | 1 | 2024 | Compositional Curvature Bounds for Deep Neural Networks · ICML 2024 |
Machine learning › Trustworthy machine learning › robustness
out-of-distribution detection |
0.8 | 1 | 2024 | Gradient-Regularized Out-of-Distribution Detection · ECCV (13) 2024 |
Electronic design automation › hardware verification and test › formal verification
reachability analysis |
0.7 | 1 | 2023 | ReachLipBnB: A branch-and-bound method for reachability analysis of neural autonomous systems using Lipschitz bounds · ICRA 2023 |
Machine learning › Deep learning architectures and training
regularization |
0.2 | 1 | 2024 | Gradient-Regularized Out-of-Distribution Detection · ECCV (13) 2024 |
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › intelligent control
neural network control |
0.2 | 1 | 2023 | ReachLipBnB: A branch-and-bound method for reachability analysis of neural autonomous systems using Lipschitz bounds · ICRA 2023 |
Robotics › Motion planning and robot control
robot control |
0.2 | 1 | 2023 | ReachLipBnB: A branch-and-bound method for reachability analysis of neural autonomous systems using Lipschitz bounds · ICRA 2023 |
Methods — techniques the papers use, named apart from their topics
principal component analysis · 1.3convex optimization · 1.3branch-and-bound · 1.3gradient regularization · 0.8differentiable regularizer · 0.8compositional curvature bound propagation · 0.8lipschitz bounds · 0.7lipschitz bound · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Gradient-Regularized Out-of-Distribution Detection
Sina Sharifi, Taha Entesari, Bardia Safaei 0002, Vishal M. Patel, Mahyar Fazlyab |
ECCV (13) | 1 |
| 2024 | Compositional Curvature Bounds for Deep Neural NetworksabstractA key challenge that threatens the widespread use of neural networks in safety-critical applications is their vulnerability to adversarial attacks. In this paper, we study the second-order behavior of continuously differentiable deep neural networks, focusing on robustness against adversarial perturbations. First, we provide a theoretical analysis of robustness and attack certificates for deep classifiers by leveraging local gradients and upper bounds on the second derivative (curvature constant). Next, we introduce a novel algorithm to analytically compute provable upper bounds on the second derivative of neural networks. This algorithm leverages the compositional structure of the model to propagate the curvature bound layer-by-layer, giving rise to a scalable and modular approach. The proposed bound can serve as a differentiable regularizer to control the curvature of neural networks during training, thereby enhancing robustness. Finally, we demonstrate the efficacy of our method on classification tasks using the MNIST and CIFAR-10 datasets. Taha Entesari, Sina Sharifi, Mahyar Fazlyab |
ICML | 2 |
| 2023 | ReachLipBnB: A branch-and-bound method for reachability analysis of neural autonomous systems using Lipschitz boundsabstractWe propose a novel Branch-and-Bound method for reachability analysis of neural networks in both open-loop and closed-loop settings. Our idea is to first compute accurate bounds on the Lipschitz constant of the neural network in certain directions of interest offline using a convex program. We then use these bounds to obtain an instantaneous but conservative polyhedral approximation of the reachable set using Lipschitz continuity arguments. To reduce conservatism, we incorporate our bounding algorithm within a branching strategy to decrease the over-approximation error within an arbitrary accuracy. We then extend our method to reachability analysis of control systems with neural network controllers. Finally, to capture the shape of the reachable sets as accurately as possible, we use sample trajectories to inform the directions of the reachable set over-approximations using Principal Com-ponent Analysis (PCA). We evaluate the performance of the proposed method in several open-loop and closed-loop settings. Taha Entesari, Sina Sharifi, Mahyar Fazlyab |
ICRA | 2 |