Канал: CSAChannel IISc

Interplay of submodularity and randomness, by Arjun Ramachandra

Interplay of submodularity and randomness, by Arjun Ramachandra

Ticketed Learning-Unlearning Schemes by Ayush Sekhari (MIT, Boston)

Ticketed Learning-Unlearning Schemes by Ayush Sekhari (MIT, Boston)

Distinct Elements in Streams and the Klee's Measure Problem by Sourav Chakraborty (ISI Kolkata)

Distinct Elements in Streams and the Klee's Measure Problem by Sourav Chakraborty (ISI Kolkata)

Fourier Growth for Communication Protocols for XOR functions, by Uma Girish

Fourier Growth for Communication Protocols for XOR functions, by Uma Girish

Optimal PAC Bounds without Uniform Convergence, by Abhishek Shetty

Optimal PAC Bounds without Uniform Convergence, by Abhishek Shetty

The Rate of Interactive Codes Is Bounded Away from 1, by Raghuvansh Saxena

The Rate of Interactive Codes Is Bounded Away from 1, by Raghuvansh Saxena

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains

List decoding and Higher Order MDS codes, by Manik Dhar

List decoding and Higher Order MDS codes, by Manik Dhar

On MAP Inference of Ferromagnetic Potts models and Nonsymmetric Determinantal Point Processes

On MAP Inference of Ferromagnetic Potts models and Nonsymmetric Determinantal Point Processes

Topological Structures and Operators for Bivariate Data Visualization by Mohit Sharma

Topological Structures and Operators for Bivariate Data Visualization by Mohit Sharma

Exploring Fairness and Causality in Online Decision-Making by Vishakha Patil

Exploring Fairness and Causality in Online Decision-Making by Vishakha Patil

PAC Bounds and Intractability for Learning from Label Proportions, by Rishi Saket

PAC Bounds and Intractability for Learning from Label Proportions, by Rishi Saket

Optimized Distribution of Quantum Circuits by Ranjani Sundaram (Stony Brook University)

Optimized Distribution of Quantum Circuits by Ranjani Sundaram (Stony Brook University)

Offline Data Enhanced On-Policy Policy Gradient by Ayush Sekhari (MIT, Boston)

Offline Data Enhanced On-Policy Policy Gradient by Ayush Sekhari (MIT, Boston)

Tensor field visualization - Simple visualizations for complex data? by Prof Ingrid Hotz

Tensor field visualization - Simple visualizations for complex data? by Prof Ingrid Hotz

"Ask Me Anything" events about programs at CSA Department, IISc - March 6th 2024

"Ask Me Anything" events about programs at CSA Department, IISc - March 6th 2024

"Ask Me Anything" events about programs at CSA Department, IISc - March 4th 2024

"Ask Me Anything" events about programs at CSA Department, IISc - March 4th 2024

Attack of the Killer Microseconds by Dr. Thomas F. Wenisch Director, Google, Mountain View

Attack of the Killer Microseconds by Dr. Thomas F. Wenisch Director, Google, Mountain View

Title: Robust Reinforcement Learning using Offline Data by Kishan Panaganti (Caltech)

Title: Robust Reinforcement Learning using Offline Data by Kishan Panaganti (Caltech)

Optimized Distribution of Quantum Circuits by Ranjani Sundaram (Stony Brook University)

Optimized Distribution of Quantum Circuits by Ranjani Sundaram (Stony Brook University)

Reinforcement Learning : Recent Trends and Future Challenges - 28th Morning Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 28th Morning Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 28th Morning Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 28th Morning Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 27th Afternoon Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 27th Afternoon Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 27th Afternoon Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 27th Afternoon Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 27th Morning Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 27th Morning Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 27th Morning Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 27th Morning Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 26th Afternoon Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 26th Afternoon Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 26th Afternoon Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 26th Afternoon Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 26th Morning Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 26th Morning Part 2

Reinforcement Learning : Recent Trends and Future Challenges - 26th Morning Part 1

Reinforcement Learning : Recent Trends and Future Challenges - 26th Morning Part 1

Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game

