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.

Apurv Gupta

dblp:95/11259 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1

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.

Network and information security
1 paper
Security and privacy of machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 44% Information retrieval · 44% Database system architecture and tuning · 13%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

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

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning
adversarial example
0.712023
Batchnorm Allows Unsupervised Radial Attacks · NeurIPS 2023
Information retrieval › web search
data freshness
0.212016
Shasta: Interactive Reporting At Scale · SIGMOD Conference 2016
Query processing and optimization
online query processing
0.212016
Shasta: Interactive Reporting At Scale · SIGMOD Conference 2016
Machine learning › Deep learning architectures and training › normalization
batch normalization
0.212023
Batchnorm Allows Unsupervised Radial Attacks · NeurIPS 2023

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

intermediate latent attack · 1.3angular deviation loss · 1.3query transformation · 0.2join processing over many tables · 0.2
YearPublicationVenuePosition
2023 Batchnorm Allows Unsupervised Radial Attacks
abstract
The construction of adversarial examples usually requires the existence of soft or hard labels for each instance, with respect to which a loss gradient provides the signal for construction of the example. We show that for batch normalized deep image recognition architectures, intermediate latents that are produced after a batch normalization step by themselves suffice to produce adversarial examples using an intermediate loss solely utilizing angular deviations, without relying on any label. We motivate our loss through the geometry of batch normed representations and their concentration of norm on a hypersphere and distributional proximity to Gaussians. Our losses expand intermediate latent based attacks that usually require labels. The success of our method implies that leakage of intermediate representations may create a security breach for deployed models, which persists even when the model is transferred to downstream usage. Removal of batch norm weakens our attack, indicating it contributes to this vulnerability. Our attacks also succeed against LayerNorm empirically, thus being relevant for transformer architectures, most notably vision transformers which we analyze.
Amur Ghose, Apurv Gupta, Yaoliang Yu, Pascal Poupart
NeurIPS2
2016 Shasta: Interactive Reporting At Scale
abstract
We describe Shasta, a middleware system built at Google to support interactive reporting in complex user-facing applications related to Google's Internet advertising business. Shasta targets applications with challenging requirements: First, user query latencies must be low. Second, underlying transactional data stores have complex "read-unfriendly" schemas, placing significant transformation logic between stored data and the read-only views that Shasta exposes to its clients. This transformation logic must be expressed in a way that scales to large and agile engineering teams. Finally, Shasta targets applications with strong data freshness requirements, making it challenging to precompute query results using common techniques such as ETL pipelines or materialized views. Instead, online queries must go all the way from primary storage to user-facing views, resulting in complex queries joining 50 or more tables.
Gokul Nath Babu Manoharan, Stephan Ellner, Karl Schnaitter, Sridatta Chegu, Alejandro Estrella-Balderrama, Stephan Gudmundson, Apurv Gupta, Ben Handy, Bart Samwel, Chad Whipkey, Larysa Aharkava, Himani Apte, Nitin Gangahar, Shivakumar Venkataraman, Divyakant Agrawal, Jeffrey D. Ullman
SIGMOD Conference7