[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6XED9PFKBS0QHVBD8FQGAZM":3,"skill-same:01M6XED9PFKBS0QHVBD8FQGAZM":54},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":17,"publishedAt":28,"linkOnly":29,"markdownContent":30,"markdownBody":31,"frontMatter":32,"refName":33,"commitSha":34,"skillDirectory":35,"forksCount":13,"repositoryHtmlUrl":36,"repositoryHomepageUrl":6,"ownerHtmlUrl":37,"ownerBlogUrl":6,"ownerDescription":38,"updatedAt":39,"install":40,"resources":53},"01M6XED9PFKBS0QHVBD8FQGAZM","pareto-optimization",null,"Multi-objective optimization with Pareto frontiers. Use when optimizing multiple conflicting objectives simultaneously, finding trade-off solutions, or computing Pareto-optimal points.","Waaaalnut\u002Fskillsbench","Waaaalnut","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F103995656?v=4","01M6XCS9K1V51EY3JMB7DGMX24","01M6XCS9Q4WPW88W62C55G1H44",0,"Apache-2.0","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fmars-clouds-clustering\u002Fenvironment\u002Fskills\u002Fpareto-optimization\u002FSKILL.md",[],[18,19,20,21,22,23,24,25,26,27],"Optimization","pareto optimization","pareto","use","trade","multi","with","objective","when","solutions","2026-11-10 10:12:30",false,"---\nname: pareto-optimization\ndescription: Multi-objective optimization with Pareto frontiers. Use when optimizing multiple conflicting objectives simultaneously, finding trade-off solutions, or computing Pareto-optimal points.\n---\n\n# Pareto Optimization\n\nPareto optimization deals with multi-objective optimization where you want to optimize multiple conflicting objectives simultaneously.\n\n## Key Concepts\n\n### Pareto Dominance\n\nPoint A **dominates** point B if:\n- A is at least as good as B in all objectives\n- A is strictly better than B in at least one objective\n\n### Pareto Frontier (Pareto Front)\n\nThe set of all non-dominated points. These represent optimal trade-offs where improving one objective requires sacrificing another.\n\n## Computing the Pareto Frontier\n\n### Using the paretoset Library\n\n```python\nfrom paretoset import paretoset\nimport pandas as pd\n\n# Data with two objectives (e.g., model accuracy vs inference time)\ndf = pd.DataFrame({\n    'accuracy': [0.95, 0.92, 0.88, 0.85, 0.80],\n    'latency_ms': [120, 95, 75, 60, 45],\n    'model_size': [100, 80, 60, 40, 20],\n    'learning_rate': [0.001, 0.005, 0.01, 0.05, 0.1]\n})\n\n# Compute Pareto mask\n# sense: \"max\" for objectives to maximize, \"min\" for objectives to minimize\nobjectives = df[['accuracy', 'latency_ms']]\npareto_mask = paretoset(objectives, sense=[\"max\", \"min\"])\n\n# Get Pareto-optimal points\npareto_points = df[pareto_mask]\n```\n\n### Manual Implementation\n\n```python\nimport numpy as np\n\ndef is_dominated(point, other_points, maximize_indices, minimize_indices):\n    \"\"\"Check if point is dominated by any point in other_points.\"\"\"\n    for other in other_points:\n        dominated = True\n        strictly_worse = False\n\n        for i in maximize_indices:\n            if point[i] > other[i]:\n                dominated = False\n                break\n            if point[i] \u003C other[i]:\n                strictly_worse = True\n\n        if dominated:\n            for i in minimize_indices:\n                if point[i] \u003C other[i]:\n                    dominated = False\n                    break\n                if point[i] > other[i]:\n                    strictly_worse = True\n\n        if dominated and strictly_worse:\n            return True\n\n    return False\n\ndef compute_pareto_frontier(points, maximize_indices=[0], minimize_indices=[1]):\n    \"\"\"Compute Pareto frontier from array of points.\"\"\"\n    pareto = []\n    points_list = list(points)\n\n    for i, point in enumerate(points_list):\n        others = points_list[:i] + points_list[i+1:]\n        if not is_dominated(point, others, maximize_indices, minimize_indices):\n            pareto.append(point)\n\n    return np.array(pareto)\n```\n\n## Example: Model Selection\n\n```python\nimport pandas as pd\nfrom paretoset import paretoset\n\n# Results from model training experiments\nresults = pd.DataFrame({\n    'accuracy': [0.95, 0.92, 0.90, 0.88, 0.85],\n    'inference_time': [150, 120, 100, 80, 60],\n    'batch_size': [32, 64, 128, 256, 512],\n    'hidden_units': [512, 256, 128, 64, 32]\n})\n\n# Filter by minimum accuracy threshold\nresults = results[results['accuracy'] >= 0.85]\n\n# Compute Pareto frontier (maximize accuracy, minimize inference time)\nmask = paretoset(results[['accuracy', 'inference_time']], sense=[\"max\", \"min\"])\npareto_frontier = results[mask].sort_values('accuracy', ascending=False)\n\n# Save to CSV\npareto_frontier.to_csv('pareto_models.csv', index=False)\n```\n\n## Visualization\n\n```python\nimport matplotlib.pyplot as plt\n\n# Plot all points\nplt.scatter(results['inference_time'], results['accuracy'],\n            alpha=0.5, label='All models')\n\n# Highlight Pareto frontier\nplt.scatter(pareto_frontier['inference_time'], pareto_frontier['accuracy'],\n            color='red', s=100, marker='s', label='Pareto frontier')\n\nplt.xlabel('Inference Time (ms) - minimize')\nplt.ylabel('Accuracy - maximize')\nplt.legend()\nplt.show()\n```\n\n## Properties of Pareto Frontiers\n\n1. **Trade-off curve**: Moving along the frontier improves one objective while worsening another\n2. **No single best**: All Pareto-optimal solutions are equally \"good\" in a multi-objective sense\n3. **Decision making**: Final choice depends on preference between objectives\n","# Pareto Optimization\n\nPareto optimization deals with multi-objective optimization where you want to optimize multiple conflicting objectives simultaneously.\n\n## Key Concepts\n\n### Pareto Dominance\n\nPoint A **dominates** point B if:\n- A is at least as good as B in all objectives\n- A is strictly better than B in at least one objective\n\n### Pareto Frontier (Pareto Front)\n\nThe set of all non-dominated points. These represent optimal trade-offs where improving one objective requires sacrificing another.\n\n## Computing the Pareto Frontier\n\n### Using the paretoset Library\n\n```python\nfrom paretoset import paretoset\nimport pandas as pd\n\n# Data with two objectives (e.g., model accuracy vs inference time)\ndf = pd.DataFrame({\n    'accuracy': [0.95, 0.92, 0.88, 0.85, 0.80],\n    'latency_ms': [120, 95, 75, 60, 45],\n    'model_size': [100, 80, 60, 40, 20],\n    'learning_rate': [0.001, 0.005, 0.01, 0.05, 0.1]\n})\n\n# Compute Pareto mask\n# sense: \"max\" for objectives to maximize, \"min\" for objectives to minimize\nobjectives = df[['accuracy', 'latency_ms']]\npareto_mask = paretoset(objectives, sense=[\"max\", \"min\"])\n\n# Get Pareto-optimal points\npareto_points = df[pareto_mask]\n```\n\n### Manual Implementation\n\n```python\nimport numpy as np\n\ndef is_dominated(point, other_points, maximize_indices, minimize_indices):\n    \"\"\"Check if point is dominated by any point in other_points.\"\"\"\n    for other in other_points:\n        dominated = True\n        strictly_worse = False\n\n        for i in maximize_indices:\n            if point[i] > other[i]:\n                dominated = False\n                break\n            if point[i] \u003C other[i]:\n                strictly_worse = True\n\n        if dominated:\n            for i in minimize_indices:\n                if point[i] \u003C other[i]:\n                    dominated = False\n                    break\n                if point[i] > other[i]:\n                    strictly_worse = True\n\n        if dominated and strictly_worse:\n            return True\n\n    return False\n\ndef compute_pareto_frontier(points, maximize_indices=[0], minimize_indices=[1]):\n    \"\"\"Compute Pareto frontier from array of points.\"\"\"\n    pareto = []\n    points_list = list(points)\n\n    for i, point in enumerate(points_list):\n        others = points_list[:i] + points_list[i+1:]\n        if not is_dominated(point, others, maximize_indices, minimize_indices):\n            pareto.append(point)\n\n    return np.array(pareto)\n```\n\n## Example: Model Selection\n\n```python\nimport pandas as pd\nfrom paretoset import paretoset\n\n# Results from model training experiments\nresults = pd.DataFrame({\n    'accuracy': [0.95, 0.92, 0.90, 0.88, 0.85],\n    'inference_time': [150, 120, 100, 80, 60],\n    'batch_size': [32, 64, 128, 256, 512],\n    'hidden_units': [512, 256, 128, 64, 32]\n})\n\n# Filter by minimum accuracy threshold\nresults = results[results['accuracy'] >= 0.85]\n\n# Compute Pareto frontier (maximize accuracy, minimize inference time)\nmask = paretoset(results[['accuracy', 'inference_time']], sense=[\"max\", \"min\"])\npareto_frontier = results[mask].sort_values('accuracy', ascending=False)\n\n# Save to CSV\npareto_frontier.to_csv('pareto_models.csv', index=False)\n```\n\n## Visualization\n\n```python\nimport matplotlib.pyplot as plt\n\n# Plot all points\nplt.scatter(results['inference_time'], results['accuracy'],\n            alpha=0.5, label='All models')\n\n# Highlight Pareto frontier\nplt.scatter(pareto_frontier['inference_time'], pareto_frontier['accuracy'],\n            color='red', s=100, marker='s', label='Pareto frontier')\n\nplt.xlabel('Inference Time (ms) - minimize')\nplt.ylabel('Accuracy - maximize')\nplt.legend()\nplt.show()\n```\n\n## Properties of Pareto Frontiers\n\n1. **Trade-off curve**: Moving along the frontier improves one objective while worsening another\n2. **No single best**: All Pareto-optimal solutions are equally \"good\" in a multi-objective sense\n3. **Decision making**: Final choice depends on preference between objectives\n",{"name":5,"description":7},"main","7eeb258ada72b7f58119b0e7a2c00ea89d9beedd","tasks\u002Fmars-clouds-clustering\u002Fenvironment\u002Fskills\u002Fpareto-optimization","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench","https:\u002F\u002Fgithub.com\u002FWaaaalnut","student of Zhejiang University","2026-04-21 23:16:23",{"source":8,"skillName":5,"commands":41,"prompt":51,"zipAvailable":52},[42,45,48],{"tool":43,"command":44},"npx","npx skills add Waaaalnut\u002Fskillsbench --skill pareto-optimization",{"tool":46,"command":47},"bunx","bunx skills add Waaaalnut\u002Fskillsbench --skill pareto-optimization",{"tool":49,"command":50},"pnpm","pnpm dlx skills add Waaaalnut\u002Fskillsbench --skill pareto-optimization","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fmars-clouds-clustering\u002Fenvironment\u002Fskills\u002Fpareto-optimization\u002FSKILL.md",true,[],[55,69,84,110,132,151],{"skillNo":56,"name":57,"nameZh":6,"description":6,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":58,"categories":59,"keywords":65,"publishedAt":28},"01M6XEWMJ6VY3ZC53MPDCPG3GH","data-reconciliation","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fxlsx-recover-data\u002Fenvironment\u002Fskills\u002Fdata-reconciliation\u002FSKILL.md",[60],{"categoryNo":61,"categoryName":62,"taxonomyType":63,"taxonomyTypeDesc":64},"01JBSEEDCAT000000000000033","数据分析师","PROFESSION","适用职业",[66,67,68],"data reconciliation","reconciliation","data",{"skillNo":70,"name":71,"nameZh":6,"description":72,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":73,"categories":74,"keywords":75,"publishedAt":28},"01M6XEW8MNPMF1KRXV6ATGFRQF","speech-to-text","Transcribe video to timestamped text using Whisper tiny model (pre-installed).","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fvideo-tutorial-indexer\u002Fenvironment\u002Fskills\u002Fspeech-to-text\u002FSKILL.md",[],[76,77,78,79,80,81,82,83],"speech","text","speech to text","transcribe video","whisper","model","Video","transcribe",{"skillNo":85,"name":86,"nameZh":6,"description":87,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":88,"categories":89,"keywords":95,"publishedAt":28},"01M6XEW3FQZP0T1RKQQJFXVY9T","video-processor","Process videos by removing segments and concatenating remaining parts. Use when you need to remove detected pauses\u002Fopenings from videos, create highlight reels, or batch process segment removals using ffmpeg filter_complex.","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fvideo-silence-remover\u002Fenvironment\u002Fskills\u002Fvideo-processor\u002FSKILL.md",[90],{"categoryNo":91,"categoryName":92,"taxonomyType":93,"taxonomyTypeDesc":94},"01JBSEEDCAT000000000000016","图像与多媒体","SCENARIO","使用场景",[82,96,97,98,99,100,26,101,102,103,104,105,106,107,108,21,109],"processor","video processor","batch","create","reels","parts","segments","process","videos","you","segment","filter","ffmpeg","remove",{"skillNo":111,"name":112,"nameZh":6,"description":113,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":114,"categories":115,"keywords":117,"publishedAt":28},"01M6XEVXJ5KZ0NTY3XZKRY4AS1","silence-detector","Detect initial silence segments in audio\u002Fvideo using energy-based analysis. Use when you need to find low-energy periods at the start of recordings (title slides, setup time, pre-roll silence).","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fvideo-silence-remover\u002Fenvironment\u002Fskills\u002Fsilence-detector\u002FSKILL.md",[116],{"categoryNo":91,"categoryName":92,"taxonomyType":93,"taxonomyTypeDesc":94},[118,119,120,121,26,105,122,123,124,125,126,102,127,128,82,129,130,131,21],"detector","silence detector","title","slides","time","energy","at","recordings","detect","find","Audio","analysis","start","setup",{"skillNo":133,"name":134,"nameZh":6,"description":135,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":136,"categories":137,"keywords":138,"publishedAt":28},"01M6XEVT3NGRN1FT7JPMAPXS6M","segment-combiner","Combine multiple segment detection results into a unified list. Use when you need to merge segments from different detectors, prepare removal lists for video processing, or consolidate detection outputs.","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fvideo-silence-remover\u002Fenvironment\u002Fskills\u002Fsegment-combiner\u002FSKILL.md",[],[106,139,82,140,141,142,143,144,26,145,146,102,105,147,148,21,149,150],"segment combiner","detection","prepare","merge","video processing","for","outputs","combine","processing","consolidate","results","list",{"skillNo":152,"name":153,"nameZh":6,"description":154,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":9,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":155,"categories":156,"keywords":160,"publishedAt":28},"01M6XEVMPVASGS2KX86QK4FMT7","report-generator","Generate compression reports for video processing. Use when you need to create structured JSON reports with duration statistics, compression ratios, and segment details after video processing.","https:\u002F\u002Fgithub.com\u002FWaaaalnut\u002Fskillsbench\u002Fblob\u002Fmain\u002Ftasks\u002Fvideo-silence-remover\u002Fenvironment\u002Fskills\u002Freport-generator\u002FSKILL.md",[157],{"categoryNo":158,"categoryName":159,"taxonomyType":63,"taxonomyTypeDesc":64},"01JBSEEDCAT000000000000034","行政与办公人员",[161,162,163,106,26,144,105,24,147,164,165,166,21,143,167,82,168,169,99],"generator","report generator","report","statistics","structured","reports","json","compression","generate"]