Query-Efficient Algorithms to Find the Unique Nash Equilibrium in a Two-Player Zero-Sum Matrix Game

CSA IISc Open Day 2024

CSA IISc Open Day 2024

Art of Computing - Feb 18th - Afternoon Session

Art of Computing - Feb 18th - Afternoon Session

Art of Computing - Feb 18th - Morning Session

Art of Computing - Feb 18th - Morning Session

Art of Computing - Feb 17th - Afternoon Session

Art of Computing - Feb 17th - Afternoon Session

Art of Computing - Feb 17th - Afternoon Session

Art of Computing - Feb 17th - Afternoon Session

Art of Computing - Feb 17th - Morning Session

Art of Computing - Feb 17th - Morning Session

Provably Learning a Multi-head Attention Layer by Sitan Chen (Harvard)

Provably Learning a Multi-head Attention Layer by Sitan Chen (Harvard)

Best of Both Worlds in Fair Division by Rohit Vaish (IIT Delhi)

Best of Both Worlds in Fair Division by Rohit Vaish (IIT Delhi)

Workshop on Present and Future Computing Systems - Morning Session - 15 Jan 2024

Workshop on Present and Future Computing Systems - Morning Session - 15 Jan 2024

Workshop on Present and Future Computing Systems - Afternoon Session - 15 Jan 2024

Workshop on Present and Future Computing Systems - Afternoon Session - 15 Jan 2024

Workshop on Present and Future Computing Systems - Morning Session - 15 Jan 2024

Workshop on Present and Future Computing Systems - Morning Session - 15 Jan 2024

A Workshop on Present and Future Computing Systems - Forenoon Session

A Workshop on Present and Future Computing Systems - Forenoon Session

Tenth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Tenth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Designing ICTs for low-literate users by Dr. Indrani Medhi

Designing ICTs for low-literate users by Dr. Indrani Medhi

The Sampling Problem Through The Lens of Optimization : Recent Advances and Insights by Aniket Das

The Sampling Problem Through The Lens of Optimization : Recent Advances and Insights by Aniket Das

🎓✨ Calling all CSA Alums! Join us for a trip down memory lane at the CSA Alumni Meet 2023 🌐✨

🎓✨ Calling all CSA Alums! Join us for a trip down memory lane at the CSA Alumni Meet 2023 🌐✨

Ninth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Ninth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms

Detecting Hidden Communities by Power Iterations with Connections to Vanilla Spectral Algorithms

Hardness of Approximation of Diameter Clustering by Karthik C. S. (Rutgers University)

Hardness of Approximation of Diameter Clustering by Karthik C. S. (Rutgers University)

Eighth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Eighth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Seventh Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Seventh Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Sample Complexity of Distinguishing Cause from Effect by Saravanan Kandasamy (Cornell University)

Sample Complexity of Distinguishing Cause from Effect by Saravanan Kandasamy (Cornell University)

Approximation Algorithms for Network Design in Non-Uniform Fault Models by Prof. Chandra Chekuri

Approximation Algorithms for Network Design in Non-Uniform Fault Models by Prof. Chandra Chekuri

Sixth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Sixth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Fifth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Fifth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Fourth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Fourth Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Random Separating Hyperplane theorem with applications to Topic Modelling by Chiranjib Bhattacharyya

Random Separating Hyperplane theorem with applications to Topic Modelling by Chiranjib Bhattacharyya

Robustly Learning Affine Transformations with Asymptotically Optimal Error by He Jia (Georgia Tech)

Robustly Learning Affine Transformations with Asymptotically Optimal Error by He Jia (Georgia Tech)

Learning to make customized user predictions through preference elicitation by Aadirupa Saha

Learning to make customized user predictions through preference elicitation by Aadirupa Saha

Third Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Third Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

First Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

First Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Second Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Second Part of Lecture Series on Causality by Dr. Karthikeyan Shanmugam

Title: Causal Inference and Large Language Models: A New Frontier by Amit Sharma Part 2

