Approximate Efficiency in Matching Markets
Foundations of Data Science – Lecture 9 – Two Applications of SVD
Modern data often consists of feature vectors with a large number of features. High-dimensional geometry and Linear Algebra (Singular Value Decomposition) are two of the crucial areas which form the mathematical foundations of Data Science.…
Foundations of Data Science – Lecture 8 – Low Rank Approximation (LRA) via Length Squared Sampling
Modern data often consists of feature vectors with a large number of features. High-dimensional geometry and Linear Algebra (Singular Value Decomposition) are two of the crucial areas which form the mathematical foundations of Data Science.…
LightGBM
Gradient Boosting Decision Tree (GBDT) is a popular machine learning algorithm, and has quite a few effective implementations. Although many engineering optimizations have been adopted in these implementations, the efficiency and scalability are still unsatisfactory…
Explaining Inconclusive Outcomes from Software Model Checkers to Users
This talk will be centered on partial verification results. Software model checkers can be used both to find bugs and to prove certain properties hold. However, due to resource bounds or tool limitations, many times…
Foundations of Data Science – Lecture 7 – Singular Value Decomposition – ll
Modern data often consists of feature vectors with a large number of features. High-dimensional geometry and Linear Algebra (Singular Value Decomposition) are two of the crucial areas which form the mathematical foundations of Data Science.…