Ecological Vision: Computational Agent Design

Related lectures (50)

Explores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

Introduces the concept of categories essential for understanding group theory.

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.

Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.

Introduces cuts in a directed graph, analyzing the flow between two sets.

Covers the fundamental notion of composition in directed graphs and provides examples of their representation.

Covers flow networks, focusing on flows, cuts, and their applications in algorithms.

Explores simple paths, connectivity, equivalence classes, and connected components in directed graphs.

Covers the concept of networks, graphs, subgraphs, directed graphs, and indegree in network theory.

Covers the introduction to categories, including definitions and examples.

Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.

Covers the fundamentals of integer programming and network flows in directed graphs.

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Covers the definition of a group, properties of symmetries, and group operations.

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Page 1 of 3