Title: Causal Inference and Large Language Models: A New Frontier by Amit Sharma Part 2

Title: Causal Inference and Large Language Models: A New Frontier by Amit Sharma Part 1

Title: Causal Inference and Large Language Models: A New Frontier by Amit Sharma Part 1

Differential Privacy in Multi-armed Bandits by Sayak Ray Chowdhury (Microsoft Research, Bangalore)

Differential Privacy in Multi-armed Bandits by Sayak Ray Chowdhury (Microsoft Research, Bangalore)

The Price of Equity with Binary Valuations and Few Agent Types by Aditi Sethia (IIT Gandhinagar)

The Price of Equity with Binary Valuations and Few Agent Types by Aditi Sethia (IIT Gandhinagar)

Tackling Label Corruptions: Univariate Polynomial Regression and Generalized Linear Models

Tackling Label Corruptions: Univariate Polynomial Regression and Generalized Linear Models

Moments, Random Walks, and Limits for Spectrum Approximation by Apoorv Vikram Singh (NYU, Tandom)

Moments, Random Walks, and Limits for Spectrum Approximation by Apoorv Vikram Singh (NYU, Tandom)

On Dynamics-Informed Blending of Machine Learning and Microeconomics by Prof. Michael I. Jordan

On Dynamics-Informed Blending of Machine Learning and Microeconomics by Prof. Michael I. Jordan

Integrality Gaps for Random Integer Programs via Discrepancy by Daniel Dadush (CWI, Netherlands)

Integrality Gaps for Random Integer Programs via Discrepancy by Daniel Dadush (CWI, Netherlands)

Round-or-Cut Technique for designing Approximation Algorithms for Clustering Problems by Deeparnab C

Round-or-Cut Technique for designing Approximation Algorithms for Clustering Problems by Deeparnab C

Data-driven Social Informatics by Gita Sukthankar (University of Central Florida)

Data-driven Social Informatics by Gita Sukthankar (University of Central Florida)

Learning linear thresholds from label proportions by Rishi Saket (Google Research, India)

Learning linear thresholds from label proportions by Rishi Saket (Google Research, India)

The Subspace Flatness Conjecture and Faster Integer Programming by Victor Reis

The Subspace Flatness Conjecture and Faster Integer Programming by Victor Reis

Multi-robot planning strategies for spatio-temporal sampling, Sandeep Manjanna (Plaksha University)

Multi-robot planning strategies for spatio-temporal sampling, Sandeep Manjanna (Plaksha University)

Algorithms Approaching the Threshold for Semi-random Planted Clique by Rares-Darius Buhai

Algorithms Approaching the Threshold for Semi-random Planted Clique by Rares-Darius Buhai

Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games by Arnab Maiti

Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games by Arnab Maiti

A Productive and Scalable Actor Based Programming System for PGAS Applications by Vivek Sarkar

A Productive and Scalable Actor Based Programming System for PGAS Applications by Vivek Sarkar

A PTAS for Unsplittable Flow on a Path by Tobias Mömke (University of Augsburg)

A PTAS for Unsplittable Flow on a Path by Tobias Mömke (University of Augsburg)

Online and Bandit Algorithms Beyond ℓ_p Norms by Thomas Kesselheim (University of Bonn)

Online and Bandit Algorithms Beyond ℓ_p Norms by Thomas Kesselheim (University of Bonn)

Hop-Constrained Expander Decompositions, Oblivious Routing, and Distributed Universal Optimality

Hop-Constrained Expander Decompositions, Oblivious Routing, and Distributed Universal Optimality

Sequential learning in a stochastic multi armed bandit framework by Sandeep Juneja (TIFR, Mumbai)-1

Sequential learning in a stochastic multi armed bandit framework by Sandeep Juneja (TIFR, Mumbai)-1

Sequential learning in a stochastic multi armed bandit framework by Sandeep Juneja (TIFR, Mumbai)-2

