Deep Ganguli

dblp:67/10451 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
1since 2021 · last 2024
0009-0007-9435-3817ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 2 first-author · 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%
Artificial intelligence
1 paper
Language models and text generation · 100%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 61% Indexing and storage engines · 30% Query processing and optimization · 9%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Information theory · 50% Coding theory · 50%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
large language model safety
0.812024
Many-shot Jailbreaking · NeurIPS 2024
Security and privacy of machine learning
adversarial attack
0.812024
Many-shot Jailbreaking · NeurIPS 2024
Security and privacy of machine learning › adversarial attack
jailbreak attack
0.812024
Many-shot Jailbreaking · NeurIPS 2024
Security and privacy of machine learning
prompt injection
0.212024
Many-shot Jailbreaking · NeurIPS 2024
Indexing and storage engines
column store
0.212014
Druid: a real-time analytical data store · SIGMOD Conference 2014
Database system architecture and tuning › parallel database system
shared-nothing architecture
0.212014
Druid: a real-time analytical data store · SIGMOD Conference 2014
Bioinformatics and computational biology
computational neuroscience
0.112010
Implicit encoding of prior probabilities in optimal neural populations · NIPS 2010
Bioinformatics and computational biology › computational neuroscience › neural coding
neural population coding
0.112010
Implicit encoding of prior probabilities in optimal neural populations · NIPS 2010
Information theory › information measures
fisher information
0.112010
Implicit encoding of prior probabilities in optimal neural populations · NIPS 2010
Coding theory › source coding
optimal coding
0.112010
Implicit encoding of prior probabilities in optimal neural populations · NIPS 2010

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

long-context prompting · 1.5in-context learning · 1.5tuning curve analysis · 0.2poisson process modeling · 0.2advanced indexing structure · 0.2
YearPublicationVenuePosition
2024 Many-shot Jailbreaking
abstract
We investigate a family of simple long-context attacks on large language models: prompting with hundreds of demonstrations of undesirable behavior. This attack is newly feasible with the larger context windows recently deployed by language model providers like Google DeepMind, OpenAI and Anthropic. We find that in diverse, realistic circumstances, the effectiveness of this attack follows a power law, up to hundreds of shots. We demonstrate the success of this attack on the most widely used state-of-the-art closed-weight models, and across various tasks. Our results suggest very long contexts present a rich new attack surface for LLMs.
Cem Anil, Esin Durmus, Nina Panickssery, Mrinank Sharma, Joe Benton, Sandipan Kundu, Joshua Batson, Meg Tong, Jesse Mu, Daniel Ford, Francesco Mosconi, Rajashree Agrawal, Rylan Schaeffer, Naomi Bashkansky, Samuel Svenningsen, Mike Lambert, Ansh Radhakrishnan, Carson Denison, Evan Hubinger, Yuntao Bai, Trenton Bricken, Timothy Maxwell, Nicholas Schiefer, James Sully, Alex Tamkin, Tamera Lanham, Karina Nguyen, Tomek Korbak, Jared Kaplan, Deep Ganguli, Samuel R. Bowman, Ethan Perez, Roger B. Grosse, David Duvenaud
NeurIPS30
2014 Druid: a real-time analytical data store
abstract
Druid is an open source data store designed for real-time exploratory analytics on large data sets. The system combines a column-oriented storage layout, a distributed, shared-nothing architecture, and an advanced indexing structure to allow for the arbitrary exploration of billion-row tables with sub-second latencies. In this paper, we describe Druid's architecture, and detail how it supports fast aggregations, flexible filters, and low latency data ingestion.
Fangjin Yang, Eric Tschetter, Xavier Léauté, Nelson Ray, Gian Merlino, Deep Ganguli
SIGMOD Conference6
2014 Efficient Sensory Encoding and Bayesian Inference with Heterogeneous Neural Populations
abstract
The efficient coding hypothesis posits that sensory systems maximize information transmitted to the brain about the environment. We develop a precise and testable form of this hypothesis in the context of encoding a sensory variable with a population of noisy neurons, each characterized by a tuning curve. We parameterize the population with two continuous functions that control the density and amplitude of the tuning curves, assuming that the tuning widths vary inversely with the cell density. This parameterization allows us to solve, in closed form, for the information-maximizing allocation of tuning curves as a function of the prior probability distribution of sensory variables. For the optimal population, the cell density is proportional to the prior, such that more cells with narrower tuning are allocated to encode higher-probability stimuli and that each cell transmits an equal portion of the stimulus probability mass. We also compute the stimulus discrimination capabilities of a perceptual system that relies on this neural representation and find that the best achievable discrimination thresholds are inversely proportional to the sensory prior. We examine how the prior information that is implicitly encoded in the tuning curves of the optimal population may be used for perceptual inference and derive a novel decoder, the Bayesian population vector, that closely approximates a Bayesian least-squares estimator that has explicit access to the prior. Finally, we generalize these results to sigmoidal tuning curves, correlated neural variability, and a broader class of objective functions. These results provide a principled embedding of sensory prior information in neural populations and yield predictions that are readily testable with environmental, physiological, and perceptual data.
Deep Ganguli, Eero P. Simoncelli
Neural Comput.1
2010 Implicit encoding of prior probabilities in optimal neural populations
abstract
Optimal coding provides a guiding principle for understanding the representation of sensory variables in neural populations. Here we consider the influence of a prior probability distribution over sensory variables on the optimal allocation of cells and spikes in a neural population. We model the spikes of each cell as samples from an independent Poisson process with rate governed by an associated tuning curve. For this response model, we approximate the Fisher information in terms of the density and amplitude of the tuning curves, under the assumption that tuning width varies inversely with cell density. We consider a family of objective functions based on the expected value, over the sensory prior, of a functional of the Fisher information. This family includes lower bounds on mutual information and perceptual discriminability as special cases. In all cases, we find a closed form expression for the optimum, in which the density and gain of the cells in the population are power law functions of the stimulus prior. This also implies a power law relationship between the prior and perceptual discriminability. We show preliminary evidence that the theory successfully predicts the relationship between empirically measured stimulus priors, physiologically measured neural response properties (cell density, tuning widths, and firing rates), and psychophysically measured discrimination thresholds.
Deep Ganguli, Eero P. Simoncelli
NIPS1