Courses from 1000+ universities
$7.2 billion in combined revenue since 2020. $8 billion in lost market value. This merger marks the end of an era in online education.
600 Free Google Certifications
Computer Science
Psychology
Microsoft Excel
Lean Production
Viruses & How to Beat Them: Cells, Immunity, Vaccines
Learn Like a Pro: Science-Based Tools to Become Better at Anything
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Efficient utilization of structure for combinatorial problem solving, focusing on treewidth measure and answer set programming. Explores runtime bounds, decomposition-guided reductions, and empirical results in hard reasoning modes.
Explore techniques for approximating total variation distance between high-dimensional product distributions, including randomized coupling and deterministic sparsification methods.
Explores using tractable probabilistic models to impose lexical constraints in autoregressive text generation, achieving state-of-the-art performance on constrained text generation benchmarks.
Explore challenges and tractability of finding modes in Probabilistic Circuits, focusing on Gaussian Sum-Product Networks for machine learning tasks like structured prediction.
Explores marginal determinism in probabilistic circuits, introducing md-vtrees for structured decomposable PCs. Discusses tractability conditions, efficient algorithms, and applications to causal inference queries like backdoor adjustment.
Explore matching models with aligned preferences, focusing on supply-demand imbalances in markets like organ donation. Learn about stability, fairness, and optimal transport connections in matching theory.
Explores testable implications of the core in exchange economies with unknown preferences, linking core concepts to competitive equilibrium and consumer demand through revealed preferences.
Explore hedonic coalition formation with friend-oriented preferences, examining strict core stability and strategy-proofness in the context of the strongly connected components mechanism.
Explores axiomatic approach to resource allocation, balancing priorities and equity through type-specific reserves and quotas. Analyzes single-school admissions and multi-school scenarios using Deferred Acceptance mechanism.
Explores methods for estimating separable matching models with transferable utility, focusing on minimum distance estimation and reformulation of the Choo and Siow model as a generalized linear model with two-way fixed effects.
Explores the Hylland-Zeckhauser mechanism for allocating goods, its intractability, and recent developments in Nash bargaining-based alternatives, discussing implications and open problems in market design.
Explores how similarity in school quality and applicant coverage can lead to voluntary adoption of centralized matching in college admissions, benefiting students with limited resources.
Explore approximation algorithms for knapsack problems, focusing on allocation efficiency and investment incentives in mechanism design without confirming negative externalities.
Explore insights on engineering sketches for large-scale production, covering Yahoo's journey in developing and implementing sketching algorithms across multiple languages and platforms.
Explores error-resilient encoding for streaming data, enabling accurate sketch computation despite message corruption while maintaining efficiency in communication and space complexity.
Get personalized course recommendations, track subjects and courses with reminders, and more.