Sequential learning in a stochastic multi armed bandit framework by Sandeep Juneja (TIFR, Mumbai)-2

Criticality of AC0-formulae by Prahladh Harsha (TIFR, Mumbai)

Criticality of AC0-formulae by Prahladh Harsha (TIFR, Mumbai)

Title: Private Convex Optimization via Exponential Mechanism by Sivakanth Gopi (MSR, Redmond)

Title: Private Convex Optimization via Exponential Mechanism by Sivakanth Gopi (MSR, Redmond)

Causal Fairness Analysis by Drago Plecko (ETH Zurich)

Causal Fairness Analysis by Drago Plecko (ETH Zurich)

2D expansion in random geometric graphs by Sidhanth Mohanty (UC Berkeley)

2D expansion in random geometric graphs by Sidhanth Mohanty (UC Berkeley)

Utilizing the CLT Structure in Stochastic Approximations of Sampling Algorithms by Dheeraj Nagaraj

Utilizing the CLT Structure in Stochastic Approximations of Sampling Algorithms by Dheeraj Nagaraj

CSA IISc Open Day 2023

CSA IISc Open Day 2023

Understanding Performance of Internet Video using Network Measurement Data by Dr. Tarun Mangla

Understanding Performance of Internet Video using Network Measurement Data by Dr. Tarun Mangla

What is common to robots, proteins, genomics and video games? by Kartic Subr University of Edinburgh

What is common to robots, proteins, genomics and video games? by Kartic Subr University of Edinburgh

The Right to Deny by Prof. Shafi Goldwasser

The Right to Deny by Prof. Shafi Goldwasser

Machine Learning and Logic: Fast and Slow Thinking by Moshe Y. Vardi (Rice University)

Machine Learning and Logic: Fast and Slow Thinking by Moshe Y. Vardi (Rice University)

CSAChannel IISc Live Stream

CSAChannel IISc Live Stream

Equivalence Test for Read-Once Arithmetic Formulas by Bhargav Thankey

Equivalence Test for Read-Once Arithmetic Formulas by Bhargav Thankey

Energy Efficient Computing in the Climate Crisis Era by Murali Annavaram

Energy Efficient Computing in the Climate Crisis Era by Murali Annavaram

ÂµIRs-Intermediate Representation for Agile Design of Accelerators by Prof. Arrvindh Shriraman

ÂµIRs-Intermediate Representation for Agile Design of Accelerators by Prof. Arrvindh Shriraman

Hardness of Approximating Discrete Steiner Tree in L_p metrics by Karthik C. S. (Rutgers University)

Hardness of Approximating Discrete Steiner Tree in L_p metrics by Karthik C. S. (Rutgers University)

Low Degree Testing over the Reals by Vipul Arora

Low Degree Testing over the Reals by Vipul Arora

Visualization - Data analysis with the human in the loop by Prof. Ingrid Hotz

Visualization - Data analysis with the human in the loop by Prof. Ingrid Hotz

Smoothed Analysis of Online Decision Making by Abhishek Shetty (UC Berkeley)

Smoothed Analysis of Online Decision Making by Abhishek Shetty (UC Berkeley)

Quantum Worst-case to Average-case reductions for all linear problems by Sathyawageeswar Subramanian

Quantum Worst-case to Average-case reductions for all linear problems by Sathyawageeswar Subramanian

Probabilistic Hash Functions and Hash Tables by Anshumali Shrivastava

Probabilistic Hash Functions and Hash Tables by Anshumali Shrivastava

Matroid-convex functions and approximative closure of some polynomial classes by Rohit Gurjar

Matroid-convex functions and approximative closure of some polynomial classes by Rohit Gurjar

Efficient Determinant Maximization for All Matroids by Madhusudhan Pittu (CMU)

Efficient Determinant Maximization for All Matroids by Madhusudhan Pittu (CMU)

Solving Global Grand Challenges with High Performance Data Analytics by Prof. David A. Bader

Solving Global Grand Challenges with High Performance Data Analytics by Prof. David A. Bader

