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

Atul Kumar Sinha

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

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Computer networks · 1 · 1 first-authorGraphics, 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.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Artificial intelligence
1 paper

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

TopicWeightPapersLastEvidence papers
Computational science and engineering
high energy physics
0.712023
SUPA: A Lightweight Diagnostic Simulator for Machine Learning in Particle Physics · NeurIPS 2023

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

point cloud representation · 1.3geometric machine learning · 1.3
YearPublicationVenuePosition
2024 DeepEMD: A Transformer-Based Fast Estimation of the Earth Mover's Distance
Atul Kumar Sinha, François Fleuret
ICPR (4)1
2023 SUPA: A Lightweight Diagnostic Simulator for Machine Learning in Particle Physics
abstract
Deep learning methods have gained popularity in high energy physics for fast modeling of particle showers in detectors. Detailed simulation frameworks such as the gold standard \textsc{Geant4} are computationally intensive, and current deep generative architectures work on discretized, lower resolution versions of the detailed simulation. The development of models that work at higher spatial resolutions is currently hindered by the complexity of the full simulation data, and by the lack of simpler, more interpretable benchmarks. Our contribution is \textsc{SUPA}, the SUrrogate PArticle propagation simulator, an algorithm and software package for generating data by simulating simplified particle propagation, scattering and shower development in matter. The generation is extremely fast and easy to use compared to \textsc{Geant4}, but still exhibits the key characteristics and challenges of the detailed simulation. The proposed simulator generates thousands of particle showers per second on a desktop machine, a speed up of up to 6 orders of magnitudes over \textsc{Geant4}, and stores detailed geometric information about the shower propagation. \textsc{\textsc{SUPA}} provides much greater flexibility for setting initial conditions and defining multiple benchmarks for the development of models. Moreover, interpreting particle showers as point clouds creates a connection to geometric machine learning and provides challenging and fundamentally new datasets for the field.
Atul Kumar Sinha, Daniele Paliotta, Bálint Máté, John A. Raine, Tobias Golling, François Fleuret
NeurIPS1
2016 Low complexity opportunistic interference alignment in K-transmitter MIMO interference channels
abstract
In this paper, we propose low complexity opportunistic methods for interference alignment in K-transmitter MIMO interference channels by exploiting multiuser diversity. We do not assume availability of channel state information (CSI) at the transmitters. Receivers are required to feed back analog values indicating the extent to which the received interference subspaces are aligned. The proposed opportunistic interference alignment (OIA) achieves sum-rate comparable to conventional OIA schemes but with a significantly reduced computational complexity.
Atul Kumar Sinha
WCNC1