Picture for S. S. Ravi

S. S. Ravi

Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks

Add code
May 11, 2024
Figure 1 for Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks
Figure 2 for Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks
Figure 3 for Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks
Figure 4 for Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks
Viaarxiv icon

Learning the Topology and Behavior of Discrete Dynamical Systems

Add code
Feb 18, 2024
Viaarxiv icon

Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems

Add code
Jan 06, 2023
Figure 1 for Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems
Figure 2 for Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems
Figure 3 for Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems
Figure 4 for Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems
Viaarxiv icon

Resource Sharing Through Multi-Round Matchings

Add code
Nov 30, 2022
Figure 1 for Resource Sharing Through Multi-Round Matchings
Figure 2 for Resource Sharing Through Multi-Round Matchings
Figure 3 for Resource Sharing Through Multi-Round Matchings
Figure 4 for Resource Sharing Through Multi-Round Matchings
Viaarxiv icon

Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness

Add code
Sep 20, 2022
Figure 1 for Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness
Figure 2 for Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness
Figure 3 for Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness
Figure 4 for Towards Auditing Unsupervised Learning Algorithms and Human Processes For Fairness
Viaarxiv icon

Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms

Add code
Sep 20, 2022
Figure 1 for Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms
Figure 2 for Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms
Figure 3 for Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms
Figure 4 for Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms
Viaarxiv icon

Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise

Add code
Sep 12, 2022
Figure 1 for Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise
Figure 2 for Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise
Figure 3 for Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise
Figure 4 for Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise
Viaarxiv icon

Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability

Add code
Feb 06, 2020
Figure 1 for Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Figure 2 for Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Figure 3 for Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Figure 4 for Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
Viaarxiv icon

A Graph-Based Approach for Active Learning in Regression

Add code
Jan 30, 2020
Figure 1 for A Graph-Based Approach for Active Learning in Regression
Figure 2 for A Graph-Based Approach for Active Learning in Regression
Figure 3 for A Graph-Based Approach for Active Learning in Regression
Figure 4 for A Graph-Based Approach for Active Learning in Regression
Viaarxiv icon