Model Counting meets F0 Estimation by Arnab Bhattacharyya (NUS, Singapore)

Model Counting meets F0 Estimation by Arnab Bhattacharyya (NUS, Singapore)

Survey talk by Amir Abboud on fine-grained complexity by Amir Abboud (Weizmann Institute of Science)

Survey talk by Amir Abboud on fine-grained complexity by Amir Abboud (Weizmann Institute of Science)

All-Pairs Minimum Cuts in Nearly Quadratic Time Debmalya Panigrahy (Duke)

All-Pairs Minimum Cuts in Nearly Quadratic Time Debmalya Panigrahy (Duke)

Existence and Computation of Epistemic EFX Allocations by Eklavya Sharma (UIUC)

Existence and Computation of Epistemic EFX Allocations by Eklavya Sharma (UIUC)

Planet Scale Computing Infrastructure - Challenges and Opportunities by Dr. Rama Govindaraju

Planet Scale Computing Infrastructure - Challenges and Opportunities by Dr. Rama Govindaraju

Enabling Efficient Memory Systems using Novel Compression Methods by Prof Per Stenstrom

Enabling Efficient Memory Systems using Novel Compression Methods by Prof Per Stenstrom

Lifelong Learning of Representations with Provable Guarantees by Santosh Vempala (Georgia Tech)

Lifelong Learning of Representations with Provable Guarantees by Santosh Vempala (Georgia Tech)

Exploring the Gap between Tolerant and Non-tolerant Distribution Testing by Sayantan Sen

Exploring the Gap between Tolerant and Non-tolerant Distribution Testing by Sayantan Sen

Robustly Learning Mixtures of Arbitrary Gaussians in Polynomial Time by Santosh Vempala

Robustly Learning Mixtures of Arbitrary Gaussians in Polynomial Time by Santosh Vempala

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions

Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions

Training ML Models with Private Data on Untrusted Hardware by Prof. Murali Annavaram

Training ML Models with Private Data on Untrusted Hardware by Prof. Murali Annavaram

Multi-Party Computing for Privacy in Machine Learning Systems by Prof. Murali Annavaram

Multi-Party Computing for Privacy in Machine Learning Systems by Prof. Murali Annavaram

The number of leaves in a Boolean decision tree by Jaikumar Radhakrishnan

The number of leaves in a Boolean decision tree by Jaikumar Radhakrishnan

Set membership with two classical and quantum probes by Jaikumar Radhakrishnan

Set membership with two classical and quantum probes by Jaikumar Radhakrishnan

Spectral sparsification of directed hypergraphs by spanner’s counterpart by Kazusato Oko

Spectral sparsification of directed hypergraphs by spanner’s counterpart by Kazusato Oko

Determinant Maximization via Matroid Intersection Algorithms by Aditi Laddha

Determinant Maximization via Matroid Intersection Algorithms by Aditi Laddha

Improved sublinear algorithms for testing permutation freeness by Nithin Varma

Improved sublinear algorithms for testing permutation freeness by Nithin Varma

Negative-Weight Single-Source Shortest Paths in Near-linear TimeDanupon Nanongkai

Negative-Weight Single-Source Shortest Paths in Near-linear TimeDanupon Nanongkai

Some NP-hardness Results and An Approximation Algorithm by Mrinalkanti Ghosh

Some NP-hardness Results and An Approximation Algorithm by Mrinalkanti Ghosh

On High Dimensional Expanders and Hardness of Approximation by Max Hopkins

On High Dimensional Expanders and Hardness of Approximation by Max Hopkins

Building Storage Systems for New Applications and New Hardware by Prof. Vijay Chidambaram

Building Storage Systems for New Applications and New Hardware by Prof. Vijay Chidambaram

Correlated Rounding for Correlation Clustering by Alantha Newman

Correlated Rounding for Correlation Clustering by Alantha Newman

Robust Secretary Algorithms for Packing Integer Programs by Sahil Singla (Georgia Tech)

