Suresh Venkatasubramanian

ORCID: 0000-0001-7679-7130
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Data Management and Algorithms
  • Computational Geometry and Mesh Generation
  • Ethics and Social Impacts of AI
  • Explainable Artificial Intelligence (XAI)
  • Algorithms and Data Compression
  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Privacy-Preserving Technologies in Data
  • Advanced Database Systems and Queries
  • Advanced Clustering Algorithms Research
  • Cryptography and Data Security
  • Complex Network Analysis Techniques
  • Advanced Image and Video Retrieval Techniques
  • Data Stream Mining Techniques
  • Machine Learning and Data Classification
  • Stochastic Gradient Optimization Techniques
  • Adversarial Robustness in Machine Learning
  • Sparse and Compressive Sensing Techniques
  • Face and Expression Recognition
  • Neural Networks and Applications
  • Computer Graphics and Visualization Techniques
  • Energy Efficient Wireless Sensor Networks
  • Data Visualization and Analytics
  • Advanced Graph Theory Research
  • Domain Adaptation and Few-Shot Learning

Brown University
2022-2024

John Brown University
2022-2023

Annamalai University
2022

University of Utah
2012-2021

Ericsson (Sweden)
2020

National Institute of Epidemiology
2018

Sri Ramachandra Medical Centre
2017

Anna University, Chennai
2014

College of Applied Sciences, Nizwa
2009-2012

Indian Institute of Science Bangalore
2011

The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records are indistinguishable from other with respect to certain "identifying" attributes) contains at least k records. Recently, several authors have recognized cannot prevent attribute disclosure. notion l-diversity has been proposed address this; l well-represented values sensitive attribute. In this paper we show number limitations. particular, it is neither necessary nor...

10.1109/icde.2007.367856 article EN 2007-04-01

What does it mean for an algorithm to be biased? In U.S. law, unintentional bias is encoded via disparate impact, which occurs when a selection process has widely different outcomes groups, even as appears neutral. This legal determination hinges on definition of protected class (ethnicity, gender) and explicit description the process.

10.1145/2783258.2783311 article EN 2015-08-07

A key goal of the fair-ML community is to develop machine-learning based systems that, once introduced into a social context, can achieve and legal outcomes such as fairness, justice, due process. Bedrock concepts in computer science---such abstraction modular design---are used define notions fairness discrimination, produce fairness-aware learning algorithms, intervene at different stages decision-making pipeline "fair" outcomes. In this paper, however, we contend that these render...

10.1145/3287560.3287598 article EN 2019-01-09

Computers are increasingly used to make decisions that have significant impact on people's lives. Often, these predictions can affect different population subgroups disproportionately. As a result, the issue of fairness has received much recent interest, and number fairness-enhanced classifiers appeared in literature. This paper seeks study following questions: how do techniques fundamentally compare one another, what accounts for differences? Specifically, we seek bring attention many...

10.1145/3287560.3287589 article EN 2019-01-09

What does it mean for an algorithm to be fair? Different papers use different notions of algorithmic fairness, and although these appear internally consistent, they also seem mutually incompatible. We present a mathematical setting in which the distinctions previous can made formal. In addition characterizing spaces inputs (the "observed" space) outputs "decision" space), we introduce notion construct space: space that captures unobservable, but meaningful variables prediction. show order...

10.48550/arxiv.1609.07236 preprint EN other-oa arXiv (Cornell University) 2016-01-01

What does it mean to be fair?

10.1145/3433949 article EN Communications of the ACM 2021-03-22

The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records are indistinguishable from other with respect to certain "identifying" attributes) contains at least k records. Recently, several authors have recognized cannot prevent attribute disclosure. notion ℓ-diversity has been proposed address this; ℓ well-represented (in Section 2) values sensitive attribute. In this paper, we show number limitations. particular, it is neither...

10.1109/tkde.2009.139 article EN IEEE Transactions on Knowledge and Data Engineering 2009-06-16

RF sensor networks are wireless that can localize and track people (or targets) without needing them to carry or wear any electronic device. They use the change in received signal strength (RSS) of links due movements infer their locations. In this paper, we consider real-time multiple target tracking with networks. We apply radio tomographic imaging (RTI), which generates images propagation field, as if they were frames a video. Our RTI method uses RSS measurements on frequency channels...

10.1109/tmc.2013.92 article EN IEEE Transactions on Mobile Computing 2013-07-25

Network radio frequency (RF) environment sensing (NRES) systems pinpoint and track people in buildings using changes the signal strength measurements made by a wireless sensor network. It has been shown that such can locate who do not participate system wearing any device, even through walls, because of moving cause to static However, many cannot stationary people. We present evaluate which or people, without calibration, kernel distance quantify difference between two histograms...

10.1145/2461381.2461410 article EN 2013-04-08

Predictive policing systems are increasingly used to determine how allocate police across a city in order best prevent crime. Discovered crime data (e.g., arrest counts) help update the model, and process is repeated. Such have been empirically shown be susceptible runaway feedback loops, where repeatedly sent back same neighborhoods regardless of true rate. In response, we develop mathematical model predictive that proves why this loop occurs, show exhibits such problems, demonstrate change...

10.48550/arxiv.1706.09847 preprint EN other-oa arXiv (Cornell University) 2017-01-01

Philosophers have established that certain ethically important values are modally robust in the sense they systematically deliver correlative benefits across a range of counterfactual scenarios. In this paper, we contend recourse - systematic process reversing unfavorable decisions by algorithms and bureaucracies scenarios is such good. particular, argue two essential components good life temporally extended agency trust underwritten recourse.

10.1145/3351095.3372876 article EN 2020-01-27

Game-theoretic formulations of feature importance have become popular as a way to "explain" machine learning models. These methods define cooperative game between the features model and distribute influence among these input elements using some form game's unique Shapley values. Justification for rests on two pillars: their desirable mathematical properties, applicability specific motivations explanations. We show that problems arise when values are used solutions mitigate necessarily induce...

10.48550/arxiv.2002.11097 preprint EN other-oa arXiv (Cornell University) 2020-01-01

In most algorithmic applications which compare two distributions, information theoretic distances are more natural than standard lp norms. this paper we design streaming and sublinear time property testing algorithms for entropy various distances.Batu et al posed the problem of with respect to Jensen-Shannon distance. We present optimal estimating bounded, symmetric f-divergences (including divergence Hellinger distance) between distributions in frameworks. Along way, close a (log n)/H gap...

10.5555/1109557.1109637 article EN 2006-01-22

The geometric median is a classic robust estimator of centrality for data in Euclidean spaces. In this paper we formulate the on Riemannian manifold as minimizer sum geodesic distances to points. We prove existence and uniqueness manifolds with non-positive sectional curvature give sufficient conditions positively curved manifolds. Generalizing Weiszfeld procedure finding data, present an algorithm computing arbitrary manifold. show that converges unique solution when it exists. This method...

10.1109/cvpr.2008.4587747 article EN 2009 IEEE Conference on Computer Vision and Pattern Recognition 2008-06-01
Coming Soon ...