Seminars | Centre for Networked Intelligence

Networks Seminar Series

Networks Seminar, supported by the Centre for Networked Intelligence, is a technical discussion forum in topics including but not limited to computer networks, machine learning, signal processing, and information theory. The seminar series receives an audience from faculty and students in the EECS division, RBCCPS, and engineering professionals working in related fields.

Add Series Calendar

Join Google Group

# 224

An overview of entropy-regularized optimal transport and Schrödinger bridges

Dec 10, 2024

An overview of entropy-regularized optimal transport and Schrödinger bridges

Consensus in the weighted voter model with noise-free and noisy observations

Dynamic networks and stochastic approximation: the fundamental role of mathematics

Efficient Repair of Reed-Solomon Codes and Tamo-Barg Codes

Interventional Causal Representation Learning

Design and Analysis of Low Complexity Techniques for IRS-Aided Wireless Communications

Need for Speed: Minimizing the impact of Bufferbloat

Differentially Private Release of Spatio-Temporal Data Statistics

Understanding Performance of Internet Video using Network Measurement Data

Efficiently Serving Large Language Models

Load Balancing under Data Locality: Extending Mean-Field Framework to Constrained Large-Scale Systems.

EdgeRIC: Empowering AI-based Real Time Intelligent Control, Optimization and Security in NextG Networks

Risk-Sensitive Bandits: Arm Mixtures Optimality and Regret-Efficient Algorithms

Flipped Huber: A new additive noise mechanism for differential privacy

Locality Sensitive Hashing in Fourier Frequency Domain for Soft Set Containment Search

Schema Generation for Querying a Data Lakehouse

Low Complexity Optimal Policies for Networked Control Systems

Sample-Efficient Constrained Reinforcement Learning with General Parameterized Policies

Markov Chain Variance Estimation: A Stochastic Approximation Approach

Codes for (Un)Expected Loads

Random Separating Hyperplane Theorem and Learning Polytopes

Online Learning for Hierarchical Inference

Leveraging WiFi for Robust and Resource-Efficient SLAM

Learning in the Presence of Strategy

A Designing Robust Algorithms for Data Streams that Might be Adversarially Generated

Average Reward Markov Decision Process

Binomial Line Cox Processes – Modeling Streets Across a City

Discrimination, A One bit Sampling Perspective

Towards Optimizing Storage Costs on the Cloud

Guaranteed performance analysis of networks with bandwidth-sharing schedulers

Need for Sovereign Compute

The Capacity of Causal Adversarial Channels

Adaptive Multi-armed Bandit Algorithms for Markovian and i.i.d Rewards

Towards an Open Mobile Networking Ecosystem

Tight Bounds for General Computation in Noisy Broadcast Networks

Quickest Fault Detection over Lossy Networks for Industrial Machinery

Large-Scale Study of User Behaviour, Expectations and Engagement with Android Permissions

Streaming Codes for Three-Node Relay Networks With Burst Erasures

Between Promise and Reality: Navigating the Landscape of Indic Language LLMs Amidst Hyperbole and Hope

Provably Robust DPO: Aligning Language Models with Noisy Feedback

A decentralised algorithm for minimizing multi-agent congestion cost on a network

Online Age-of-Information Scheduling

Power Allocation for Generalized Gaussian MAC

Min LQG games and collective discrete choice problems

Learning while bidding in Vickrey Auctions with acquisition rate and targeting constraints

Trade-offs between Security and Privacy in Linear Dynamical Systems

Cracking Software Engineering interview for fresh grads

TTL Model for an LRU-Based Similarity Caching Policy

PhD Research: Elements of Excellence