← Search

Charu Sharma

7 accepted papers

2026

LORETTA: A Low Resource Framework to Poison Continuous Time Dynamic Graphs

AAAI 2026technical

Temporal Graph Neural Networks (TGNNs) are increasingly used in high-stakes domains, such as financial forecasting, recommendation systems, and fraud detection. However, their susceptibility to poisoning attacks poses a critical security risk. We introduce LoReTTA (Low Resource Two-phase Temporal At

Cited by 0SourcePDFScholar
2026

SymGS: Leveraging Reflective Symmetries for 3DGS Compression

AAAI 2026technical

3D Gaussian Splatting has emerged as a transformative technique in novel view synthesis, primarily due to its high rendering speed and photorealistic fidelity. However, its memory footprint scales rapidly with scene complexity, often reaching several gigabytes. Existing methods address this issue by

Cited by 0SourcePDFScholar
2025

Higher Order Structures for Graph Explanations

AAAI 2025technical

Graph Neural Networks (GNNs) have emerged as powerful tools for learning representations of graph-structured data, demonstrating remarkable performance across various tasks. Recognizing their importance, there has been extensive research focused on explaining GNN predictions, aiming to enhance their…

Cited by 0SourcePDFScholar
2022

An Unsupervised, Geometric and Syntax-aware Quantification of Polysemy

EMNLP 2022main

Polysemy is the phenomenon where a single word form possesses two or more related senses. It is an extremely ubiquitous part of natural language and analyzing it has sparked rich discussions in the linguistics, psychology and philosophy communities alike. With scarce attention paid to polysemy in co…

Cited by 4SourcePDFScholar
2020

Simplicial Complex based Point Correspondence between Images warped onto Manifolds

ECCV 2020poster

Recent increase in the availability of warped images projected onto a manifold (e.g., omnidirectional spherical images), coupled with the success of higher-order assignment methods, has sparked an interest in the search for improved higher-order matching algorithms on warped images due to projection…

2018

Solving Partial Assignment Problems using Random Clique Complexes

ICML 2018oral

We present an alternate formulation of the partial assignment problem as matching random clique complexes, that are higher-order analogues of random graphs, designed to provide a set of invariants that better detect higher-order structure. The proposed method creates random clique adjacency matrices…