Robust Secretary Algorithms for Packing Integer Programs by Sahil Singla (Georgia Tech)

Local Codes for Insertion and Deletion Errors by Elena Grigorescu (Purdue)

Local Codes for Insertion and Deletion Errors by Elena Grigorescu (Purdue)

Decentralized Bandits in Matching Markets by Karthik Abinav (Facebook)

Decentralized Bandits in Matching Markets by Karthik Abinav (Facebook)

Comparative Analysis of Topological Structures by Raghavendra GS

Comparative Analysis of Topological Structures by Raghavendra GS

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions by João Ribeiro (CMU)

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions by João Ribeiro (CMU)

Algorithms for learning and testing high-dimensional statistical and causal relations

Algorithms for learning and testing high-dimensional statistical and causal relations

Scheduling to minimize the Age of Information by Rahul Vaze (TIFR)

Scheduling to minimize the Age of Information by Rahul Vaze (TIFR)

Online Algorithm for the Minimum Metric Bipartite Matching Problem by Sharath Raghvendra

Online Algorithm for the Minimum Metric Bipartite Matching Problem by Sharath Raghvendra

Hypergraph expansion, CSPs, and algorithmic decoding of epsilon-balanced codes by Madhur Tulsiani

Hypergraph expansion, CSPs, and algorithmic decoding of epsilon-balanced codes by Madhur Tulsiani

Determinant Maximization : Approximation and Estimation Algorithms by Mohit Singh

Determinant Maximization : Approximation and Estimation Algorithms by Mohit Singh

Perfect matchings and Quantum Physics by Rishikesh Gajjala

Perfect matchings and Quantum Physics by Rishikesh Gajjala

Interventional Complexity of Learning Causal Graphs by Vibhor Porwal (Adobe Research)

Interventional Complexity of Learning Causal Graphs by Vibhor Porwal (Adobe Research)

Automating Distributed Heterogeneous Computing for Python Programmers By Prof. Vivek Sarkar

Automating Distributed Heterogeneous Computing for Python Programmers By Prof. Vivek Sarkar

Finding Adversarially Robust Representations by Aravindan Vijayaraghavan (Northwestern University)

Finding Adversarially Robust Representations by Aravindan Vijayaraghavan (Northwestern University)

Future of Compute by Jim Keller

Future of Compute by Jim Keller

New techniques and results for Support Recovery in Mixture Models by Soumyabrata Pal

New techniques and results for Support Recovery in Mixture Models by Soumyabrata Pal

Near Optimal Split-state Non-malleable Codes by Sai Lakshmi Bhavana (Microsoft Research, India)

Near Optimal Split-state Non-malleable Codes by Sai Lakshmi Bhavana (Microsoft Research, India)

Alice in the PA-Land by Maciej Obremski (National University of Singapore)

Alice in the PA-Land by Maciej Obremski (National University of Singapore)

Partitioning over Submodular Structures – Part II by Karthekeyan Chandrasekaran

Partitioning over Submodular Structures – Part II by Karthekeyan Chandrasekaran

Partitioning over Submodular Structures – Part I by Karthekeyan Chandrasekaran

Partitioning over Submodular Structures – Part I by Karthekeyan Chandrasekaran

Online Learning with Hints by Aditya Bhaskara (University of Utah)

Online Learning with Hints by Aditya Bhaskara (University of Utah)

Electrical Flows over Spanning Trees by Swati Gupta (Georgia Institute of Technology)

Electrical Flows over Spanning Trees by Swati Gupta (Georgia Institute of Technology)

Parameterized Approaches to Kemeny Rank Aggregation by Neeldhara Misra (IIT Gandhinagar)

Parameterized Approaches to Kemeny Rank Aggregation by Neeldhara Misra (IIT Gandhinagar)

Cascaded Norms in Clustering by Eden Chlamtac (Ben Gurion University)

Cascaded Norms in Clustering by Eden Chlamtac (Ben Gurion University)

Planar Partition Oracles and When they strike gold by Akash Kumar EPFL Switzerland

