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

Lokesh Boominathan

dblp:185/0757 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author

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.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 44% Graph learning · 30% Image recognition and object detection · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning › graph neural network
message passing
0.612022
Phase transitions in when feedback is useful · NeurIPS 2022
Machine learning › Probabilistic and Bayesian machine learning
statistical inference
0.612022
Phase transitions in when feedback is useful · NeurIPS 2022
Bioinformatics and computational biology
computational neuroscience
0.612022
Phase transitions in when feedback is useful · NeurIPS 2022
Bioinformatics and computational biology › computational neuroscience › neural coding
efficient coding
0.612022
Phase transitions in when feedback is useful · NeurIPS 2022
Bioinformatics and computational biology › computational neuroscience › neural coding
predictive coding
0.612022
Phase transitions in when feedback is useful · NeurIPS 2022
Computer vision › Image recognition and object detection › object counting
crowd counting
0.212016
CrowdNet: A Deep Convolutional Network for Dense Crowd Counting · ACM Multimedia 2016
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation
0.212016
CrowdNet: A Deep Convolutional Network for Dense Crowd Counting · ACM Multimedia 2016
Robotics › Motion planning and robot control › robot control
feedback control
0.212022
Phase transitions in when feedback is useful · NeurIPS 2022
Machine learning › Deep learning architectures and training › convolutional neural network › convolutional neural network architecture
fully convolutional network
0.112016
CrowdNet: A Deep Convolutional Network for Dense Crowd Counting · ACM Multimedia 2016

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

message passing · 1.1control theory · 1.1multi-scale data augmentation · 0.2deep and shallow network combination · 0.2
YearPublicationVenuePosition
2022 Phase transitions in when feedback is useful
abstract
Sensory observations about the world are invariably ambiguous. Inference about the world's latent variables is thus an important computation for the brain. However, computational constraints limit the performance of these computations. These constraints include energetic costs for neural activity and noise on every channel. Efficient coding is one prominent theory that describes how such limited resources can best be used. In one incarnation, this leads to a theory of predictive coding, where predictions are subtracted from signals, reducing the cost of sending something that is already known. This theory does not, however, account for the costs or noise associated with those predictions. Here we offer a theory that accounts for both feedforward and feedback costs, and noise in all computations. We formulate this inference problem as message-passing on a graph whereby feedback serves as an internal control signal aiming to maximize how well an inference tracks a target state while minimizing the costs of computation. We apply this novel formulation of inference as control to the canonical problem of inferring the hidden scalar state of a linear dynamical system with Gaussian variability. The best solution depends on architectural constraints, such as Dale's law, the ubiquitous law that each neuron makes solely excitatory or inhibitory postsynaptic connections. This biological structure can create asymmetric costs for feedforward and feedback channels. Under such conditions, our theory predicts the gain of optimal predictive feedback and how it is incorporated into the inference computation. We show that there is a non-monotonic dependence of optimal feedback gain as a function of both the computational parameters and the world dynamics, leading to phase transitions in whether feedback provides any utility in optimal inference under computational constraints.
Lokesh Boominathan, Xaq Pitkow
NeurIPS1
2018 Phase retrieval for Fourier Ptychography under varying amount of measurements
Lokesh Boominathan, Mayug Maniparambil, Honey Gupta, Rahul Baburajan, Kaushik Mitra
BMVC1
2016 CrowdNet: A Deep Convolutional Network for Dense Crowd Counting
abstract
Our work proposes a novel deep learning framework for estimating crowd density from static images of highly dense crowds. We use a combination of deep and shallow, fully convolutional networks to predict the density map for a given crowd image. Such a combination is used for effectively capturing both the high-level semantic information (face/body detectors) and the low-level features (blob detectors), that are necessary for crowd counting under large scale variations. As most crowd datasets have limited training samples (<100 images) and deep learning based approaches require large amounts of training data, we perform multi-scale data augmentation. Augmenting the training samples in such a manner helps in guiding the CNN to learn scale invariant representations. Our method is tested on the challenging UCF_CC_50 dataset, and shown to outperform the state of the art methods.
Lokesh Boominathan, Srinivas S. Kruthiventi, Venkatesh Babu Radhakrishnan
ACM Multimedia1