{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":279773133,"defaultBranch":"master","name":"Solver-Demo","ownerLogin":"Jakob-Bach","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2020-07-15T05:29:07.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/6431179?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1603696037.0","currentOid":""},"activityList":{"items":[{"before":"30d986b61983a3e20e979f28b2e172c6e2a6ab85","after":"004586ddd3620a00c86e4fe563a6dc68dc7dee34","ref":"refs/heads/master","pushedAt":"2024-07-19T11:46:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Improve comments for CFS linearization\n\nWe recently tried to understand it and decided to add some helpful\ncomments (functionality remains unchanged).","shortMessageHtmlLink":"Improve comments for CFS linearization"}},{"before":"975997f8aa4b521a4ed457247f093d156dd4b17d","after":"30d986b61983a3e20e979f28b2e172c6e2a6ab85","ref":"refs/heads/master","pushedAt":"2024-06-05T15:47:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Fix a URL in README\n\nAlso, add whitespace around table cells to allow more fine-grained diffs\nfor source (while rendered tables remain the same).","shortMessageHtmlLink":"Fix a URL in README"}},{"before":"e647c2701647fdfda0f717263fb3d076f59f3251","after":"975997f8aa4b521a4ed457247f093d156dd4b17d","ref":"refs/heads/master","pushedAt":"2024-06-05T15:40:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add arXiv-paper link for constrained subgroup discovery","shortMessageHtmlLink":"Add arXiv-paper link for constrained subgroup discovery"}},{"before":"a51ee48aa56b40afaff24d187a2960f5eb725f7a","after":"e647c2701647fdfda0f717263fb3d076f59f3251","ref":"refs/heads/master","pushedAt":"2024-05-08T05:16:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Link journal version of AFS paper","shortMessageHtmlLink":"Link journal version of AFS paper"}},{"before":"fc315ad7932ad30f38c076ed56dfb7d6098e2190","after":"a51ee48aa56b40afaff24d187a2960f5eb725f7a","ref":"refs/heads/master","pushedAt":"2024-03-06T08:24:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add links to CSD repo to README","shortMessageHtmlLink":"Add links to CSD repo to README"}},{"before":"396d08824b0e18d49fc90eab3d2da9b7cc4ca5af","after":"fc315ad7932ad30f38c076ed56dfb7d6098e2190","ref":"refs/heads/master","pushedAt":"2024-02-13T07:57:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add demo of finding alternative subgroup descriptions\n\nTakes a refactored version of the SMT problem for optimal subgroup\ndiscovery and adapts it to formulate the problem of finding alternative\ndescriptions for a given subgroup. Actually shares a lot of code with the\nproblem of optimizing WRAcc in the original subgroup. Implements a loop\nthat finds multiple alternative descriptions on one demo dataset and\nconducts a very basic quality/runtime evaluation.","shortMessageHtmlLink":"Add demo of finding alternative subgroup descriptions"}},{"before":"d227a5eb223657cb22750134eac63d9f942e4ff9","after":"396d08824b0e18d49fc90eab3d2da9b7cc4ca5af","ref":"refs/heads/master","pushedAt":"2023-12-14T17:00:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add alternative modeling for cardinality in MIP SD problem\n\n... and two minor fixes (one loop index, one variable name).","shortMessageHtmlLink":"Add alternative modeling for cardinality in MIP SD problem"}},{"before":"be0ba2f8fc9b3f78478ad75367b4ca6213768898","after":"d227a5eb223657cb22750134eac63d9f942e4ff9","ref":"refs/heads/master","pushedAt":"2023-09-16T12:50:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add demo of functional-dependency discovery","shortMessageHtmlLink":"Add demo of functional-dependency discovery"}},{"before":"a33edb5b3d57608effe18a656f2f3a2574aa01fa","after":"be0ba2f8fc9b3f78478ad75367b4ca6213768898","ref":"refs/heads/master","pushedAt":"2023-08-31T15:46:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add MaxSAT formulation of SD problem\n\nWell, using an SMT solver and two real-valued auxiliary variables, but the\nlatter could be replaced easily (have equivalence relation to an expression\nin the objective). Otherwise, all variables are binary. Way more variables\nthan the existing SMT formulation (0091be358a), since each unique feature\nvalues gets two variables (instead of having two real-valued variables per\nfeature). Constraints become more complex, and solving time increases.","shortMessageHtmlLink":"Add MaxSAT formulation of SD problem"}},{"before":"932c8568ed189ca7b87d8905c3752d8944575df2","after":"a33edb5b3d57608effe18a656f2f3a2574aa01fa","ref":"refs/heads/master","pushedAt":"2023-08-23T11:51:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Improve sub-group discovery demo\n\n1) Name columns in generated dataset to allow plotting\n2) Increase size of big \"m\" (the old value prevented box borders to assume\n   the minimum/maximum feature value)\n3) Use non-zero values for inequality tolerances (in the past, this\n   decreased the objective value, but actually was related to problem (2))\n4) Hint how to extract numerically better box boundaries (does not matter\n   here, where we only use the borders for plotting, but may be relevant in\n   prediction routines)","shortMessageHtmlLink":"Improve sub-group discovery demo"}},{"before":"0091be358a600c7b3c60b4f9689608e539171a89","after":"932c8568ed189ca7b87d8905c3752d8944575df2","ref":"refs/heads/master","pushedAt":"2023-08-22T16:51:15.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Try OR-Tools for MIP-SD problem\n\nCode similar to Python-MIP, but sometimes different solutions (even if only\nswitching solver within same OR-Tools implementation ...).","shortMessageHtmlLink":"Try OR-Tools for MIP-SD problem"}},{"before":"463ba419efdf21cb0fc8b09aa8732acb4f7ee4e8","after":"0091be358a600c7b3c60b4f9689608e539171a89","ref":"refs/heads/master","pushedAt":"2023-08-15T16:57:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add demo of subgroup discovery\n\n... formulated as MIP and SMT problem.","shortMessageHtmlLink":"Add demo of subgroup discovery"}},{"before":"5cf71759d377b856390b993ba453d0735e520158","after":"463ba419efdf21cb0fc8b09aa8732acb4f7ee4e8","ref":"refs/heads/master","pushedAt":"2023-07-12T15:45:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add demo for portfolio-like feature selection\n\n... formulated as MIP and (very slow) SMT problem.","shortMessageHtmlLink":"Add demo for portfolio-like feature selection"}},{"before":"a66d5bae979a0b387e1790d950a2ab6543e121fa","after":"5cf71759d377b856390b993ba453d0735e520158","ref":"refs/heads/master","pushedAt":"2023-04-21T08:07:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Move Python code into sub-directory","shortMessageHtmlLink":"Move Python code into sub-directory"}},{"before":"d7c5b1e40b06138a47b35e5e71c272dd7ae0b579","after":"a66d5bae979a0b387e1790d950a2ab6543e121fa","ref":"refs/heads/master","pushedAt":"2023-04-03T12:23:58.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Jakob-Bach","name":"Jakob Bach","path":"/Jakob-Bach","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/6431179?s=80&v=4"},"commit":{"message":"Add demo of decision trees for configuration selection\n\nBuild a decision tree (based on features of problem instances) where each\nleaf node tells which algorithm configuration to use for the corresponding\nproblem instances. Two approaches:\n- MIP optimization (slow)\n- greedy recursive algorithm (fast)","shortMessageHtmlLink":"Add demo of decision trees for configuration selection"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEg9zZ-gA","startCursor":null,"endCursor":null}},"title":"Activity · Jakob-Bach/Solver-Demo"}