Planar Partition Oracles and When they strike gold by Akash Kumar EPFL Switzerland

Matrix Discrepancy from Quantum Communication by Abhishek Shetty (UC Berkeley)

Matrix Discrepancy from Quantum Communication by Abhishek Shetty (UC Berkeley)

Playing Unique Games on Certifiable Small-set Expanders by Mitali Bafna (Harvard University)

Playing Unique Games on Certifiable Small-set Expanders by Mitali Bafna (Harvard University)

Some Recent Advances in Dynamic Algorithms for Maximum Matching and Minimum Set Cover (Part 1)

Some Recent Advances in Dynamic Algorithms for Maximum Matching and Minimum Set Cover (Part 1)

Some Recent Advances in Dynamic Algorithms for Maximum Matching and Minimum Set Cover (Part 2)

Some Recent Advances in Dynamic Algorithms for Maximum Matching and Minimum Set Cover (Part 2)

Some New Results on using FA to Solve Large Scale Planning Problems, by Csaba Szepesvari

Some New Results on using FA to Solve Large Scale Planning Problems, by Csaba Szepesvari

Under-exploration in Bandits with Mean Bounds for Leveraging Confounded Data, by Karthikeyan S

Under-exploration in Bandits with Mean Bounds for Leveraging Confounded Data, by Karthikeyan S

Are there Needles in a (Moving) Haystack?, by Rui M. Castro

Are there Needles in a (Moving) Haystack?, by Rui M. Castro

Dismantling the Deep Neural Network Black Box, by Chandrashekar Lakshminarayanan

Dismantling the Deep Neural Network Black Box, by Chandrashekar Lakshminarayanan

The Role of Lookahead and Approximate PE in PI with Linear Value, by R.Srikant

The Role of Lookahead and Approximate PE in PI with Linear Value, by R.Srikant

Zap Q-learning with Nonlinear Function Approximation, by Sean Meyn

Zap Q-learning with Nonlinear Function Approximation, by Sean Meyn

Correlation Robust Influence Maximization, by Divya Padmanabhan

Correlation Robust Influence Maximization, by Divya Padmanabhan

Universal Decision Making using Information Fields, by Sridhar Mahadevan

Universal Decision Making using Information Fields, by Sridhar Mahadevan

Generalization Bounds and Neural Tangent Kernels, by Debarghya Ghoshdastidar

Generalization Bounds and Neural Tangent Kernels, by Debarghya Ghoshdastidar

The Increasing Role of Sensorimotor Experience in AI, by Richard Sutton

The Increasing Role of Sensorimotor Experience in AI, by Richard Sutton

Practical Tools to Analyze Practical Deep Reinforcement Learning, by Arunselvan Ramaswamy

Practical Tools to Analyze Practical Deep Reinforcement Learning, by Arunselvan Ramaswamy

Model-Based Algorithms for Offline Learning, by Aravind Rajeswaran

Model-Based Algorithms for Offline Learning, by Aravind Rajeswaran

Mask & Focus: Conversation modelling by learning concepts, by Gaurav Panday

Mask & Focus: Conversation modelling by learning concepts, by Gaurav Panday

Dynamic Social Learning Under Graph Constraints, by Vivek Borkar

Dynamic Social Learning Under Graph Constraints, by Vivek Borkar

Lessons from AlphaZero for Optimal, Model Predictive, and Adaptive Control, by Dimitri Bertsekas

Lessons from AlphaZero for Optimal, Model Predictive, and Adaptive Control, by Dimitri Bertsekas

A Lyapunov Approach for Finite-sample Convergence Bounds with Off-policy RL, by Sanjay Shakkottai

A Lyapunov Approach for Finite-sample Convergence Bounds with Off-policy RL, by Sanjay Shakkottai

Concentration Bounds for TD Learning with Linear Function Approximation, by Prashanth L.A

Concentration Bounds for TD Learning with Linear Function Approximation, by Prashanth L.A

Offline Reinforcement Learning, by Sergey Levine

Offline Reinforcement Learning, by Sergey Levine

Min Sum Set Cover and Tail Bounds for Sums of Bernoullis by Jatin Batra

Min Sum Set Cover and Tail Bounds for Sums of Bernoullis by Jatin Batra

Algorithmic advances on metric and graph clustering (Part 2) Vincent Cohen-Addad

Algorithmic advances on metric and graph clustering (Part 2) Vincent Cohen-Addad

Recent developments on ∃R-completeness of packing and other problems by Mikkel Abrahamsen

Recent developments on ∃R-completeness of packing and other problems by Mikkel Abrahamsen

Algorithmic advances on metric and graph clustering (Part 1) Vincent Cohen-Addad (Google, Zurich)

Algorithmic advances on metric and graph clustering (Part 1) Vincent Cohen-Addad (Google, Zurich)

Improved (exponential time) algorithms: A case study for Subset Sum and Bin Packing- Jesper Nederlof

Improved (exponential time) algorithms: A case study for Subset Sum and Bin Packing- Jesper Nederlof

Monotone Arithmetic Lower Bounds Via Communication Complexity - Arkadev Chattopadhyay

Monotone Arithmetic Lower Bounds Via Communication Complexity - Arkadev Chattopadhyay

Efficient Intervention Design for Learning Causal DAGs, by Karthikeyan Shanmugam

Efficient Intervention Design for Learning Causal DAGs, by Karthikeyan Shanmugam

Better-Than-2 Approximations for Weighted Tree Augmentation - Vera Traub

Better-Than-2 Approximations for Weighted Tree Augmentation - Vera Traub

A 2+epsilon approximation algorithm for pre-emptive weighted flow time on a single machine

A 2+epsilon approximation algorithm for pre-emptive weighted flow time on a single machine

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles by Arindam Khan

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles by Arindam Khan

Recent Progress in Online Matching (Part 2): Open Problems in Online Advertising by Zhiyi Huang

Recent Progress in Online Matching (Part 2): Open Problems in Online Advertising by Zhiyi Huang

What makes a good applied Data scientist? by Dr. Mayur Datar

What makes a good applied Data scientist? by Dr. Mayur Datar

Recent progress in online matching (Part -1): Open problems in online advertising by Dr. Zhiyi Huang

Recent progress in online matching (Part -1): Open problems in online advertising by Dr. Zhiyi Huang

Superpolynomial lower bounds against low-depth algebraic circuits - Nutan Limaye

Superpolynomial lower bounds against low-depth algebraic circuits - Nutan Limaye

Spectral Clustering Oracles in Sublinear Time

Spectral Clustering Oracles in Sublinear Time

Average Sensitivity of Graph Algorithms by Yuichi Yoshida

Average Sensitivity of Graph Algorithms by Yuichi Yoshida

Panel Discussion on “PhD in India: Opportunities and Challenges”

Panel Discussion on “PhD in India: Opportunities and Challenges”

Using Data to Build Better Systems and Services by Dr Ranjita Bhagwan

Using Data to Build Better Systems and Services by Dr Ranjita Bhagwan

The need for Inclusive STEM Education By Vidhya Y

The need for Inclusive STEM Education By Vidhya Y

AI in Finance: Scope and Examples by Prof. Manuela Veloso

AI in Finance: Scope and Examples by Prof. Manuela Veloso

A survey talk on multidimensional packing (2D bin packing, strip packing, & other related problems)

A survey talk on multidimensional packing (2D bin packing, strip packing, & other related problems)

Approximation schemes for the generalized extensible bin packing problem

Approximation schemes for the generalized extensible bin packing problem

A panel discussion on gender inclusivity in computer science. (GJ women in computing series)

A panel discussion on gender inclusivity in computer science. (GJ women in computing series)

Kicking Butt in Computer Science: Women in Computing at Carnegie Mellon and Around the World

Kicking Butt in Computer Science: Women in Computing at Carnegie Mellon and Around the World