jaeswift-website/api/data/awesomelist/sector_PRP-019.json

{"code": "PRP-019", "name": "THEORY", "icon": "\ud83d\udcd0", "lists": [{"name": "Osint", "subcategories": [{"name": "Osint \u2014 \ud83d\udcd6 Table of Contents", "entries": [{"name": "General Search", "url": "#-general-search", "description": ""}, {"name": "Google Dorks", "url": "#-google-dorks-tools", "description": ""}, {"name": "Main National Search Engines", "url": "#-main-national-search-engines", "description": ""}, {"name": "Meta Search", "url": "#-meta-search", "description": ""}, {"name": "Privacy Focused Search Engines", "url": "#-privacy-focused-search-engines", "description": ""}, {"name": "Data Breach Search Engines", "url": "#-databreach-search-engines", "description": ""}, {"name": "Specialty Search Engines", "url": "#-specialty-search-engines", "description": ""}, {"name": "Dark Web Search Engines", "url": "#-dark-web-search-engines", "description": ""}, {"name": "Visual Search and Clustering Search Engines", "url": "#-visual-search-and-clustering-search-engines", "description": ""}, {"name": "Similar Sites Search", "url": "#-similar-sites-search", "description": ""}, {"name": "Document and Slides Search", "url": "#-document-and-slides-search", "description": ""}, {"name": "Threat Actor Search", "url": "#-threat-actor-search", "description": ""}, {"name": "Live Cyber Threat Maps", "url": "#-live-cyber-threat-maps", "description": ""}, {"name": "File Search", "url": "#-file-search", "description": ""}, {"name": "Pastebins", "url": "#-pastebins", "description": ""}, {"name": "Code Search", "url": "#-code-search", "description": ""}, {"name": "Major Social Networks", "url": "#-major-social-networks", "description": ""}, {"name": "Real-Time Search, Social Media Search, and General Social Media Tools", "url": "#-real-time-search-social-media-search-and-general-social-media-tools", "description": ""}, {"name": "Social Media Tools", "url": "#social-media-tools", "description": ""}, {"name": "Blog Search", "url": "#-blog-search", "description": ""}, {"name": "Forums and Discussion Boards Search", "url": "#-forums-and-discussion-boards-search", "description": ""}, {"name": "Username Check", "url": "#-username-check", "description": ""}, {"name": "People Investigations", "url": "#-people-investigations", "description": ""}, {"name": "Email Search / Email Check", "url": "#-email-search--email-check", "description": ""}, {"name": "Phone Number Research", "url": "#-phone-number-research", "description": ""}, {"name": "Vehicle / Automobile Research", "url": "#-vehicle--automobile-research", "description": ""}, {"name": "Expert Search", "url": "#-expert-search", "description": ""}, {"name": "Company Research", "url": "#-company-research", "description": ""}, {"name": "Job Search Resources", "url": "#-job-search-resources", "description": ""}, {"name": "Q\\&A Sites", "url": "#-qa-sites", "description": ""}, {"name": "Domain and IP Research", "url": "#-domain-and-ip-research", "description": ""}, {"name": "Keywords Discovery and Research", "url": "#-keywords-discovery-and-research", "description": ""}, {"name": "Web History and Website Capture", "url": "#-web-history-and-website-capture", "description": ""}, {"name": "Language Tools", "url": "#-language-tools", "description": ""}, {"name": "Image Search", "url": "#-image-search", "description": ""}, {"name": "Image Analysis", "url": "#-image-analysis", "description": ""}, {"name": "Video Search and Other Video Tools", "url": "#-video-search-and-other-video-tools", "description": ""}, {"name": "Academic Resources and Grey Literature", "url": "#-academic-resources-and-grey-literature", "description": ""}, {"name": "Geospatial Research and Mapping Tools", "url": "#-geospatial-research-and-mapping-tools", "description": ""}, {"name": "News", "url": "#-news", "description": ""}, {"name": "News Digest and Discovery Tools", "url": "#-news-digest-and-discovery-tools", "description": ""}, {"name": "Fact Checking", "url": "#-fact-checking", "description": ""}, {"name": "Data and Statistics", "url": "#-data-and-statistics", "description": ""}, {"name": "Web Monitoring", "url": "#-web-monitoring", "description": ""}, {"name": "Browsers", "url": "#-browsers", "description": ""}, {"name": "Offline Browsing", "url": "#-offline-browsing", "description": ""}, {"name": "VPN Services", "url": "#-vpn-services", "description": ""}, {"name": "Infographics and Data Visualization", "url": "#-infographics-and-data-visualization", "description": ""}, {"name": "Social Network Analysis", "url": "#-social-network-analysis", "description": ""}, {"name": "Privacy and Encryption Tools", "url": "#-privacy-and-encryption-tools", "description": ""}, {"name": "DNS", "url": "#-dns", "description": ""}, {"name": "Maritime", "url": "#-maritime", "description": ""}, {"name": "Other Tools", "url": "#-other-tools", "description": ""}, {"name": "Threat Intelligence", "url": "#-threat-intelligence", "description": ""}, {"name": "Gaming Platforms", "url": "#-gaming-platforms", "description": ""}, {"name": "Music Streaming Services", "url": "#-music-streaming-services", "description": ""}, {"name": "OSINT Videos", "url": "#-osint-videos", "description": ""}, {"name": "OSINT Blogs", "url": "#-osint-blogs", "description": ""}, {"name": "Other Resources", "url": "#-other-resources", "description": ""}, {"name": "Related Awesome Lists", "url": "#-related-awesome-lists", "description": ""}, {"name": "Aol", "url": "https://search.aol.com", "description": "The web for America."}, {"name": "Ask", "url": "https://www.ask.com", "description": "Ask something and get a answer."}, {"name": "Bing", "url": "https://www.bing.com", "description": "Microsoft\u00b4s search engine."}, {"name": "Brave", "url": "https://search.brave.com", "description": "a private, independent, and transparent search engine."}, {"name": "Goodsearch", "url": "https://www.goodsearch.com", "description": "a search engine for shopping deals online."}, {"name": "Google Search", "url": "https://www.google.com", "description": "Most popular search engine."}, {"name": "Instya", "url": "https://www.instya.com", "description": "You can searching shopping sites, dictionaries, answer sites, news, images, videos and much more."}, {"name": "Impersonal.me", "url": "http://www.impersonal.me", "description": ""}, {"name": "Lycos", "url": "https://www.lycos.com", "description": "A search engine for pictures, videos, news and products."}, {"name": "Mojeek", "url": "https://www.mojeek.com/", "description": "A growing independent search engine which does not track you."}, {"name": "Perplexity", "url": "https://www.perplexity.ai", "description": "AI-powered search engine with source citations."}, {"name": "Phind", "url": "https://www.phind.com", "description": "AI search engine optimized for developers and technical questions."}, {"name": "Search.com", "url": "https://www.search.com", "description": "Search the Web by searching the best engines from one place."}, {"name": "Wolfram Alpha", "url": "https://www.wolframalpha.com", "description": "Wolfram Alpha is a computational knowledge engine (answer engine) developed by Wolfram Alpha. It will compute expert-level answers using Wolfram\u2019s breakthrough"}, {"name": "Yahoo! Search", "url": "https://www.yahoo.com", "description": "The search engine that helps you find exactly what you're looking for."}, {"name": "YOU", "url": "https://you.com", "description": "AI search engine."}, {"name": "DorkEye", "url": "https://github.com/xPloits3c/DorkEye", "description": "DorkEye is a Python-based OSINT framework for automated Google Dorking. It includes an interactive wizard for guided configuration, a dork generator to build and customize queries, a multi-agent analysis pipeline with SQLi detection, secrets scanning, security analysis, and advanced HTML report export with selective result saving \u2014 allowing accurate, targeted inclusion of findings.", "stars": "87"}, {"name": "DorkGenius", "url": "https://dorkgenius.com/", "description": "DorkGenius is the ultimate tool for generating custom search queries for Google, Bing, and DuckDuckGo. - Our cutting-edge app uses the power of AI to help you create advanced search queries that can find exactly what you're looking for on the web."}, {"name": "DorkGPT", "url": "https://www.dorkgpt.com/", "description": "Generate Google Dorks with AI."}, {"name": "Google Hacking Database (GHDB)", "url": "https://www.exploit-db.com/google-hacking-database", "description": "The GHDB is an index of search queries (we call them dorks) used to find publicly available information, intended for pentesters and security researchers."}, {"name": "SearchDorks", "url": "https://kriztalz.sh/search-dorks/", "description": "Generate Search Engine (Google, FOFA, Shodan, Censys, ZoomEye) Dorks using AI."}, {"name": "Alleba (Philippines)", "url": "http://www.alleba.com", "description": "Philippines search engine"}, {"name": "Baidu (China)", "url": "http://www.baidu.com", "description": "The major search engine used in China"}, {"name": "Daum (South Korea)", "url": "https://www.daum.net/", "description": ""}, {"name": "Eniro (Sweden)", "url": "http://www.eniro.se", "description": ""}, {"name": "Gerdoo (Iran)", "url": "http://gerdoo.me", "description": ""}, {"name": "Goo (Japan)", "url": "http://www.goo.ne.jp", "description": ""}, {"name": "Najdi (Slovenia)", "url": "http://www.najdi.si", "description": ""}, {"name": "Naver (South Korea)", "url": "http://www.naver.com", "description": ""}, {"name": "Onet.pl (Poland)", "url": "http://www.onet.pl", "description": ""}, {"name": "Orange (France)", "url": "http://www.orange.fr", "description": ""}, {"name": "Parseek (Iran)", "url": "http://www.parseek.com", "description": ""}, {"name": "SAPO (Portugal)", "url": "http://www.sapo.pt", "description": ""}, {"name": "Search.ch (Switzerland)", "url": "http://www.search.ch", "description": ""}, {"name": "Seznam(Czech Republic)", "url": "https://seznam.cz", "description": ""}, {"name": "SoGou (China)", "url": "http://www.sogou.com/", "description": ""}, {"name": "Walla (Israel)", "url": "http://www.walla.co.il", "description": ""}, {"name": "Yandex (Russia)", "url": "http://www.yandex.com", "description": ""}, {"name": "Zarebin (Iran)", "url": "http://zarebin.ir", "description": ""}, {"name": "All-in-One", "url": "http://all-io.net", "description": ""}, {"name": "AllTheInternet", "url": "http://www.alltheinternet.com", "description": ""}, {"name": "Etools", "url": "http://www.etools.ch", "description": ""}, {"name": "FaganFinder", "url": "http://www.faganfinder.com/engines", "description": ""}, {"name": "Goofram", "url": "http://www.goofram.com", "description": ""}, {"name": "iZito", "url": "http://www.izito.com", "description": ""}, {"name": "Myallsearch", "url": "http://www.myallsearch.com", "description": ""}, {"name": "Qwant", "url": "http://www.qwant.com", "description": "French search engine that relies on Microsoft Bing."}, {"name": "SearXNG", "url": "https://searxng.org/", "description": "A privacy-respecting, open-source metasearch engine."}, {"name": "Swisscows", "url": "https://swisscows.com/", "description": ""}, {"name": "DuckDuckGo", "url": "https://duckduckgo.com", "description": "an Internet search engine that emphasizes protecting searchers' privacy."}, {"name": "Disconnect Search", "url": "https://search.disconnect.me/", "description": "Stop search engines from tracking your searches."}, {"name": "Gibiru", "url": "https://gibiru.com/", "description": "Gibiru provides \u201cuncensored search results\u201d without collecting personal data like logging users\u2019 IP addresses or search queries."}, {"name": "Kagi Search", "url": "https://kagi.com/", "description": "Liberate your search. Free of ads. Free of surveillance. Your time respected. You are the customer, never the product."}, {"name": "Mojeek", "url": "https://www.mojeek.com/", "description": "Mojeek is a growing independent search engine which does not track you."}, {"name": "Presearch", "url": "https://presearch.com/", "description": "Presearch is a decentralized, community-driven search engine that protects your privacy and rewards you when you search."}, {"name": "Qwant", "url": "https://www.qwant.com/", "description": "The search engine that respects your privacy."}, {"name": "Startpage", "url": "https://www.startpage.com/", "description": "The world\u2019s most private search engine."}, {"name": "SearXNG", "url": "https://searxng.org/", "description": "A privacy-respecting, open-source metasearch engine."}, {"name": "swisscows", "url": "https://swisscows.com/en", "description": "Anonymous search engine, a family-friendly, privacy-focused search engine based in Switzerland."}, {"name": "CredenShow", "url": "https://credenshow.com/", "description": "Identify your compromised credentials before others do."}, {"name": "HIB Ransomed", "url": "https://haveibeenransom.com/", "description": "Because people have the right to know if their data has been leaked."}, {"name": "HEROIC.NOW", "url": "https://heroic.com/", "description": "Has your data been leaked on the dark web? Scan your identities for FREE."}, {"name": "IKnowYour.Dad", "url": "https://iknowyour.dad/", "description": "Data Breach Search Engine."}, {"name": "Leaker", "url": "https://github.com/vflame6/leaker", "description": "Passive leak enumeration CLI tool that searches across 10 breach databases simultaneously.", "stars": "286"}, {"name": "StealSeek", "url": "https://stealseek.io/", "description": "Powerful search engine designed to help you find and analyze data breaches."}, {"name": "Venacus", "url": "https://venacus.com/", "description": "Search for your data breaches and get notified when your data is compromised."}, {"name": "2lingual Search", "url": "http://www.2lingual.com", "description": ""}, {"name": "Abusech", "url": "https://hunting.abuse.ch", "description": "Hunt across all abuse.ch platforms with one simple query"}, {"name": "Abuseipdb", "url": "https://www.abuseipdb.com/", "description": "Repository of abuses reported by system administrators for IPs, Domains, and subnets"}, {"name": "BeVigil", "url": "https://bevigil.com/search", "description": "Search for assets like Subdomains, URLs, Parameters in mobile applications"}, {"name": "BGP.tools", "url": "https://bgp.tools", "description": "Modern BGP toolkit for network reconnaissance and analysis."}, {"name": "BGP.he.net", "url": "https://bgp.he.net", "description": "Free BGP and network intelligence toolkit"}, {"name": "Biznar", "url": "http://biznar.com", "description": ""}, {"name": "BrightCloud", "url": "https://brightcloud.com/tools/url-ip-lookup.php", "description": "Checks the reputation, category, and potential threats associated with a URL or IP address."}, {"name": "Browserleaks", "url": "https://browserleaks.com/", "description": "BrowserLeaks tests your browser for privacy and fingerprinting leaks"}, {"name": "Censys", "url": "https://search.censys.io/", "description": "Searcher that monitors and analyzes devices."}, {"name": "CertKit Certificate Search", "url": "https://www.certkit.io/tools/ct-logs/", "description": "Fast search for public SSL/TLS certificate records."}, {"name": "Cisco Talos Intelligence", "url": "https://talosintelligence.com/reputation_center", "description": "IP and Domain Reputation Center for real-time threat detection"}, {"name": "CiteSeerX", "url": "http://citeseer.ist.psu.edu", "description": ""}, {"name": "Cloudflare Radar", "url": "https://radar.cloudflare.com", "description": "Internet traffic patterns, attacks, and technology trends."}, {"name": "Criminal IP", "url": "https://www.criminalip.io/", "description": "Cyber Threat Intelligence Search Engine and Attack Surface Management(ASM) platform"}, {"name": "CRT Certificate Search", "url": "https://crt.sh", "description": "Allows you to search for public SSL/TLS certificates recorded in Certificate Transparency logs"}, {"name": "FOFA", "url": "https://en.fofa.info/", "description": "Asset search and analysis tool."}, {"name": "FullHunt", "url": "https://fullhunt.io/", "description": "FullHunt identifies and secures your External Attack Surface."}, {"name": "Google Custom Search", "url": "http://www.google.com/cse", "description": ""}, {"name": "GrayhatWarfare", "url": "https://grayhatwarfare.com/", "description": "Searches and indexes open Amazon S3 buckets, allowing users to find and explore potentially exposed data."}, {"name": "GreyNoise", "url": "https://viz.greynoise.io/", "description": "Search Exposed Internet assets, Malicious IP's."}, {"name": "Harmari (Unified Listings Search)", "url": "https://www.harmari.com/search/unified", "description": ""}, {"name": "Hunter Search Engine", "url": "https://hunter.how/", "description": "Search Exposed Internet assets, open web directories and many more."}, {"name": "Intelligence X", "url": "https://intelx.io/tools", "description": "Paid OSINT Tool Allowing users to search for information across various sources including the dark web and public data leaks."}, {"name": "Internet Archive", "url": "https://archive.org/", "description": ""}, {"name": "Islegitsite", "url": "https://www.islegitsite.com/", "description": "Checks if a website is trustworthy by analyzing its reputation, domain, and security based on public sources."}, {"name": "MalwareBazaar", "url": "https://bazaar.abuse.ch/browse/", "description": "Search and download confirmed malware samples by hash, family, tag, and other criteria."}, {"name": "Mamont", "url": "https://www.mmnt.ru/", "description": ""}, {"name": "Million Short", "url": "https://millionshort.com", "description": ""}, {"name": "Netlas.io", "url": "https://app.netlas.io/", "description": ""}, {"name": "ODIN", "url": "https://search.odin.io/", "description": "Used to search for Hosts, CVEs & Exposed Buckets/Files and shows a website is vulnerable or not. 10 Free Searches Per Day."}, {"name": "OCCRP Aleph", "url": "https://aleph.occrp.org/", "description": ""}, {"name": "ONYPHE", "url": "https://search.onyphe.io/", "description": "OSINT engine indexing exposed assets and services across the internet."}, {"name": "Search Abuseipdb", "url": "https://github.com/oseasfr/search-abuseipdb", "description": "Tool to query IPs, ranges and ASN blocks in AbuseIPDB via API with CIDR notation.", "stars": "3"}, {"name": "Shadowserver", "url": "https://dashboard.shadowserver.org/", "description": "Dashboard with global statistics on cyber threats collected by the Shadowserver Foundation."}, {"name": "Shodan", "url": "https://www.shodan.io/", "description": "Shodan is a search engine for the IOT(Internet of Things) that allows you to search variety of servers that are connected to the internet using various searching filters."}, {"name": "SikkerAPI", "url": "https://www.sikkerapi.com/", "description": "SikkerAPI is a free IP and threat intelligence provider, that publishes IP reputation scores, behavioral data and full attack sessions across 16+ different protocols."}, {"name": "WIPO", "url": "https://www3.wipo.int/branddb/en/", "description": ""}, {"name": "WorldWideScience.org", "url": "http://worldwidescience.org", "description": ""}, {"name": "Wpscan", "url": "https://wpscan.com", "description": "Scan your WordPress site and get an instant report on its security."}, {"name": "YARAif", "url": "https://yaraify.abuse.ch/scan/", "description": "Collaborative YARA engine providing open threat intelligence through file pattern matching."}, {"name": "Zanran", "url": "http://zanran.com", "description": ""}, {"name": "ZoomEye", "url": "https://www.zoomeye.ai/", "description": "ZoomEye is a cyberspace search engine for IPs, domains, internet asset discovery, and exposure analysis of servers, routers, and webcams."}, {"name": "Ahmia", "url": "https://ahmia.fi", "description": ""}, {"name": "Aleph Open Search", "url": "https://open-search.aleph-networks.eu", "description": ""}, {"name": "Carrot2", "url": "https://search.carrot2.org", "description": "Organizes your search results into topics."}, {"name": "Zapmeta", "url": "http://www.zapmeta.com", "description": ""}, {"name": "SimilarSites", "url": "http://www.similarsites.com", "description": "Discover websites that are similar to each other"}, {"name": "SitesLike", "url": "http://www.siteslike.com", "description": "Find similar websites by category"}, {"name": "DocumentCloud", "url": "https://www.documentcloud.org", "description": "Platform for analyzing, annotating, and publishing documents."}, {"name": "Epstein Exposed", "url": "https://epsteinexposed.com", "description": "Comprehensive searchable database of 2M+ DOJ Epstein case documents, 1,700+ persons, flight logs, emails, and network graph visualization."}, {"name": "Find-pdf-doc", "url": "http://www.findpdfdoc.com", "description": ""}, {"name": "Free Full PDF", "url": "http://www.freefullpdf.com", "description": ""}, {"name": "Offshore Leak Database", "url": "https://offshoreleaks.icij.org", "description": ""}, {"name": "RECAP Archive", "url": "https://www.courtlistener.com/recap/", "description": "Public archive of PACER court documents."}, {"name": "Scribd", "url": "http://www.scribd.com", "description": ""}, {"name": "SlideShare", "url": "http://www.slideshare.net", "description": ""}, {"name": "APT Groups and Operations", "url": "https://docs.google.com/spreadsheets/u/0/d/1H9_xaxQHpWaa4O_Son4Gx0YOIzlcBWMsdvePFX68EKU/pubhtml?pli=1#", "description": "Know about Threat Actors, sponsored countries, their tools, methods, etc."}, {"name": "APTWiki", "url": "https://apt.threatradar.net/", "description": "Historical wiki with 214 actor entries."}, {"name": "Bi.Zone", "url": "https://gti.bi.zone/", "description": "148 threat groups with detailed TTPs."}, {"name": "BreachHQ", "url": "https://breach-hq.com/threat-actors", "description": "Provides a list of all known cyber threat actors also referred to as malicious actors, APT groups or hackers."}, {"name": "Cybergeist", "url": "https://cybergeist.io/threat-actor", "description": "Cybergeist.io generates intelligence profiles about key threats and threat context that is actively being discussed and reported upon across the internet."}, {"name": "Dark Web Informer", "url": "https://darkwebinformer.com/threat-actor-database/", "description": "Tracking 854 Threat Actors as of 29th of May 2025."}, {"name": "ETDA", "url": "https://apt.etda.or.th/cgi-bin/listgroups.cgi", "description": "Search for Threat Actor groups and their tools."}, {"name": "FortiGuard Labs", "url": "https://www.fortiguard.com/threat-actor", "description": "Powered by FortiGuard Labs, our Threat Actor Encyclopedia provides actionable insights, helping security teams prepare and streamline advanced threat hunting and response."}, {"name": "KNOWLEDGENOW", "url": "https://know.netenrich.com/content/track/threat-actor", "description": "Trending Threats."}, {"name": "lazarusholic", "url": "https://lazarus.day/actors/", "description": "Total 203 threat actors."}, {"name": "Malpedia", "url": "https://malpedia.caad.fkie.fraunhofer.de/actors", "description": "Get List of threat actor groups."}, {"name": "MISP Galaxy", "url": "https://www.misp-galaxy.org/360net/", "description": "Known or estimated adversary groups as identified by 360.net."}, {"name": "OPENHUNTING.IO", "url": "https://openhunting.io/threat-library", "description": "Threat Library Collecting Information."}, {"name": "SOCRadar LABS", "url": "https://socradar.io/labs/threat-actor/", "description": "Know threat actor tactics, techniques, and past activities. Access detailed profiles and track their activities.Keep up with the latest threats and Tactics, Techniques, and Procedures (TTPs)."}, {"name": "Thales", "url": "https://cds.thalesgroup.com/en/cyberthreat/attacks-page", "description": "Find Threat actor groups in a graphical attack explorer."}, {"name": "Bitdefender Threat Map", "url": "https://threatmap.bitdefender.com/", "description": "Cyberthreat Real Time Map by Bitdefender."}, {"name": "BunkerWeb Live Cyber Attack Threat Map", "url": "https://threatmap.bunkerweb.io/", "description": "Live cyber attack blocked by BunkerWeb, the open source and next generation Web Application Firewall."}, {"name": "Check Point Live Cyber Threat Map", "url": "https://threatmap.checkpoint.com/", "description": "Explore the top cyber threats of 2025, including ransomware, infostealers, and cloud vulnerabilities."}, {"name": "Cisco Talos Intelligence", "url": "https://talosintelligence.com/ebc_spam", "description": ""}, {"name": "Fortiguard Labs", "url": "https://fortiguard.fortinet.com/threat-map", "description": "FortiGuard Outbreak Alerts provides key information about on-going cybersecurity attack with significant ramifications affecting numerous companies, organizations and industries."}, {"name": "HCL Threat Map", "url": "https://www.hcltech.com/hcl-threat-map", "description": "Cyber Threat Map by HCLTech."}, {"name": "IBM X-Force Exchange Current Malicious Activity", "url": "https://exchange.xforce.ibmcloud.com/activity/map", "description": ""}, {"name": "Imperva Live Threat Map", "url": "https://www.imperva.com/cyber-threat-attack-map/", "description": "A real-time global view of DDoS attacks, hacking attempts, and bot assaults mitigated by Imperva security services."}, {"name": "Kaspersky Cyberthreat live Map", "url": "https://cybermap.kaspersky.com/", "description": "Find out if you are under cyber-attack here."}, {"name": "LIONIC Cyber Threat Map", "url": "https://www.lionic.com/monitoring/", "description": ""}, {"name": "NETSCOUT Cyber Threat Map", "url": "https://horizon.netscout.com/", "description": "Real-Time DDoS Attack Map"}, {"name": "Radware Live Cyber Threat Map", "url": "https://livethreatmap.radware.com/", "description": "Radware's Live Threat Map presents near real-time information about cyberattacks as they occur, based on our global threat deception network."}, {"name": "Secure Gateway Live Cyber Threat Map", "url": "https://securegateway.com/map/v5/", "description": ""}, {"name": "Thale's Cyberthreat Map", "url": "https://cds.thalesgroup.com/en/cyberthreat/hitmap", "description": "Discover cybersecurity trends with Thales' Cyberthreat map. Explore targeted areas, frequent attacks, affected sectors, and prevalent malware."}, {"name": "ThreatsEye | Live Cyber Threat Map", "url": "https://threatseye.io/threats-map", "description": "Real-time visualization of global cyber attacks and threats. Monitor live cyber security incidents, attack origins, targets, and threat categories worldwide."}, {"name": "World Monitor Tech", "url": "https://tech.worldmonitor.app", "description": "Live cyber threat intelligence dashboard combining CISA advisories, active malware campaigns, CVE feeds, and global cyber event heatmaps alongside geopolitical and military context."}, {"name": "Zscaler Global Threat Map Dashboard", "url": "https://threatlabz.zscaler.com/cloud-insights/threat-map-dashboard", "description": "Illustrates those we've seen in the past 24 hours, consisting of threats detected by our antivirus engines, malware and advanced persistent threats."}, {"name": "eyedex", "url": "https://www.eyedex.org/", "description": "Open directory search engine."}, {"name": "de digger", "url": "https://www.dedigger.com/", "description": "is a website that allows you to find any types of files that are publicly available in a Google Drive."}, {"name": "FileListing", "url": "https://filelisting.com/", "description": ""}, {"name": "FilePursuit", "url": "https://filepursuit.com/", "description": ""}, {"name": "Filesec.io", "url": "https://filesec.io/", "description": "Central resource cataloging malicious file extensions, their risks, OS and mitigations."}, {"name": "Meawfy", "url": "https://meawfy.com/", "description": "Advanced Mega.nz File Search Engine. Search and discover files from Mega.nz with our intelligent crawler technology. Access over 9 million indexed files instantly."}, {"name": "NAPALM FTP Indexer", "url": "https://www.searchftps.net/", "description": ""}, {"name": "ODCrawler", "url": "https://odcrawler.xyz/", "description": "A search engine for open directories. Find millions of publicly available files!"}, {"name": "SearchFiles.de", "url": "https://searchfiles.de/", "description": ""}, {"name": "BeanPaste", "url": "https://beanpaste.fun/", "description": "A tiny way to share text."}, {"name": "bpaste", "url": "https://bpa.st/", "description": "Welcome to bpaste, this site is a pastebin. It allows you to share code with others."}, {"name": "CentOS Pastebin Service", "url": "https://paste.centos.org/", "description": "Stikked is an Open-Source PHP Pastebin, with the aim of keeping a simple and easy to use user interface."}, {"name": "cl1p", "url": "https://Cl1p.net", "description": "The Internet Clipboard."}, {"name": "commie", "url": "https://commie.io/", "description": "commie is a pastebin script with line commenting support."}, {"name": "Context", "url": "https://ctxt.io/", "description": "Share whatever you see with others in seconds."}, {"name": "ControlC Pastebin", "url": "https://Controlc.com", "description": "The easiest way to host your text."}, {"name": "Cryptobin", "url": "https://cryptobin.co/", "description": "The Ultimate Secure Pastebin"}, {"name": "Cutapaste", "url": "https://cutapaste.net/", "description": "Short Code and Share."}, {"name": "Defuse", "url": "https://defuse.ca/pastebin.htm", "description": "Encrypted Pastebin - Keep your data private and secure!"}, {"name": "doxbin", "url": "https://doxbin.net/", "description": "A dox style pastebin ran by hackers."}, {"name": "dpaste2", "url": "https://Dpaste.org", "description": ""}, {"name": "dpaste", "url": "https://Dpaste.com", "description": ""}, {"name": "Etusivu", "url": "https://pastebin.fi/", "description": "It's an open source clone of pastebin.com. Default Language is Finnish."}, {"name": "Friendpaste", "url": "https://friendpaste.com/", "description": "Paste stuff to your friends."}, {"name": "GitHub gist", "url": "https://gist.github.com", "description": ""}, {"name": "HashBin", "url": "https://hashb.in/#Q===", "description": "HashBin is a paste bin that never sees the contents of its pastes."}, {"name": "hastebin", "url": "https://www.toptal.com/developers/hastebin/", "description": ""}, {"name": "ideone", "url": "https://Ideone.com", "description": ""}, {"name": "ivpaste", "url": "https://Ivpaste.com", "description": ""}, {"name": "jsbin", "url": "https://Jsbin.com", "description": ""}, {"name": "justpaste", "url": "https://Justpaste.it", "description": ""}, {"name": "Katbin", "url": "https://katb.in", "description": "Small, lightweight pastebin."}, {"name": "Linkode(alpha)", "url": "https://linkode.org/", "description": "Linkode is the useful pastebin!"}, {"name": "Logpasta", "url": "https://logpasta.com/", "description": "Simple, secure log paste service. Command line mode based."}, {"name": "lesma.eu", "url": "https://lesma.eu/", "description": "Simple paste app friendly with browser and command line."}, {"name": "Nachricht", "url": "https://nachricht.co/", "description": "With Nachricht.co you can send self-destructive and encrypted one-way messages over the Internet. You don't even need to miss out the messenger or social network of your choice. We are an independent, secure and fully free service!"}, {"name": "NoPaste", "url": "https://nopaste.boris.sh/", "description": "NoPaste is an open-source website similar to Pastebin where you can store any piece of code, and generate links for easy sharing."}, {"name": "nopaste.net", "url": "https://nopaste.net/", "description": "nopaste.net is a temporary file host, nopaste and clipboard across machines. You can upload files or text and share the link with others."}, {"name": "Notes", "url": "https://notes.io/", "description": "fast.easy.short."}, {"name": "nekobin", "url": "https://nekobin.com/", "description": "Paste code, save and share the link!"}, {"name": "New Paste", "url": "https://paste1.com/", "description": "I wanna paste because typing is so boring!"}, {"name": "n0paste", "url": "https://n0paste.eu/", "description": "Paste and share your code online."}, {"name": "OTS- One Time Secrets", "url": "https://ots.hackliberty.org/", "description": "An encrypted pastebin site. No login needed!"}, {"name": "paaster", "url": "https://paaster.io/", "description": "Paaster is a secure and user-friendly pastebin application that prioritizes privacy and simplicity. With end-to-end encryption and paste history, Paaster ensures that your pasted code remains confidential and accessible."}, {"name": "PastBin.net", "url": "https://pastbin.net/", "description": "Similar to Pastebin website where you can store code/text online for a set period of time and share to anyone anywhere. Search Option Available."}, {"name": "Pastebin", "url": "https://pastebin.pl/", "description": "Store code/text online for a set period of time and share to anybody on earth."}, {"name": "Pastebin.cz", "url": "https://www.pastebin.cz/en/", "description": "A simple Pastebin."}, {"name": "Paste.Cash", "url": "https://www.paste.cash/", "description": "Paste.CASH Is a privacy respected and encrypted pastebin hosted by Cash Hosting. Every paste are encrypted using 256 bits AES."}, {"name": "paste.centos", "url": "https://paste.centos.org", "description": ""}, {"name": "paste.debian", "url": "https://Paste.debian.net", "description": ""}, {"name": "paste.in.ua", "url": "https://paste.in.ua/", "description": "Simple pastebin."}, {"name": "paste.kde", "url": "https://Paste.kde.org", "description": ""}, {"name": "Paste.Monster", "url": "https://paste.monster/", "description": "Share your thoughts online. API Available."}, {"name": "paste.ubuntu", "url": "https://paste.ubuntu.com", "description": ""}, {"name": "Paste.Quest", "url": "https://pastequest.com/", "description": "Copy and Paste text online to share with anyone anywhere. Use the password option to add a password to the pasted information."}, {"name": "Pastery", "url": "https://www.pastery.net/", "description": "The sweetest pastebin in the world!"}, {"name": "PasteSite.Net", "url": "https://pastesite.net/", "description": "The new generation pastebin."}, {"name": "paste.sh", "url": "https://paste.sh/", "description": "This is an encrypted paste site. Simply type or paste code here and share the URL. Saving is Automatic."}, {"name": "PasteShr", "url": "https://www.pasteshr.com/", "description": "Store any text online for easy sharing. Search option available!"}, {"name": "Pastebin - Tor Link", "url": "https://tor.link/paste/new", "description": "Paste text to store or share with others."}, {"name": "Rentry", "url": "https://rentry.co/", "description": "Rentry.co is a markdown paste service service with preview, custom urls and editing. Fast, simple and free."}, {"name": "SafeNote", "url": "https://safenote.co/", "description": "SafeNote is a free web-based service that allows you to share a note or a file with confidentiality. There is no way to spying on you even to a hacker."}, {"name": "scrt.link", "url": "https://scrt.link/", "description": "Share a Secret with a link that only works one time and then self-destructs."}, {"name": "snippet.host", "url": "https://snippet.host/", "description": "Minimal text and code snippet hosting."}, {"name": "Spacebin", "url": "https://spaceb.in/", "description": "Spacebin is a modern Pastebin server implemented in Go and is capable of serving notes, novels, code, or any other form of text."}, {"name": "TextBin", "url": "https://textbin.net/", "description": "Secure pastebin where you can paste and store any type of text or code snippets online and share it with your friends."}, {"name": "Textbin-Code", "url": "https://textbin.online/", "description": "SECURE YOUR CODE!"}, {"name": "TutPaste", "url": "https://tutpaste.com/", "description": "Welcome to our fast and free online paste tool. Paste and share your text or code snippets with anyone, anywhere, no registration required."}, {"name": "vaultbin", "url": "https://vaultb.in/", "description": "Vaultbin is a blazingly fast and secure alternative to Pastebin and Hastebin."}, {"name": "Verybin", "url": "https://www.verybin.com/", "description": "Anonymous and encrypted pastebin. Data is encrypted/decrypted in the browser using 256 bits AES and no IP address logged."}, {"name": "Write.as", "url": "https://write.as/", "description": "Type words, put them on the internet."}, {"name": "ZBin", "url": "https://zbin.dev/", "description": "Private & Secure Pastebin."}, {"name": "ZeroBin", "url": "https://sebsauvage.net/paste/", "description": "ZeroBin is a minimalist, opensource online pastebin where the server has zero knowledge of pasted data. Data is encrypted/decrypted in the browser using 256 bits AES."}, {"name": "AnalyzeID", "url": "https://analyzeid.com/", "description": "Find Other Websites Owned By The Same Person"}, {"name": "Code Finder", "url": "https://codefinder.dev/", "description": "The ultimate search engine for finding GitHub repositories"}, {"name": "GitHub Code Search", "url": "https://github.com/search?type=code", "description": "GitHub's enhanced code search with advanced filtering."}, {"name": "grep.app", "url": "https://grep.app/", "description": "Searches code from the entire github public repositories for a given specific string or using regular expression."}, {"name": "NerdyData", "url": "https://nerdydata.com", "description": "Search engine for source code."}, {"name": "PublicWWW", "url": "https://publicwww.com/", "description": ""}, {"name": "Reposearch", "url": "http://codefinder.org/", "description": ""}, {"name": "SearchCode", "url": "https://searchcode.com", "description": "Help find real world examples of functions, API's and libraries across 10+ sources."}, {"name": "Sourcebot", "url": "https://www.sourcebot.dev/", "description": "Index thousands of repos on your machine and search through them in a fast, powerful, and modern web interface."}, {"name": "SourceGraph", "url": "https://sourcegraph.com/search", "description": "Search code from millions of open source repositories."}, {"name": "Bluesky", "url": "https://bsky.app", "description": "Decentralized social network built on the AT Protocol."}, {"name": "Draugiem (Latvia)", "url": "https://www.draugiem.lv", "description": ""}, {"name": "Facebook", "url": "http://www.facebook.com", "description": ""}, {"name": "Instagram", "url": "https://www.instagram.com", "description": ""}, {"name": "Linkedin", "url": "https://www.linkedin.com", "description": ""}, {"name": "Mixi (Japan)", "url": "https://mixi.jp", "description": ""}, {"name": "Odnoklassniki (Russia)", "url": "http://ok.ru", "description": ""}, {"name": "Pinterest", "url": "http://www.pinterest.com", "description": "is an image sharing social media service used to easly discover, share and save ideas using visual representation."}, {"name": "Qzone (China)", "url": "http://qzone.qq.com", "description": ""}, {"name": "Reddit", "url": "https://www.reddit.com", "description": ""}, {"name": "Taringa (Latin America)", "url": "http://www.taringa.net", "description": ""}, {"name": "Threads", "url": "https://www.threads.net", "description": "Text-based conversation app from Meta."}, {"name": "Tinder", "url": "https://www.gotinder.com", "description": ""}, {"name": "Tumblr", "url": "https://www.tumblr.com", "description": ""}, {"name": "Twitter", "url": "https://twitter.com", "description": ""}, {"name": "Weibo (China)", "url": "http://weibo.com", "description": ""}, {"name": "VKontakte", "url": "https://vk.com", "description": ""}, {"name": "Xing", "url": "https://www.xing.com", "description": ""}, {"name": "Audiense", "url": "https://www.audiense.com", "description": "Tool to identify relevant audience, discover actionable insights and inform strategies to grow your business."}, {"name": "Bottlenose", "url": "http://bottlenose.com", "description": ""}, {"name": "Brandwatch", "url": "https://www.brandwatch.com", "description": ""}, {"name": "Buffer", "url": "https://buffer.com", "description": ""}, {"name": "Buzz sumo", "url": "http://buzzsumo.com", "description": "\"Use our content insights to generate ideas, create high-performing content, monitor your performance and identify influencers.\""}, {"name": "Castrick", "url": "https://castrickclues.com", "description": "Find social media accounts with email, username and phone number"}, {"name": "Epieos", "url": "https://epieos.com", "description": "Search for social accounts with e-mail and phone"}, {"name": "Geocreepy", "url": "http://www.geocreepy.com", "description": ""}, {"name": "Hootsuite", "url": "http://hootsuite.com", "description": ""}, {"name": "IDCrawl", "url": "https://www.idcrawl.com/", "description": "Search for a name in popular social networks."}, {"name": "Klear", "url": "http://klear.com", "description": ""}, {"name": "Kribrum", "url": "https://kribrum.io/", "description": ""}, {"name": "Mail.Ru Social Network Search", "url": "https://go.mail.ru/search_social", "description": ""}, {"name": "MustBePresent", "url": "http://mustbepresent.com", "description": ""}, {"name": "Netvibes", "url": "http://www.netvibes.com", "description": ""}, {"name": "Oblivion", "url": "https://github.com/loseys/Oblivion", "description": "", "stars": "589"}, {"name": "OpinionCrawl", "url": "http://www.opinioncrawl.com", "description": ""}, {"name": "Predicta Search", "url": "https://predictasearch.com", "description": "Search for social accounts with e-mail and phone"}, {"name": "Rival IQ", "url": "https://www.rivaliq.com", "description": ""}, {"name": "Social DownORNot", "url": "http://social.downornot.com", "description": ""}, {"name": "Social Searcher", "url": "http://www.social-searcher.com", "description": ""}, {"name": "SocialBakers", "url": "http://www.socialbakers.com", "description": ""}, {"name": "SocialBlade", "url": "http://socialblade.com", "description": ""}, {"name": "Tagboard", "url": "https://tagboard.com", "description": ""}, {"name": "UVRX", "url": "http://www.uvrx.com/social.html", "description": ""}, {"name": "WATools", "url": "https://watools.io/", "description": ""}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Twitter", "entries": [{"name": "ExportData", "url": "https://www.exportdata.io/", "description": "Data export tool for historical tweets, followers & followings and historical trends."}, {"name": "Foller.me", "url": "http://foller.me", "description": ""}, {"name": "MyTweetAlerts", "url": "https://www.mytweetalerts.com/", "description": "A tool to create custom email alerts based on Twitter search."}, {"name": "OneMillionTweetMap", "url": "http://onemilliontweetmap.com", "description": ""}, {"name": "RiteTag", "url": "https://ritetag.com", "description": ""}, {"name": "Sentiment140", "url": "http://www.twittersentiment.appspot.com", "description": ""}, {"name": "Tagdef", "url": "https://tagdef.com", "description": ""}, {"name": "Trends24", "url": "http://trends24.in", "description": ""}, {"name": "TwChat", "url": "http://twchat.com", "description": ""}, {"name": "TweetMap", "url": "http://mapd.csail.mit.edu/tweetmap", "description": ""}, {"name": "TweetMap", "url": "http://worldmap.harvard.edu/tweetmap", "description": ""}, {"name": "Twitter Advanced Search", "url": "https://twitter.com/search-advanced?lang=en", "description": ""}, {"name": "Twitter Audit", "url": "https://www.twitteraudit.com", "description": ""}, {"name": "Twitter Chat Schedule", "url": "http://tweetreports.com/twitter-chat-schedule", "description": ""}, {"name": "Twitter Search", "url": "http://search.twitter.com", "description": ""}, {"name": "Xquik", "url": "https://xquik.com", "description": "Real-time X (Twitter) data platform for tweet search, user lookup, follower/following extraction, engagement metrics, account monitoring, reply/retweet/quote extraction, community & Space data, and mutual follow checks."}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Facebook", "entries": [{"name": "Facebook Friend List Scraper", "url": "https://github.com/narkopolo/fb_friend_list_scraper", "description": "Tool for scraping large Facebook friend lists without being rate-limited.", "stars": "314"}, {"name": "Facebook Search", "url": "http://search.fb.com/", "description": ""}, {"name": "Fanpage Karma", "url": "http://www.fanpagekarma.com", "description": ""}, {"name": "Fb-sleep-stats", "url": "https://github.com/sqren/fb-sleep-stats", "description": "Use Facebook to track your friends\u2019 sleeping habits.", "stars": "1.7k"}, {"name": "Find my Facebook ID", "url": "https://randomtools.io", "description": "To find your Facebook personal numeric ID for facebook graph API operations, fb:admins, social plugins."}, {"name": "haveibeenzuckered", "url": "https://haveibeenzuckered.com/", "description": "A large dataset containing 533 million Facebook accounts was made available for download. The data was obtained by exploiting a vulnerability that was, according to Facebook, corrected in August 2019. Check if a telephone number is present within the Facebook data breach."}, {"name": "Lookup-ID.com", "url": "https://lookup-id.com", "description": "Looking for your Facebook profile ID / Group ID / Page ID."}, {"name": "SearchIsBack", "url": "https://searchisback.com", "description": ""}, {"name": "Wolfram Alpha Facebook Report", "url": "http://www.wolframalpha.com/input/?i=facebook+report", "description": ""}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Instagram", "entries": [{"name": "Dolphin Radar", "url": "https://www.dolphinradar.com/web-viewer-for-instagram", "description": "An Instagram Post Viewer lets you view posts, stories, and profiles from public accounts with ease. Free viewer limit: 1."}, {"name": "Iconosquare", "url": "http://iconosquare.com", "description": ""}, {"name": "instagram\\_monitor", "url": "https://github.com/misiektoja/instagram_monitor", "description": "Tool for real-time tracking of Instagram users' activities and profile changes with support for email alerts, CSV logging, showing media in the terminal, anonymous story downloads and more", "stars": "827"}, {"name": "InstagramPrivSniffer", "url": "https://github.com/obitouka/InstagramPrivSniffer", "description": "Views Instagram PRIVATE ACCOUNT'S media without login \ud83d\ude31.", "stars": "730"}, {"name": "Osintgram", "url": "https://github.com/Datalux/Osintgram", "description": "Osintgram offers an interactive shell to perform analysis on Instagram account of any users by its nickname.", "stars": "13k"}, {"name": "Osintgraph", "url": "https://github.com/XD-MHLOO/Osintgraph", "description": "Tool that maps your target\u2019s Instagram data and relationships in Neo4j for social network analysis.", "stars": "674"}, {"name": "Toutatis", "url": "https://github.com/megadose/toutatis", "description": "a tool that allows you to extract information from instagrams accounts such as s, phone numbers and more", "stars": "3.8k"}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Pinterest", "entries": [{"name": "Pingroupie", "url": "http://pingroupie.com", "description": ""}, {"name": "Pinterest Pin Stats", "url": "https://chromewebstore.google.com/detail/pinterest-pin-stats-sort/mcmkeopcpbfgjlakblglpcccpodbjkel", "description": "Display hidden Pinterest stats for each pin."}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Reddit", "entries": [{"name": "Arctic Shift", "url": "https://github.com/ArthurHeitmann/arctic_shift", "description": "A tool for accessing and interacting with large dumps of Reddit data, offering an API and web interface for research and moderation purposes.", "stars": "879"}, {"name": "Imgur", "url": "http://imgur.com/search?q=", "description": "The most popular image hosting website used by redditors."}, {"name": "Mostly Harmless", "url": "http://kerrick.github.io/Mostly-Harmless/#features", "description": "Mostly Harmless looks up the page you are currently viewing to see if it has been submitted to reddit."}, {"name": "Pushshift API", "url": "https://pushshift.io/", "description": "A powerful API that provides access to historical Reddit data, including posts, comments, and metadata for analysis and research\u2014more information [here](https://www.reddit.com/r/pushshift/)."}, {"name": "Pullpush", "url": "https://pullpush.io/", "description": "PullPush is a service for the indexing and retrieval of content that Reddit users have submitted to Reddit. Helpful for finding deleted/removed posts & comments."}, {"name": "REDARCS", "url": "https://the-eye.eu/redarcs/", "description": "Reddit archives 2005-2023."}, {"name": "Reddit Archive", "url": "http://www.redditarchive.com", "description": "Historical archives of reddit posts."}, {"name": "Reddit Suite", "url": "https://chrome.google.com/webstore/detail/reddit-enhancement-suite/kbmfpngjjgdllneeigpgjifpgocmfgmb", "description": "Enhances your reddit experience."}, {"name": "Reddit User Analyser", "url": "https://atomiks.github.io/reddit-user-analyser/", "description": "reddit user account analyzer."}, {"name": "RedditMetis", "url": "https://redditmetis.com/", "description": "RedditMetis is a Reddit user analysis tool to see the summary and statistics for a Reddit account, including top posts and user activity etc."}, {"name": "Subreddits", "url": "http://subreddits.org", "description": "Discover new subreddits."}, {"name": "Reddit Comment Search", "url": "https://redditcommentsearch.com/", "description": "Analyze a reddit users by comment history."}, {"name": "Universal Scammer List", "url": "https://universalscammerlist.com/", "description": "This acts as the website-portion for the subreddit /r/universalscammerlist. That subreddit, in conjuction with this website and a reddit bot, manages a list of malicious reddit accounts and minimizes the damage they can deal. This list is referred to as the \"USL\" for short."}, {"name": "Reddit Comment Lookup", "url": "https://randomtools.io/reddit-comment-search/", "description": "Search for reddit comments by reddit username."}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) VKontakte", "entries": [{"name": "\u0414\u0435\u0437\u0435\u0440\u0442\u0438\u0440", "url": "http://vk.com/app3046467", "description": ""}, {"name": "Barkov.net", "url": "http://vk.barkov.net", "description": ""}, {"name": "VK5", "url": "http://vk5.city4me.com", "description": ""}, {"name": "VK Community Search", "url": "http://vk.com/communities", "description": ""}, {"name": "VK People Search", "url": "http://vk.com/people", "description": ""}, {"name": "VK.watch", "url": "https://vk.watch/", "description": ""}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) WhatsApp", "entries": [], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Tumblr", "entries": [{"name": "Tumblr Search", "url": "http://www.tumblr.com/search", "description": ""}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) LinkedIn", "entries": [{"name": "the-endorser", "url": "https://github.com/eth0izzle/the-endorser", "description": "Tool that allows you to draw out relationships between people on LinkedIn via endorsements/skills.", "stars": "349"}, {"name": "LinkedInDumper", "url": "https://github.com/l4rm4nd/LinkedInDumper", "description": "Script to dump/scrape/extract company employees info from LinkedIn API.", "stars": "578"}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Telegram", "entries": [{"name": "CCTV", "url": "https://github.com/IvanGlinkin/CCTV", "description": "Close-Circuit Telegram Vision revolutionizes location tracking with its open-source design and Telegram API integration. Offering precise tracking within 50-100 meters, users can monitor others in real-time for logistics or safety, redefining how we navigate our surroundings.", "stars": "2.5k"}, {"name": "GroupDa", "url": "https://groupda.com/telegram/group/search", "description": "Can be used for Searching Telegram Channels. Search by Category, Countries and Language."}, {"name": "Maltego Telegram", "url": "https://github.com/vognik/maltego-telegram", "description": "Rich Set of Entities & Transforms for OSINT on Telegram with Maltego.", "stars": "437"}, {"name": "Telegram Finder", "url": "https://www.telegram-finder.io/", "description": "A tool to find Telegram users by their phone number, linkedin url or email."}, {"name": "Telerecon", "url": "https://github.com/sockysec/Telerecon", "description": "A reconnaissance framework for researching and investigating Telegram.", "stars": "1.3k"}, {"name": "TgramSearch", "url": "https://tgramsearch.com/", "description": "Convenient search for Telegram channels, as well as a structured catalog with over 700000 Telegram channels. Available in 8+ Languages."}, {"name": "tgworld", "url": "https://tg.world/", "description": "The Global Search System TG.World will help you find Channels, Groups and Bots in Telegram in any language and for any country in the world!"}, {"name": "Telegram Channel Joiner", "url": "https://github.com/spmedia/Telegram-Channel-Joiner", "description": "grow your Free and Premium Telegram accounts easily with this channel joiner script.", "stars": "11"}, {"name": "Telepahty", "url": "https://github.com/proseltd/Telepathy-Community", "description": "Telepathy is a tool that archives Telegram chats and analyzes communication patterns within the app. By providing insights into user interactions, message frequency, and content trends, Telepathy helps investigators understand the dynamics and relationships within Telegram groups and channels.", "stars": "1.2k"}, {"name": "Teleteg", "url": "https://teleteg.com/", "description": "The ultimate Telegram search engine. 10 results for free plan."}, {"name": "Telegago", "url": "https://cse.google.com/cse?q=+\\&cx=006368593537057042503:efxu7xprihg#gsc.tab=0\\&gsc.q=%20\\&gsc.page=1", "description": "A Google Advanced Search specifically for finding public and private Telegram Channels and Chatrooms."}, {"name": "Telegram Nearby Map", "url": "https://github.com/tejado/telegram-nearby-map", "description": "Webapp based on OpenStreetMap and the official Telegram library to find the position of nearby users.", "stars": "1.2k"}, {"name": "Telegram channels scraper TeleGraphite", "url": "https://github.com/hamodywe/telegram-scraper-TeleGraphite", "description": "Telegram Scraper & JSON Exporter & telegram channels scraper.", "stars": "273"}, {"name": "TeleSearch", "url": "https://telesearch.me/", "description": "Search and find your desired Telegram channels, groups, bots and games quickly and easily with Telesearch\u200b."}, {"name": "TeleTracker", "url": "https://github.com/tsale/TeleTracker", "description": "TeleTracker is a simple set of Python scripts designed for anyone investigating Telegram channels. It helps you send messages quickly and gather useful channel information easily.", "stars": "527"}, {"name": "TOsint", "url": "https://github.com/drego85/tosint", "description": "Tosint (Telegram OSINT) is a powerful tool designed to extract valuable information from Telegram bots and channels. It serves as an essential resource for security researchers, investigators, and anyone interested in gathering insights from various Telegram entities.", "stars": "815"}, {"name": "AgentFNS\\_Bot", "url": "https://t.me/AgentFNS_bot", "description": "Free instant counterparty check using official data (INN/OGRN)."}, {"name": "AVinfoBot", "url": "https://t.me/AVskp_Bot", "description": "Used-car history via plate/VIN/phone."}, {"name": "AvtoNomer", "url": "https://t.me/avtonomerbot", "description": "Finds vehicle photos by plate via platesmania.com."}, {"name": "avtogram\\_bot", "url": "https://telegram.me/ABTOGRAMBOT", "description": "Paid car reports (VIN/plate): accidents, fines, liens."}, {"name": "avtocodbot", "url": "https://t.me/avtocodbot", "description": "Paid VIN/plate lookup."}, {"name": "bmi\\_np\\_bot", "url": "https://t.me/MNProbot", "description": "Identifies phone-number operator and basic info."}, {"name": "ChatSearchRobot", "url": "https://t.me/ChatSearchRobot", "description": "Finds chats with similar topics; 709k+ VK chats."}, {"name": "ClerkBot", "url": "https://t.me/clerksecretbot", "description": "Phone + username lookup; vehicle info."}, {"name": "creationdatebot", "url": "https://t.me/creationdatebot", "description": "Approx. Telegram account creation date."}, {"name": "CryptoBot", "url": "https://t.me/CryptoBot", "description": "Anonymous crypto wallet."}, {"name": "datXpert", "url": "https://telegram.me/datxpertbot", "description": "Leak search via IntelX."}, {"name": "Detectiva", "url": "http://detectiva.link/rezervBot", "description": "Phone/email lookup with 6 search types."}, {"name": "Discord Sensor", "url": "https://telegram.me/discordsensorbot", "description": "Retrieves Discord account data."}, {"name": "dCallsBot", "url": "https://t.me/dCallsBot", "description": "Anonymous calls, masking, eSIM/DID."}, {"name": "EasyVIN", "url": "https://t.me/EasyVINbot", "description": "Cheap VIN/plate history check."}, {"name": "egrul\\_bot", "url": "https://t.me/egrul_bot", "description": "Free counterparty-check bot."}, {"name": "EyeTON", "url": "https://telegram.me/istoneyebot", "description": "TON wallet graph + linked profiles."}, {"name": "FindStickerCreator", "url": "https://t.me/SPOwnerBot", "description": "Finds creator of any Telegram sticker pack."}, {"name": "\u0424\u0430\u0440\u0438", "url": "https://telegram.me/faribybot", "description": "VIN-history lookup from getcar.by."}, {"name": "GeoMacFinder", "url": "https://t.me/geomacbot", "description": "Finds Wi-Fi AP location by MAC/BSSID."}, {"name": "getChatList", "url": "https://telegram.me/getchatlistbot", "description": "Shows user\u2019s group list."}, {"name": "Getairplane", "url": "https://telegram.me/getairplane_bot", "description": "Phone \u2192 flight history (20 years)."}, {"name": "GetSendGifts", "url": "https://telegram.me/GetSendGiftsProBot", "description": "Shows who sent Telegram gifts."}, {"name": "HimeraSearch", "url": "https://t.me/HimeraNeGBL8Pro1dp_Search_bot", "description": "OSINT/HUMINT search: phones, emails, vehicles, people, courts."}, {"name": "Insight", "url": "https://t.me/ibhld_bot", "description": "Shows interests based on subscriptions."}, {"name": "InstaAnonym", "url": "https://t.me/instaanonymbot", "description": "Anonymous Instagram/VK viewer."}, {"name": "InstaBot", "url": "https://telegram.me/InstaBot", "description": "Downloads Instagram media."}, {"name": "ITP Infotrack", "url": "https://infotrackpeople.org/", "description": "People, vehicle, property lookup."}, {"name": "Leak OSINT", "url": "https://telegram.me/Leak_SSINTbot", "description": "Phone-number leakage check."}, {"name": "Maigret OSINT bot", "url": "https://t.me/osint_maigret_bot", "description": "Username search on 1,366 sites."}, {"name": "mnp\\_bot", "url": "https://t.me/mnp_bot", "description": "Phone operator + region."}, {"name": "MotherSearchBot", "url": "https://t.me/MotherSearchBot", "description": "Google-like Telegram search."}, {"name": "NEUROAUTOSEARCH", "url": "https://t.me/noblackAuto_bot", "description": "Car DB search + neural networks."}, {"name": "OkSearch", "url": "https://telegram.me/OkSearchBot", "description": "Search channels, bots, groups by keyword."}, {"name": "OpenDataUABot", "url": "https://t.me/OpenDataUABot", "description": "Ukrainian OSINT bot."}, {"name": "OPENLOAD Bot", "url": "https://t.me/OPENLOADTOPBOT", "description": "Semi-automated OSINT/vuln scanning suite."}, {"name": "Osintkit", "url": "https://t.me/osintkit_check_bot", "description": "Ukrainian lookup: passport, tax ID, email, phone, address, vehicles, Telegram."}, {"name": "PasswordSearch", "url": "https://telegram.me/PasswordSearchBot", "description": "Shows leaked passwords for an email."}, {"name": "PimEyes", "url": "https://telegram.me/pimeyesbot", "description": "Face-search across social networks."}, {"name": "RegDateBot", "url": "https://t.me/regdate_clone_bot", "description": "Registration date by ID/forward."}, {"name": "SangMata (beta)", "url": "https://t.me/SangMata_beta_bot", "description": "Name-change history via /search\\_id."}, {"name": "SangMataInfo\\_bot", "url": "https://t.me/SangMataInfo_bot", "description": "Username change history."}, {"name": "SaveYoutubeBot", "url": "https://t.me/SaveYoutubeBot", "description": "Finds and downloads YouTube videos."}, {"name": "Search\\_firm\\_bot", "url": "https://t.me/Search_firm_bot", "description": "Searches organizations, banks, postal codes."}, {"name": "Searchforchats", "url": "https://telegram.me/searchforchatsbot", "description": "Searches chats by keywords."}, {"name": "Sherlock", "url": "https://t.me/Getcontact123qwerty_bot?start=_ref_jGW8Sa_iEmG9V", "description": "Name/phone/email search + vehicle data."}, {"name": "ShtrafKZBot", "url": "https://t.me/ShtrafKZBot", "description": "Fines, taxes, penalties; traffic violations."}, {"name": "SMS Activate", "url": "https://t.me/PrivatePhoneBot", "description": "Virtual numbers from 50+ countries."}, {"name": "SpyGGbot", "url": "https://telegram.me/SpyGGbot", "description": "TON balances, NFT owners, Fragment usernames."}, {"name": "Surftg\\_bot", "url": "https://t.me/surftg_bot", "description": "Searches Telegram messages."}, {"name": "TuriBot", "url": "https://t.me/TuriBot", "description": "Resolves username from Telegram ID."}, {"name": "Unamer", "url": "https://telegram.me/unamer_bot", "description": "Username ownership history."}, {"name": "username\\_to\\_id\\_bot", "url": "https://t.me/username_to_id_bot", "description": "Returns user/chat/channel/bot ID."}, {"name": "UsInfoBot", "url": "https://t.me/usinfobot", "description": "Resolves username from ID (inline)."}, {"name": "WhoisDomBot", "url": "https://t.me/WhoisDomBot", "description": "Whois lookup for domains/IPs + dig/trace."}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) Steam", "entries": [{"name": "OSINT-Steam", "url": "https://osint-steam.vercel.app/en", "description": "An [open-source (\u2b5022)](https://github.com/Berchez/OSINT-steam) tool that returns public information, such as friends list and possible locations, from Steam profiles."}, {"name": "Steam-OSINT", "url": "https://github.com/matiash26/steam-osint", "description": "Open-source OSINT tool for accurate mutual friends analysis on Steam, supporting full friend lists.", "stars": "83"}], "notes": []}, {"name": "Osint \u2014 [\u2191](#-table-of-contents) GitHub", "entries": [{"name": "github\\_monitor", "url": "https://github.com/misiektoja/github_monitor", "description": "Tool for real-time tracking of GitHub users' activities including profile and repository changes with support for email alerts, CSV logging, detection when a user blocks or unblocks you and more", "stars": "44"}, {"name": "GithubRecon", "url": "https://kriztalz.sh/github-recon/", "description": "Lookup Github users by username or email and gather associated data."}, {"name": "Shotstars", "url": "https://github.com/snooppr/shotstars", "description": "An advanced tool for checking GitHub repositories, with star statistics, including fake star analysis and data visualization.", "stars": "89"}, {"name": "BlogSearchEngine", "url": "http://www.blogsearchengine.org", "description": ""}, {"name": "Notey", "url": "http://www.notey.com", "description": "Blog post search engine."}, {"name": "Twingly", "url": "http://www.twingly.com", "description": ""}, {"name": "4chan Search", "url": "https://4chansearch.com/", "description": ""}, {"name": "Boardreader", "url": "http://boardreader.com", "description": ""}, {"name": "Built With Flarum", "url": "https://builtwithflarum.com/", "description": ""}, {"name": "Facebook Groups", "url": "https://www.facebook.com", "description": ""}, {"name": "Google Groups", "url": "https://groups.google.com", "description": ""}, {"name": "Linkedin Groups", "url": "http://www.linkedin.com", "description": ""}, {"name": "Ning", "url": "http://www.ning.com", "description": ""}, {"name": "Yahoo Groups", "url": "https://groups.yahoo.com", "description": ""}, {"name": "Antisocial", "url": "https://github.com/lukeslp/antisocial", "description": "Find forgotten accounts across 30+ platforms using three-tier verification: official APIs first, then browser automation, then HTTP content analysis. Reduces false positives to around 5%. Deep search mode adds 500+ platforms via the WhatsMyName database.", "stars": "1"}, {"name": "Blackbird", "url": "https://github.com/p1ngul1n0/blackbird", "description": "Search a username across over 600+ websites.", "stars": "5.9k"}, {"name": "CheckUser", "url": "https://checkuser.vercel.app/", "description": "search username across social networks"}, {"name": "Cupidcr4wl", "url": "https://github.com/OSINTI4L/cupidcr4wl", "description": "Username and phone number search tool that crawls adult content platforms to see if a targeted account or person is present.", "stars": "115"}, {"name": "Digital Footprint Check", "url": "https://www.digitalfootprintcheck.com/free-checker.html", "description": "Check for registered username on 100s of sites for free."}, {"name": "IDCrawl", "url": "https://www.idcrawl.com/username", "description": "Search for a username in popular social networks."}, {"name": "Maigret", "url": "https://github.com/soxoj/maigret", "description": "Collect a dossier on a person by username.", "stars": "19k"}, {"name": "Name Chk", "url": "http://www.namechk.com", "description": "Check over 30 domains and more than 90 social media account platforms."}, {"name": "Name Checkr", "url": "http://www.namecheckr.com", "description": "checks a domain and username across many platforms."}, {"name": "Name Checkup", "url": "https://namecheckup.com", "description": "is a search tool that allows you to check the avilability of a givrn username from all over the social media. Inaddition it also sllows you to check the avilability of a given domain name."}, {"name": "NameKetchup", "url": "https://nameketchup.com", "description": "checks domain name and username in popular social media sites and platforms."}, {"name": "NexFil", "url": "https://github.com/thewhiteh4t/nexfil", "description": "checks username from almost all social network sites.", "stars": "2.5k"}, {"name": "Seekr", "url": "https://github.com/seekr-osint/seekr", "description": "", "stars": "762"}, {"name": "Sherlock", "url": "https://github.com/sherlock-project/sherlock", "description": "Search for a username in multiple platforms/websites.", "stars": "74k"}, {"name": "SherlockEye", "url": "https://sherlockeye.io/", "description": "Search for publicly available information connected to a username, uncovering associated profiles and activities across the web."}, {"name": "Trace", "url": "https://trace.manus.space", "description": "Real-time OSINT platform to search usernames, emails, phone numbers, and full names across 600+ platforms with breach detection and AI risk scoring."}, {"name": "Snoop", "url": "https://github.com/snooppr/snoop/blob/master/README.en.md", "description": "Search for a nickname on the web (OSINT world)", "stars": "3.9k"}, {"name": "Social Analyzer", "url": "https://github.com/qeeqbox/social-analyzer", "description": "API, CLI, and Web App for analyzing and finding a person's profile in 1000 social media \\ websites", "stars": "22k"}, {"name": "user-scanner", "url": "https://github.com/kaifcodec/user-scanner.git", "description": "Check a username's presence across dev/social/gaming/creator site"}, {"name": "User Search", "url": "http://www.usersearch.org", "description": "Find someone by username, email, phone number or picture across Social Networks, Dating Sites, Forums, Crypto Forums, Chat Sites and Blogs, 3000+ sites Supported!"}, {"name": "User Searcher", "url": "https://www.user-searcher.com", "description": "User-Searcher is a powerful and free tool to help you search username in 2000+ websites."}, {"name": "WhatsMyName", "url": "https://whatsmyname.app/", "description": "check for usernames across many different platforms."}, {"name": "192 (UK)", "url": "http://www.192.com", "description": "Search by person, business, address. Limited free info, premium data upsell."}, {"name": "411 (US)", "url": "http://www.411.com", "description": "Search by person, phone number, address, and business. Limited free info, premium data upsell."}, {"name": "Ancestry", "url": "http://www.ancestry.com", "description": "Premium data, free trial with credit card."}, {"name": "Apollo.io", "url": "https://www.apollo.io/", "description": "Free B2B Phone Number & Email Finder. 1200 credits per user/year for free plan."}, {"name": "BeenVerified", "url": "https://www.backgroundchecks.com/solutions/beenverified", "description": ""}, {"name": "Black Book Online", "url": "https://www.blackbookonline.info", "description": "Free. Nationwide directory of public record lookups."}, {"name": "BuscaPaginasBlancas", "url": "https://github.com/GeiserX/BuscaPaginasBlancas", "description": "OSINT tool for extracting contact information from Spanish white pages (Paginas Blancas).", "stars": "2"}, {"name": "Canada411", "url": "http://www.canada411.ca", "description": "Search by person, phone number, and business. Free."}, {"name": "Classmates", "url": "http://www.classmates.com", "description": "High-school focused people search. Free acounts allow creating a profile and viewing other members. Premium account required to contact other members."}, {"name": "ContactOut", "url": "https://contactout.com/", "description": "Unlock the world's most accurate contact data. Find emails & phone for 300M professionals."}, {"name": "Clustermaps", "url": "https://clustrmaps.com/", "description": "Find people and address information associated with them"}, {"name": "CrunchBase", "url": "http://www.crunchbase.com", "description": "Business information database, with a focus on investment, acquisition, and executive data. Ancillary focus on market research and connecting founders and investors."}, {"name": "FaceCheck.ID", "url": "https://facecheck.id", "description": "Search the internet by face."}, {"name": "Family Search", "url": "https://familysearch.org", "description": "Popular genealogy site. Free, but registration required. Funded by The Church Of Jesus Christ of Latter-day Saints."}, {"name": "FamilyTreeNow", "url": "https://familytreenow.com", "description": "Research family and geneology, no registration required, can search addresses, phone numbers, and email addresses as well as associations."}, {"name": "Federal Bureau of Prisons - Inmate Locator (US)", "url": "http://www.bop.gov/inmateloc", "description": "Search federal inmates incarcerated from 1982 to the present."}, {"name": "Fold3 (US Military Records)", "url": "http://www.fold3.com", "description": "Search military records. Search filters limited with free access. Premium access requires subscription."}, {"name": "Genealogy Bank", "url": "http://www.genealogybank.com", "description": "Premium data, free trial with credit card."}, {"name": "Genealogy Links", "url": "http://www.genealogylinks.net", "description": "Genealogy directory with over 50K links."}, {"name": "Homemetry", "url": "https://homemetry.com", "description": "Reverse address search and allows searching for properties for sale/rent.."}, {"name": "InfoTracer", "url": "https://infotracer.com/", "description": "Search for people. (Searches are paid)"}, {"name": "Judyrecords", "url": "https://www.judyrecords.com/", "description": "Free. Nationwide search of 400 million+ United States court cases."}, {"name": "Kompass", "url": "http://www.kompass.com", "description": "Business directory and search."}, {"name": "Mugshots", "url": "https://mugshots.com/", "description": ""}, {"name": "OpenSanctions", "url": "https://www.opensanctions.org/search/", "description": "Information on sanctions and public office holders."}, {"name": "PeekYou", "url": "https://www.peekyou.com/", "description": "PeekYou offers the ability to search for people with checks done against more sites. Can check for arrest records as well."}, {"name": "Reunion", "url": "http://reunion.com", "description": "People search. Limited free info, premium data upsell."}, {"name": "Socialcatfish", "url": "https://socialcatfish.com/", "description": "Superextensive people search which works worldwide. Searches are done from 200 Billion records."}, {"name": "SearchBug", "url": "http://www.searchbug.com", "description": "People search. Limited free info, premium data upsell."}, {"name": "Spokeo", "url": "http://www.spokeo.com", "description": "People search. Limited free info, premium data upsell."}, {"name": "Surfface", "url": "https://surfface.com", "description": "Face search and people finder that links faces to social media profiles and other public data."}, {"name": "The National Archives (UK)", "url": "http://www.nationalarchives.gov.uk", "description": "Search UK national archives."}, {"name": "UniCourt", "url": "https://unicourt.com/", "description": "Limited free searches, premium data upsell. Nationwide search of 100 million+ United States court cases."}, {"name": "UK Phone Book", "url": "https://www.ukphonebook.com/", "description": "Search people in a similar way as 192.com"}, {"name": "VineLink", "url": "https://www.vinelink.com/#state-selection", "description": "Inmate search and notification service for victims of crime, linked to multiple correctional facilities' booking systems in the U.S."}, {"name": "Voter Records", "url": "https://voterrecords.com/", "description": "Free political research tool to study more than 100 Million US voter records."}, {"name": "White Pages (US)", "url": "http://www.whitepages.com", "description": "People search. Limited free info, premium data upsell."}, {"name": "ZabaSearch", "url": "https://www.zabasearch.com/", "description": ""}, {"name": "Blackbird", "url": "https://github.com/p1ngul1n0/blackbird", "description": "Search for accounts associated with a given email across various platforms.", "stars": "5.9k"}, {"name": "Blacklist Checker", "url": "https://blacklistchecker.com/", "description": "Blacklist Checker is anemail blacklist checker, monitor and API that checks 100+ blacklists in seconds"}, {"name": "DeHashed", "url": "https://dehashed.com/", "description": "DeHashed helps prevent ATO with our extensive data set & breach notification solution. Match employee and consumer logins against the world\u2019s largest repository of aggregated publicly available assets leaked from third-party breaches. Secure passwords before criminals can abuse stolen information, and protect your enterprise."}, {"name": "Email Address Validator", "url": "http://www.email-validator.net", "description": "Improve deliverability, reduce bounce rates, prevent fraud and minimize funnel leaks."}, {"name": "Email Format", "url": "http://email-format.com", "description": "is a website that allows you to find email address formats used by different companies."}, {"name": "Email Permutator", "url": "https://www.polished.app/email-permutator/", "description": "a powerful tool designed to aid professionals in generating a range of potential email addresses for a specific contact."}, {"name": "EmailHippo", "url": "https://tools.verifyemailaddress.io", "description": "is an email address verification platform that will check whether a given email address exist or not."}, {"name": "EmailRep", "url": "https://emailrep.io", "description": "Email address reputation and risk scoring service."}, {"name": "Epieos Tools", "url": "https://tools.epieos.com", "description": "Collection of OSINT tools for email investigations."}, {"name": "Ghunt", "url": "https://github.com/mxrch/GHunt", "description": "Investigate Google emails and documents.", "stars": "19k"}, {"name": "Gitrecon", "url": "https://github.com/atiilla/gitrecon", "description": "Node.js tool to scan GitHub repositories for exposed email addresses and names.", "stars": "53"}, {"name": "h8mail", "url": "https://github.com/khast3x/h8mail", "description": "Password Breach Hunting and Email OSINT, locally or using premium services. Supports chasing down related email.", "stars": "4.9k"}, {"name": "Have I Been Pwned", "url": "https://haveibeenpwned.com", "description": "Search across multiple data breaches to see if your email address has been compromised."}, {"name": "Holehe", "url": "https://github.com/megadose/holehe", "description": "allows you to check if the mail is used on different sites like twitter, instagram and will retrieve information on sites with the forgotten password function.", "stars": "11k"}, {"name": "Hunter", "url": "https://hunter.io", "description": "Hunter lets you find email addresses in seconds and connect with the people that matter for your business."}, {"name": "InfoStealers", "url": "https://infostealers.info/en/info", "description": "Indexes darknet-exposed infostealer logs and makes them searchable and actionable for security teams, investigators, researchers, and digital forensics professionals."}, {"name": "IntelBase", "url": "https://intelbase.is/", "description": "Forensics platform focused on reverse email lookup and email data enrichment."}, {"name": "LeakCheck", "url": "https://leakcheck.io/", "description": "Data Breach Search Engine with 7.5B+ entries collected from more than 3000 databases. Search by e-mail, username, keyword, password or corporate domain name."}, {"name": "LeakRadar", "url": "https://leakradar.io/", "description": "Scans for compromised emails and domains in stealer logs, offering proactive breach prevention and real-time alerts."}, {"name": "MailTester", "url": "http://mailtester.com", "description": "hunt for emails and improve your email deliverability"}, {"name": "Minerva OSINT", "url": "https://minervaosint.com", "description": "Email search tool that finds and aggregates data on a target email from over a hundred websites."}, {"name": "Multirbl", "url": "https://multirbl.valli.org/dnsbl-lookup", "description": "MultiRBL Valli checks if an IP or domain is listed on multiple public RBLs (blacklists) simultaneously."}, {"name": "mxtoolbox", "url": "https://mxtoolbox.com/", "description": "Free online tools to investigate/troubleshoot email server issues."}, {"name": "OSINTEye", "url": "https://github.com/atiilla/OsintEye", "description": "OSINT Eye: A WPF Desktop Application for GitHub Intelligence, Social Media Reconnaissance, and Subdomain Discovery", "stars": "23"}, {"name": "Peepmail", "url": "http://www.samy.pl/peepmail", "description": "is a tool that allows you to discover business email addresses for users, even if their email address may not be publicly available or shared."}, {"name": "Pipl", "url": "https://pipl.com", "description": "a provider of identity solutions."}, {"name": "Reacher", "url": "https://reacher.email", "description": "Real-time email verification API, written in Rust, 100% open-source."}, {"name": "SherlockEye", "url": "https://sherlockeye.io/", "description": "Search for publicly available data linked to an email address across multiple sources on the internet."}, {"name": "Snov.io", "url": "https://snov.io/email-finder", "description": "Find email addresses on any website."}, {"name": "Spamhaus", "url": "https://check.spamhaus.org/", "description": "Lookup Reputation Checker."}, {"name": "ThatsThem", "url": "https://thatsthem.com/reverse-email-lookup", "description": "Reverse Email Lookup."}, {"name": "Toofr", "url": "https://www.toofr.com", "description": "Find Anyone\u2019s Email Address in Seconds."}, {"name": "user-scanner", "url": "https://github.com/kaifcodec/user-scanner.git", "description": "Takes an email, scan on various popular sites, games and retrieve info if the email is registered there or not."}, {"name": "Verify Email", "url": "http://verify-email.org", "description": "The fastest and most accurate email verification tool."}, {"name": "VoilaNorbert", "url": "https://www.voilanorbert.com", "description": "Find anyone's contact information for lead research or talent acquisition."}, {"name": "CallerID Test", "url": "https://calleridtest.com/", "description": "Get caller ID and telco carrier information back from a phone number."}, {"name": "EmobileTracker.com", "url": "https://www.emobiletracker.com/", "description": "a service specifically designed to Track Mobile Number, Location on Google Map including information such as the owner's Name,Location,Country,Telecom provider."}, {"name": "FreeCarrierLookup", "url": "https://freecarrierlookup.com/", "description": "enter a phone number and we'll return the carrier name and whether the number is wireless or landline. We also return the email-to-SMS and email-to-MMS gateway addresses for USA and Canadian\\* phone numbers."}, {"name": "Infobel", "url": "https://www.infobel.com/", "description": "Search 164+ million records across 73 countries for companies and individuals. Find places, local service providers, their contact details, reviews, opening hours and more."}, {"name": "InMobPrefix", "url": "https://github.com/hstsethi/in-mob-prefix", "description": "Dataset, charts, models about mobile phone numbers prefixes in India along with their respective state, operator.", "stars": "5"}, {"name": "Phone Validator", "url": "https://www.phonevalidator.com/index.aspx", "description": "Pretty accurate phone lookup service, particularly good against Google Voice numbers."}, {"name": "PhoneInfoga", "url": "https://github.com/sundowndev/PhoneInfoga", "description": "Advanced information gathering & OSINT framework for phone numbers.", "stars": "16k"}, {"name": "Reverse Phone Check", "url": "https://www.reversephonecheck.com", "description": "Look up names, addresses, phone numbers, or emails and anonymously discover information about yourself, family, friends, or old schoolmates. Powered by infotracer.com"}, {"name": "Reverse Phone Lookup", "url": "http://www.reversephonelookup.com/", "description": "Detailed information about phone carrier, region, service provider, and switch information."}, {"name": "SearchPeopleFREE", "url": "https://www.searchpeoplefree.com/phone-lookup", "description": "a reverse name, address, email address, or phone lookup that allows you to discover the owner of a phone number or who lives at an address."}, {"name": "Spy Dialer", "url": "http://spydialer.com/", "description": "Get the voicemail of a cell phone & owner name lookup."}, {"name": "Sync.ME", "url": "https://sync.me/", "description": "a caller ID and spam blocker app."}, {"name": "Truecaller", "url": "https://truecaller.com", "description": "Global reverse phone number search."}, {"name": "Twilio", "url": "https://www.twilio.com/docs/lookup/v2-api", "description": "Look up a phone numbers carrier type, location, etc. Twilio offers free accounts that come with credits you can use with their API. Each lookup is only \\~$0.01-$0.02 typically on US and CAN numbers."}, {"name": "USPhoneBook", "url": "https://www.usphonebook.com/", "description": "Reverse phone and address lookups and leading data."}, {"name": "FaxVIN", "url": "https://www.faxvin.com/", "description": "Vehicle History Reports. A license plate lookup tool that returns info like VIN, make & model of vehicle, age, and numerous other details."}, {"name": "EpicVIN", "url": "https://epicvin.com/", "description": "Vehicle reports are compiled from various data sources, including historical accident records from state agencies and other entities like NMVTIS. License plate lookup that returns VIN and car millage."}, {"name": "Academia", "url": "http://academia.edu", "description": "is a platform for sharing academic research."}, {"name": "ExpertiseFinder", "url": "http://www.expertisefinder.com", "description": ""}, {"name": "ExpertPages", "url": "http://expertpages.com", "description": ""}, {"name": "Experts.com", "url": "http://www.experts.com", "description": ""}, {"name": "HARO", "url": "http://www.helpareporter.com", "description": ""}, {"name": "Licenseplates", "url": "http://www.worldlicenseplates.com/", "description": ""}, {"name": "GlobalExperts", "url": "http://www.theglobalexperts.org", "description": ""}, {"name": "Idealist", "url": "http://www.idealist.org", "description": ""}, {"name": "Innocentive", "url": "http://www.innocentive.com", "description": ""}, {"name": "Internet Experts", "url": "http://www.internetexperts.info", "description": ""}, {"name": "Library of Congress: Ask a Librarian", "url": "http://www.loc.gov/rr/askalib", "description": ""}, {"name": "Maven", "url": "http://www.maven.co", "description": ""}, {"name": "MuckRack", "url": "http://muckrack.com", "description": "Extensive database of U.S. government public records obtained through federal and state public records requests. Automated tool that will make public records requests and follow up until records are obtained on your behalf."}, {"name": "National Speakers Association", "url": "http://www.nsaspeaker.org", "description": ""}, {"name": "Newswise", "url": "http://www.newswise.com", "description": ""}, {"name": "Patent Attorneys/Agent Search", "url": "https://oedci.uspto.gov/OEDCI/", "description": "Official listing of U.S. attorneys qualified to represent individuals in U.S. patent office proceedings."}, {"name": "PRNewswire", "url": "https://prnmedia.prnewswire.com", "description": ""}, {"name": "ReseacherID", "url": "http://www.researcherid.com", "description": ""}, {"name": "SheSource", "url": "http://www.shesource.org", "description": ""}, {"name": "Sources", "url": "http://www.sources.com", "description": ""}, {"name": "TRExpertWitness", "url": "https://trexpertwitness.com", "description": ""}, {"name": "Zintro", "url": "https://www.zintro.com", "description": ""}, {"name": "AllStocksLinks", "url": "http://www.allstocks.com/links", "description": ""}, {"name": "Better Business Bureau", "url": "http://www.bbb.org", "description": ""}, {"name": "Bizeurope", "url": "http://www.bizeurope.com", "description": ""}, {"name": "Bloomberg", "url": "http://www.bloomberg.com/research/company/overview/overview.asp", "description": ""}, {"name": "BrownBook", "url": "https://www.brownbook.net/", "description": ""}, {"name": "Bureau Van Dijk", "url": "http://www.bvdinfo.com", "description": ""}, {"name": "Business Source", "url": "https://www.ebscohost.com/academic/business-source-complete", "description": ""}, {"name": "Canadian Business Research", "url": "https://www.canada.ca/en/services/business/research.html", "description": ""}, {"name": "Caselaw Access Project", "url": "https://case.law/", "description": "Collection of full text of historical (not up-to-date) cases from United States state appellate courts."}, {"name": "Company Registration Round the World", "url": "http://www.commercial-register.sg.ch/home/worldwide.html", "description": ""}, {"name": "Company Research Resources by Country Comparably", "url": "https://www.comparably.com", "description": ""}, {"name": "CompeteShark", "url": "http://competeshark.com", "description": ""}, {"name": "Corporate Information", "url": "http://www.corporateinformation.com", "description": "Aggregated information from publicly available sources on publicly traded companies worldwide."}, {"name": "CorporationWiki", "url": "https://www.corporationwiki.com/", "description": ""}, {"name": "CrunchBase", "url": "https://www.crunchbase.com", "description": "Detailed information on startup businesses, with a specific focus on funding sources and funding procedures used by specific businesses."}, {"name": "Data.com Connect", "url": "https://connect.data.com", "description": ""}, {"name": "EDGAR U.S. Securities and Exchange Commission Filings", "url": "http://www.edgar-online.com", "description": "Periodic reports and extensive corporate disclosures from all businesses publicly traded in the United States."}, {"name": "Europages", "url": "http://www.europages.co.uk", "description": ""}, {"name": "European Business Register", "url": "http://www.ebr.org", "description": ""}, {"name": "Ezilon", "url": "http://www.ezilon.com", "description": ""}, {"name": "Factiva", "url": "https://global.factiva.com", "description": ""}, {"name": "Forbes Global 2000", "url": "http://www.forbes.com/global2000/", "description": ""}, {"name": "Glassdoor", "url": "https://www.glassdoor.com", "description": ""}, {"name": "globalEdge", "url": "http://globaledge.msu.edu", "description": ""}, {"name": "GoodFirms", "url": "https://www.goodfirms.co/", "description": ""}, {"name": "GuideStar", "url": "http://www.guidestar.org", "description": ""}, {"name": "Hoovers", "url": "http://www.hoovers.com", "description": ""}, {"name": "Inc. 5000", "url": "http://www.inc.com/inc5000", "description": ""}, {"name": "Judyrecords", "url": "https://www.judyrecords.com/", "description": "Free. Nationwide search of 400 million+ United States court cases."}, {"name": "Knowledge guide to international company registration", "url": "http://www.icaew.com/en/library/subject-gateways/business-management/company-administration/knowledge-guide-international-company-registration", "description": ""}, {"name": "Linkedin", "url": "https://www.linkedin.com", "description": "Commonly used social-media platform with a focus on professional profiles and recruitment. Spans a wide variety of industries. Very useful for gathering information on what specific individuals are active within an entity."}, {"name": "Mergent Intellect", "url": "http://www.mergentintellect.com", "description": ""}, {"name": "Mergent Online", "url": "http://www.mergentonline.com/login.php", "description": ""}, {"name": "National Company Registers", "url": "https://en.wikipedia.org/wiki/List_of_company_registers", "description": ""}, {"name": "OpenCorporates", "url": "https://opencorporates.com", "description": "Global search of registered corporate entities and their associated individual officers or investors."}, {"name": "OpenOwnership Register", "url": "https://register.openownership.org/", "description": ""}, {"name": "Orbis directory", "url": "http://orbisdirectory.bvdinfo.com/version-20161014/OrbisDirectory/Companies", "description": ""}, {"name": "Overseas Company Registers", "url": "https://www.gov.uk/government/publications/overseas-registries/overseas-registries", "description": ""}, {"name": "Plunkett Research", "url": "http://www.plunkettresearchonline.com", "description": ""}, {"name": "Scoot", "url": "http://www.scoot.co.uk", "description": ""}, {"name": "SEMrush", "url": "https://www.semrush.com", "description": ""}, {"name": "Serpstat", "url": "https://serpstat.com", "description": ""}, {"name": "SpyFu", "url": "http://www.spyfu.com", "description": ""}, {"name": "TheWebCo", "url": "https://thewebco.ai", "description": "The single source of people intelligence."}, {"name": "UniCourt", "url": "https://unicourt.com/", "description": "Limited free searches, premium data upsell. Nationwide search of 100 million+ United States court cases."}, {"name": "uk-company-number", "url": "https://github.com/borschai/uk-company-number", "description": "Validate, format, and identify UK Companies House company numbers. Supports all 27 prefixes. Available on npm and PyPI.", "stars": "0"}, {"name": "uk-sic-codes", "url": "https://github.com/borschai/uk-sic-codes", "description": "UK SIC 2007 industry classification code lookup, search, and validation. Available on npm and PyPI.", "stars": "0"}, {"name": "Vault", "url": "http://www.vault.com", "description": "Well-known ranking of largest United States Corporations."}, {"name": "Xing", "url": "http://www.xing.com", "description": ""}, {"name": "YouControl", "url": "https://youcontrol.com.ua/en/", "description": ""}, {"name": "Beyond", "url": "http://www.beyond.com", "description": ""}, {"name": "CampusCareerCenter", "url": "http://www.campuscareercenter.com", "description": ""}, {"name": "CareerBuilder", "url": "http://www.careerbuilder.com", "description": ""}, {"name": "College Recruiter", "url": "https://www.collegerecruiter.com", "description": ""}, {"name": "Craiglist", "url": "http://losangeles.craigslist.org", "description": ""}, {"name": "CVFox", "url": "http://www.cvfox.com", "description": ""}, {"name": "Dice", "url": "http://www.dice.com", "description": ""}, {"name": "Eluta (Canada)", "url": "http://www.eluta.ca", "description": ""}, {"name": "Eurojobs", "url": "https://www.eurojobs.com", "description": ""}, {"name": "Fish4Jobs", "url": "http://www.fish4.co.uk", "description": ""}, {"name": "Glassdoor", "url": "https://www.glassdoor.com", "description": ""}, {"name": "Headhunter", "url": "http://www.headhunter.com", "description": ""}, {"name": "Indeed", "url": "http://www.indeed.com", "description": "is an online job searching website that gives job seekers free access to search for a job, post their resumes, and research companies."}, {"name": "Jobs (Poland)", "url": "http://www.jobs.pl", "description": ""}, {"name": "Jobsite (UK)", "url": "http://www.jobsite.co.uk", "description": ""}, {"name": "Linkedin", "url": "https://www.linkedin.com", "description": ""}, {"name": "Monster", "url": "http://www.monster.com", "description": ""}, {"name": "Naukri (India)", "url": "http://www.naukri.com", "description": ""}, {"name": "RecruitEm", "url": "https://recruitin.net/", "description": ""}, {"name": "Reed (UK)", "url": "http://www.reed.co.uk", "description": ""}, {"name": "Seek (Australia)", "url": "http://www.seek.com.au", "description": ""}, {"name": "SimplyHired", "url": "http://www.simplyhired.com", "description": ""}, {"name": "Xing", "url": "http://www.xing.com", "description": ""}, {"name": "ZipRecruiter", "url": "https://www.ziprecruiter.com", "description": ""}, {"name": "Answers.com", "url": "http://www.answers.com", "description": ""}, {"name": "Ask", "url": "http://www.ask.com", "description": ""}, {"name": "eHow", "url": "http://www.ehow.com", "description": ""}, {"name": "Quora", "url": "http://www.quora.com", "description": ""}, {"name": "StackExchange", "url": "http://stackexchange.com", "description": ""}, {"name": "Yahoo Answers", "url": "http://answers.yahoo.com", "description": ""}, {"name": "\u041e\u0442\u0432\u0435\u0442\u044b", "url": "https://otvet.mail.ru/", "description": ""}, {"name": "aa419 Fake Sites Database", "url": "https://db.aa419.org/fakebankslist.php", "description": "The site lists fraudulent websites, such as fake banks and online scams, identified by the Artists Against 419 community."}, {"name": "Accuranker", "url": "https://www.accuranker.com", "description": ""}, {"name": "ahrefs", "url": "https://ahrefs.com", "description": "A tool for backlink research, organic traffic research, keyword research, content marketing & more."}, {"name": "Azure Tenant Resolution by PingCastle", "url": "https://tenantresolution.pingcastle.com", "description": "Search for Azure Tenant using its domain name or its ID"}, {"name": "Bgpview.io", "url": "https://bgpview.io", "description": "The website bgpview\\.io allows you to look up detailed information about ASNs, IPs, and BGP routes on the internet."}, {"name": "Bing Webmaster Tools", "url": "http://www.bing.com/toolbox/webmaster", "description": ""}, {"name": "Browserling", "url": "https://www.browserling.com", "description": "Browserling is an online sandbox that lets users safely test potentially malicious links across browsers and operating systems in real time."}, {"name": "BuiltWith", "url": "http://builtwith.com", "description": "is a website that will help you find out all the technologies used to build a particular websites."}, {"name": "Central Ops", "url": "http://centralops.net", "description": ""}, {"name": "Crypto Scam & Crypto Phishing URL Threat Intel Feed", "url": "https://github.com/spmedia/Crypto-Scam-and-Crypto-Phishing-Threat-Intel-Feed", "description": "A fresh feed of crypto phishing and crypto scam websites. Automatically updated daily.", "stars": "54"}, {"name": "Dedicated or Not", "url": "http://dedicatedornot.com", "description": ""}, {"name": "DNS History", "url": "https://completedns.com/dns-history/", "description": ""}, {"name": "DNSDumpster", "url": "https://dnsdumpster.com", "description": "is a website that will help you discover hosts related to a specific domain."}, {"name": "DNSStuff", "url": "http://www.dnsstuff.com", "description": ""}, {"name": "DNSViz", "url": "http://dnsviz.net", "description": ""}, {"name": "Domain Crawler", "url": "http://www.domaincrawler.com", "description": ""}, {"name": "Domain Dossier", "url": "http://centralops.net/co/DomainDossier.aspx", "description": ""}, {"name": "DomainRecon", "url": "https://kriztalz.sh/domain-recon/", "description": "Retrieve DNS records, subdomains, SSL certificates and WHOIS / RDAP data for a given website."}, {"name": "Domain Tools", "url": "http://whois.domaintools.com", "description": "Whois lookup and domain/ip historical data."}, {"name": "Easy whois", "url": "https://www.easywhois.com", "description": ""}, {"name": "Exonera Tor", "url": "https://exonerator.torproject.org", "description": "A database of IP addresses that have been part of the Tor network. It answers the question whether there was a Tor relay running on a given IP address on a given date."}, {"name": "Focsec", "url": "https://focsec.com", "description": "Threat Intelligence API that detects if a IP address is associated with a VPN, Proxy, TOR or Bots."}, {"name": "Follow.net", "url": "http://follow.net", "description": ""}, {"name": "Fullhunt", "url": "https://fullhunt.io/", "description": "FullHunt is an OSINT tool focused on identifying and protecting internet-exposed assets."}, {"name": "GraphyStories", "url": "http://app.graphystories.com", "description": ""}, {"name": "Hudson Rock", "url": "https://www.hudsonrock.com/threat-intelligence-cybercrime-tools", "description": "is a free cybercrime intelligence toolkit to check exposure in Infostealer malware infection."}, {"name": "Hybrid Analysis", "url": "https://www.hybrid-analysis.com", "description": "Online service for detailed and free analysis of suspicious files and URLs."}, {"name": "HypeStat", "url": "https://www.hypestat.com", "description": ""}, {"name": "Icann Lookup", "url": "https://lookup.icann.org/en/lookup", "description": "The site allows you to look up domain registration information (WHOIS) on the internet"}, {"name": "Infosniper", "url": "http://www.infosniper.net", "description": ""}, {"name": "isMalicious", "url": "https://ismalicious.com", "description": "Threat intelligence platform aggregating malicious IP and domain data from multiple security feeds with real-time reputation scoring and threat categorization."}, {"name": "IntoDNS.ai", "url": "https://intodns.ai", "description": "AI-powered DNS and email security scanner with SPF, DKIM, DMARC, DNSSEC checks and fix suggestions."}, {"name": "IP 2 Geolocation", "url": "http://ip2geolocation.com", "description": ""}, {"name": "IP 2 Location", "url": "http://www.ip2location.com/demo.aspx", "description": ""}, {"name": "IP Geolocation API DB-IP", "url": "https://db-ip.com", "description": "Pprovides IP geolocation and intelligence."}, {"name": "IP Checking", "url": "http://www.ipchecking.com", "description": ""}, {"name": "IP Location", "url": "https://www.iplocation.net", "description": "is used for mapping of an IP address or MAC address to the real-world geographic location of an Internet-connected computing or a mobile device."}, {"name": "IP Location.io", "url": "https://iplocation.io", "description": "IPLocation.io allows you to check the location of an IP for free"}, {"name": "IPFingerprints", "url": "http://www.ipfingerprints.com", "description": "is used to find the approximate geographic location of an IP address along with some other useful information including ISP, TimeZone, Area Code, State."}, {"name": "IPVoid", "url": "http://www.ipvoid.com", "description": "IP address toolset."}, {"name": "ISP.Tools", "url": "https://www.isp.tools", "description": "Is a free platform offering network diagnostic tools (ping, traceroute, MTR, DNS, WHOIS, HTTP, etc.) tailored for ISPs and infrastructure professionals."}, {"name": "Kloth", "url": "http://www.kloth.net/services", "description": ""}, {"name": "Majestic", "url": "https://majestic.com", "description": "Find out who links to your website."}, {"name": "Mark Monitor WHOIS", "url": "https://whois-webform.markmonitor.com/whois/", "description": "Displays domain registration information."}, {"name": "MaxMind", "url": "https://www.maxmind.com", "description": ""}, {"name": "MetaDefender", "url": "https://metadefender.com", "description": "Threat analysis service for URLs, files, certificates, domains, and suspicious hashes."}, {"name": "Netcraft Site Report", "url": "http://toolbar.netcraft.com/site_report?url=undefined#last_reboot", "description": "is an online database that will provide you a report with detail information about a particular website and the history associated with it."}, {"name": "OpenLinkProfiler", "url": "http://www.openlinkprofiler.org/", "description": ""}, {"name": "PageGlimpse", "url": "http://www.pageglimpse.com", "description": ""}, {"name": "Pentest-Tools.com", "url": "https://pentest-tools.com/information-gathering/google-hacking", "description": "uses advanced search operators (Google Dorks) to find juicy information about target websites."}, {"name": "PhishStats", "url": "https://phishstats.info/", "description": ""}, {"name": "Pulsedive", "url": "https://pulsedive.com", "description": ""}, {"name": "Qualys SSL Check", "url": "https://www.ssllabs.com/ssltest/", "description": "SSL Test configuration compliance."}, {"name": "Quantcast", "url": "https://www.quantcast.com", "description": ""}, {"name": "Quick Sprout", "url": "https://www.quicksprout.com", "description": ""}, {"name": "RedirectDetective", "url": "http://redirectdetective.com", "description": ""}, {"name": "Remote DNS Lookup", "url": "https://remote.12dt.com", "description": ""}, {"name": "Robtex", "url": "https://www.robtex.com", "description": "is an IP address and domain name based researching websites that offers multiple services such as Reverse DNS Lookup, Whois, and AS Macros."}, {"name": "SameID", "url": "http://sameid.net", "description": ""}, {"name": "SecurityTrails", "url": "https://securitytrails.com/dns-trails", "description": "API to search current and historical DNS records, current and historical WHOIS, technologies used by sites and whois search for phone, email, address, IPs etc."}, {"name": "SubDomainRadar.io", "url": "https://subdomainradar.io", "description": "Fast subdomain finder with multiple search modes and the most extensive data sources, offering real-time notifications."}, {"name": "SEMrush", "url": "https://www.semrush.com", "description": ""}, {"name": "SEO Chat Tools", "url": "http://tools.seochat.com", "description": ""}, {"name": "SEOTools for Excel", "url": "http://seotoolsforexcel.com", "description": ""}, {"name": "Similar Web", "url": "https://www.similarweb.com", "description": "Compare any website traffic statistics & analytics."}, {"name": "SmallSEOTools", "url": "http://smallseotools.com", "description": ""}, {"name": "Squatm3gator", "url": "https://github.com/david3107/squatm3gator", "description": "Enumerate available domains generated modifying the original domain name through different cybersquatting techniques", "stars": "32"}, {"name": "StatsCrop", "url": "http://www.statscrop.com", "description": ""}, {"name": "TinyScan", "url": "https://www.tiny-scan.com", "description": "Another powerful URL scan tool that provides comprehensive information about any given URL. Get insights into IP address, location, screenshots, technology stack, performance metrics, and more."}, {"name": "TracerouteVisualizer", "url": "https://kriztalz.sh/traceroute-visualizer/", "description": "An online tool that displays your mtr / traceroute / flyingroutes output on a map for visual analysis."}, {"name": "urlDNA", "url": "https://urldna.io/", "description": "Unleash website insights! urldna.io analyzes url, monitors brands and track phishing sites."}, {"name": "URLhaus", "url": "https://urlhaus.abuse.ch", "description": "URLhaus shares malicious URLs to combat malware and botnet threats"}, {"name": "urlQuery", "url": "http://urlquery.net", "description": ""}, {"name": "urlscan", "url": "https://urlscan.io/", "description": "is a free service to scan and analyse websites."}, {"name": "URLVoid", "url": "http://www.urlvoid.com", "description": "Analyzes a website through multiple blacklist engines and online reputation tools to facilitate the detection of fraudulent and malicious websites."}, {"name": "Validin", "url": "https://app.validin.com/", "description": "Website and API to search current and historical DNS records for free"}, {"name": "Verisign", "url": "http://dnssec-debugger.verisignlabs.com", "description": ""}, {"name": "ViewDNS.info", "url": "http://viewdns.info", "description": ""}, {"name": "Virus Total", "url": "https://www.virustotal.com/", "description": "Analyse suspicious domains, IPs URLs and files to detect malware and other breaches"}, {"name": "w3snoop", "url": "http://webboar.com.w3snoop.com", "description": "is a website that gives you a free and comprehensive report about a specific website."}, {"name": "Web-Check", "url": "https://web-check.as93.net/", "description": "All-in-one tool for viewing website and server meta data."}, {"name": "WebMeUp", "url": "http://webmeup.com", "description": "is the Web's freshest and fastest growing backlink index, and the primary source of backlink data for SEO PowerSuite."}, {"name": "Webscore", "url": "https://garvit835.github.io/WebScore/", "description": "Enter a website URL to check its legitimacy."}, {"name": "Webscout", "url": "https://webscout.io/", "description": "A Swiss Army knife for scaled intelligence and metadata on IP addresses and domains."}, {"name": "Website Informer", "url": "http://website.informer.com", "description": ""}, {"name": "WebsiteTechMiner.py", "url": "https://github.com/cybersader/WebsiteTechMiner-py", "description": "automates gathering website profiling data into a CSV from the \"BuiltWith\" or \"Wappalyzer\" API for tech stack information, technographic data, website reports, website tech lookups, website architecture lookups, etc.", "stars": "12"}, {"name": "WhatIsMyIPAddress", "url": "http://whatismyipaddress.com", "description": ""}, {"name": "Who.is", "url": "https://who.is/", "description": "Domain whois information."}, {"name": "Whois Arin Online", "url": "https://whois.arin.net", "description": "is a web service for Whois data contained within ARIN's registration database"}, {"name": "WhoIsHostingThis", "url": "http://www.whoishostingthis.com", "description": ""}, {"name": "WhoisMind", "url": "http://www.whoismind.com", "description": ""}, {"name": "Whoisology", "url": "https://whoisology.com", "description": ""}, {"name": "WhoIsRequest", "url": "http://whoisrequest.com", "description": ""}, {"name": "WiGLE", "url": "https://wigle.net/", "description": "Wi-fi \"wardriving\" database. Contains a global map containing crowdsourced information on the location, name, and other properties of wi-fi networks. Software available to download to contribute data to the public infoset."}, {"name": "You Get Signal", "url": "http://www.yougetsignal.com", "description": ""}, {"name": "Google Adwords", "url": "http://adwords.google.com", "description": "Get monthly keyword volume data and stats."}, {"name": "Google Trends", "url": "https://www.google.com/trends", "description": "See how many users are searching for specific keywords."}, {"name": "Keyword Discovery", "url": "http://www.keyworddiscovery.com", "description": ""}, {"name": "Keyword Spy", "url": "http://www.keywordspy.com", "description": ""}, {"name": "KeywordTool", "url": "http://keywordtool.io", "description": ""}, {"name": "One Look Reverse Dictionary", "url": "http://www.onelook.com/reverse-dictionary.shtml", "description": ""}, {"name": "Soovle", "url": "http://www.soovle.com", "description": ""}, {"name": "Ubersuggest", "url": "http://ubersuggest.org", "description": ""}, {"name": "Word Tracker", "url": "https://www.wordtracker.com", "description": ""}, {"name": "Yandex Wordstat", "url": "https://wordstat.yandex.com", "description": ""}, {"name": "Archive.is", "url": "http://archive.is", "description": "is a website that allows you to archive a snapshot of you websites that will always remains online evenif the original page disappears."}, {"name": "BlackWidow", "url": "http://softbytelabs.com/wp/blackwidow/", "description": ""}, {"name": "CashedPages", "url": "http://www.cachedpages.com", "description": ""}, {"name": "CachedView", "url": "http://cachedview.com", "description": ""}, {"name": "stored.website", "url": "https://stored.website", "description": ""}, {"name": "Wayback Machine", "url": "http://archive.org/web/web.php", "description": "Explore the history of a website."}, {"name": "Wayback Machine Archiver", "url": "https://github.com/jsvine/waybackpack", "description": "", "stars": "3.2k"}, {"name": "Wayback-Archive", "url": "https://github.com/GeiserX/Wayback-Archive", "description": "Download complete websites from the Wayback Machine with full asset preservation for offline viewing.", "stars": "4"}, {"name": "waybackpy", "url": "https://github.com/akamhy/waybackpy", "description": "Python package & CLI tool that interfaces the Wayback Machine APIs.", "stars": "567"}, {"name": "Baidu Images", "url": "https://image.baidu.com", "description": ""}, {"name": "Betaface", "url": "https://www.betaface.com/demo.html", "description": ""}, {"name": "Bing Images", "url": "https://www.bing.com/images", "description": ""}, {"name": "Clarify", "url": "https://clarify.io", "description": ""}, {"name": "Dupli Checker", "url": "https://www.duplichecker.com/reverse-image-search.php", "description": "You can search for an image by uploading + with URL or typing the keyword or any word you want to explore related to images."}, {"name": "FaceCheck.ID", "url": "https://facecheck.id", "description": "Facial recognition search engine."}, {"name": "Faceagle", "url": "https://faceagle.com/", "description": "Faceagle is a face recognition search engine."}, {"name": "Flickr", "url": "https://flickr.com/search/", "description": ""}, {"name": "GeoSpyer", "url": "https://github.com/atiilla/geospy \"Original service: https://geospy.web.app/\"", "description": "Python tool using Graylark's AI-powered geo-location service to uncover the location where photos were taken.", "stars": "1k"}, {"name": "Google Image", "url": "https://images.google.com", "description": ""}, {"name": "Google Lens", "url": "https://lens.google.com/", "description": ""}, {"name": "Image Identification Project", "url": "https://www.imageidentify.com", "description": ""}, {"name": "Image Raider", "url": "https://www.imageraider.com", "description": "is our reverse image search tool for completing individual searches. When you upload an image to this page, we'll scour the internet to find its source and all of the other pages where it has been posted."}, {"name": "KartaVision", "url": "https://kartavision.com/", "description": "search engine for KartaView imagery. It supports natural-language search and search by image"}, {"name": "Lenso.ai", "url": "https://lenso.ai", "description": "Reverse image search tool with facial recognition, created for finding people, similar images, copies of photos, identical places and more."}, {"name": "Lycos Image Search", "url": "https://search.lycos.com", "description": ""}, {"name": "PhotoBucket", "url": "https://photobucket.com", "description": ""}, {"name": "PicTriev", "url": "http://www.pictriev.com", "description": "a face search engine."}, {"name": "PimEyes", "url": "https://pimeyes.com", "description": "an online face search engine that goes through the Internet to find pictures containing given faces."}, {"name": "Pixsy", "url": "https://www.pixsy.com/", "description": "Take back control of your images. See where & how your images are being used online!"}, {"name": "Search4faces", "url": "https://search4faces.com/", "description": "a service for searching people on the Internet by photo."}, {"name": "Surfface", "url": "https://surfface.com", "description": "face search and people finder indexing social profiles and public images from social media and the web."}, {"name": "TinEye", "url": "https://tineye.com", "description": "Reverse image search engine."}, {"name": "Yahoo Image Search", "url": "https://images.search.yahoo.com", "description": ""}, {"name": "Yandex Images", "url": "https://www.yandex.com/images", "description": ""}, {"name": "DiffChecker", "url": "https://www.diffchecker.com/image-diff/", "description": ""}, {"name": "EXIFEditor.io", "url": "https://exifeditor.io", "description": "In-browser EXIF image metadata editor, viewer, and analysis tool."}, {"name": "ExifLooter", "url": "https://github.com/aydinnyunus/exiflooter", "description": "", "stars": "485"}, {"name": "ExifTool", "url": "http://www.sno.phy.queensu.ca/~phil/exiftool", "description": ""}, {"name": "Forensically", "url": "https://29a.ch/photo-forensics/", "description": ""}, {"name": "FotoForensics", "url": "http://www.fotoforensics.com", "description": ""}, {"name": "GeoSpy", "url": "https://geospy.web.app/", "description": "AI based image osint tool"}, {"name": "ImgOps", "url": "https://imgops.com/", "description": ""}, {"name": "ImpulseAdventure", "url": "http://www.impulseadventure.com/photo/jpeg-snoop.html", "description": ""}, {"name": "Jeffreys Image Metadata Viewer", "url": "http://exif.regex.info/", "description": ""}, {"name": "JIMPL", "url": "https://jimpl.com/", "description": "Online EXIF data viewer"}, {"name": "JPEGsnoop", "url": "https://sourceforge.net/projects/jpegsnoop", "description": ""}, {"name": "Metadata Viewer", "url": "https://kriztalz.sh/metadata-viewer/", "description": "Online EXIF data viewer."}, {"name": "ProfileImageIntel", "url": "https://profileimageintel.com/", "description": "Social media and WhatsApp profile image tool to find when a profile image was uploaded."}, {"name": "Bing Videos", "url": "http://www.bing.com/?scope=video", "description": ""}, {"name": "Clarify", "url": "http://clarify.io", "description": ""}, {"name": "Clip Blast", "url": "http://www.clipblast.com", "description": ""}, {"name": "DailyMotion", "url": "http://www.dailymotion.com", "description": ""}, {"name": "Deturl", "url": "http://deturl.com", "description": "Download a YouTube video from any web page."}, {"name": "DownloadHelper", "url": "http://www.downloadhelper.net", "description": "Download any video from any websites, it just works!"}, {"name": "Earthcam", "url": "http://www.earthcam.com", "description": "EarthCam is the leading network of live streaming webcams for tourism and entertainment."}, {"name": "Filmot", "url": "https://filmot.com/", "description": "Search within YouTube subtitles. Indexing over 573 million captions across 528 million videos and 45 million channels."}, {"name": "Find YouTube Video", "url": "https://findyoutubevideo.thetechrobo.ca/", "description": "Searches currently 5 YouTube archives for specific videos by ID, which is really useful for finding deleted or private YouTube videos."}, {"name": "Frame by Frame", "url": "https://chrome.google.com/webstore/detail/frame-by-frame/cclnaabdfgnehogonpeddbgejclcjneh/", "description": "Browser plugin that allows you to watch YouTube videos frame by frame."}, {"name": "Geosearch", "url": "http://www.geosearchtool.com", "description": ""}, {"name": "Insecam", "url": "http://insecam.org/", "description": "Live cameras directory"}, {"name": "Internet Archive: Open Source Videos", "url": "https://archive.org/details/opensource_movies", "description": ""}, {"name": "Metacafe", "url": "http://www.metacafe.com", "description": ""}, {"name": "Metatube", "url": "http://www.metatube.com", "description": ""}, {"name": "Tubuep", "url": "https://github.com/bibanon/tubeup", "description": "Downloads online videos via yt-dlp, then reuploads them to the Internet Archive for preservation. Note: if you would like to archive comments too, you need to install version 0.0.33 and use the --get-comments flag, however you will still have the new yt-dlp fixes and features, but existing tubeup bugs cannot be fixed, unless you do manual work.", "stars": "483"}, {"name": "Veoh", "url": "http://www.veoh.com", "description": ""}, {"name": "Video Stabilization Methods", "url": "https://github.com/yaochih/awesome-video-stabilization", "description": "", "stars": "533"}, {"name": "Vimeo", "url": "https://vimeo.com", "description": ""}, {"name": "Yahoo Video Search", "url": "http://video.search.yahoo.com", "description": ""}, {"name": "YouTube Geofind", "url": "https://mattw.io/youtube-geofind/", "description": ""}, {"name": "YouTube Metadata", "url": "https://mattw.io/youtube-metadata/", "description": ""}, {"name": "YouTube", "url": "https://www.youtube.com", "description": ""}, {"name": "yt-dlp", "url": "https://github.com/yt-dlp/yt-dlp/", "description": "Downloads videos from almost any online platform, along with information, thumbnails, subtitles, descriptions, and comments (comments only on a select few sites like Youtube and a few small sites). If a site is not supported, or a useful or crucial piece of metadata, including comments, is missing, create an issue.", "stars": "153k"}, {"name": "Academia", "url": "https://www.academia.edu", "description": ""}, {"name": "Academic Journals", "url": "http://www.academicjournals.org", "description": ""}, {"name": "African Journal Online", "url": "http://www.ajol.info", "description": "is the world's largest and preeminent platform of African-published scholarly journals"}, {"name": "American Society of Civil Engineers", "url": "http://ascelibrary.org", "description": ""}, {"name": "Base", "url": "http://www.base-search.net", "description": ""}, {"name": "Bibsonomy", "url": "http://www.bibsonomy.org", "description": ""}, {"name": "Core", "url": "https://core.ac.uk/search", "description": ""}, {"name": "Elsevier", "url": "https://www.elsevier.com", "description": ""}, {"name": "Google Scholar", "url": "https://scholar.google.com", "description": ""}, {"name": "Grey Guide", "url": "http://greyguide.isti.cnr.it", "description": ""}, {"name": "Grey Literature Strategies", "url": "http://greylitstrategies.info", "description": ""}, {"name": "Grey Literature \u2013 List of Gateways", "url": "http://csulb.libguides.com/graylit", "description": ""}, {"name": "GreyNet International", "url": "http://www.greynet.org", "description": ""}, {"name": "HighWire: Free Online Full-text Articles", "url": "http://highwire.stanford.edu/lists/freeart.dtl", "description": ""}, {"name": "Journal Guide", "url": "https://www.journalguide.com", "description": ""}, {"name": "Journal Seek", "url": "http://journalseek.net", "description": ""}, {"name": "JSTOR", "url": "http://www.jstor.org", "description": "Search over 10 million academic journal articles, books, and primary sources."}, {"name": "Lazy Scholar", "url": "http://www.lazyscholar.org", "description": ""}, {"name": "Leibniz Information Centre For Science and Technology University Library", "url": "https://www.tib.eu/en/search-discover/", "description": "indexes all reports of German publicly funded projects and many scientific papers."}, {"name": "Microsoft Academic", "url": "http://academic.research.microsoft.com", "description": ""}, {"name": "NRC Research Press", "url": "http://www.nrcresearchpress.com", "description": ""}, {"name": "OA.mg", "url": "http://oa.mg", "description": ""}, {"name": "Open Access Scientific Journals", "url": "http://www.pagepress.org", "description": ""}, {"name": "Open Grey", "url": "http://www.opengrey.eu", "description": ""}, {"name": "Oxford Journals", "url": "http://www.oxfordjournals.org", "description": ""}, {"name": "PubMed", "url": "http://www.ncbi.nlm.nih.gov/pubmed", "description": "Search more than 27 millions citations for biomedical literature from MEDLINE, life science journals, and online books."}, {"name": "Quetzal Search", "url": "https://www.quetzal-search.info", "description": ""}, {"name": "Research Gate", "url": "http://www.researchgate.net", "description": ""}, {"name": "SAGE Journals", "url": "http://online.sagepub.com", "description": ""}, {"name": "Science Publications", "url": "http://www.thescipub.com", "description": ""}, {"name": "ScienceDirect", "url": "http://www.sciencedirect.com", "description": ""}, {"name": "ScienceDomain", "url": "http://www.sciencedomain.org", "description": ""}, {"name": "SCIRP", "url": "http://www.scirp.org", "description": ""}, {"name": "Springer", "url": "http://link.springer.com", "description": ""}, {"name": "Taylor & Francis Online", "url": "http://www.tandfonline.com", "description": ""}, {"name": "The Open Syllabus Project", "url": "http://opensyllabusproject.org/", "description": ""}, {"name": "Wiley", "url": "http://eu.wiley.com", "description": ""}, {"name": "World Digital Library", "url": "http://www.wdl.org", "description": ""}, {"name": "World Science", "url": "http://worldwidescience.org", "description": ""}, {"name": "Zetoc", "url": "http://zetoc.jisc.ac.uk", "description": ""}, {"name": "Apify's Google Maps Scraper", "url": "https://apify.com/compass/crawler-google-places", "description": ""}, {"name": "ArcGIS", "url": "https://livingatlas.arcgis.com/en/browse/", "description": ""}, {"name": "Atlas", "url": "https://atlas.co", "description": ""}, {"name": "Atlasify", "url": "http://www.atlasify.com", "description": ""}, {"name": "Baidu Maps", "url": "https://map.baidu.com/", "description": ""}, {"name": "Batchgeo", "url": "http://batchgeo.com", "description": ""}, {"name": "Bing Maps", "url": "http://www.bing.com/maps", "description": ""}, {"name": "CartoDB", "url": "https://cartodb.com", "description": ""}, {"name": "Colorbrewer", "url": "http://colorbrewer2.org", "description": ""}, {"name": "CrowdMap", "url": "https://crowdmap.com", "description": ""}, {"name": "CTLRQ Address Lookup", "url": "https://ctrlq.org/maps/address", "description": ""}, {"name": "digiKam", "url": "https://www.digikam.org/", "description": ""}, {"name": "Dominoc925", "url": "https://dominoc925-pages.appspot.com/mapplets/cs_mgrs.html", "description": ""}, {"name": "DualMaps", "url": "https://www.mapchannels.com/dualmaps7/map.htm", "description": ""}, {"name": "Esri", "url": "http://www.esri.com", "description": ""}, {"name": "Flash Earth", "url": "http://www.flashearth.com", "description": ""}, {"name": "GeoGig", "url": "http://geogig.org", "description": ""}, {"name": "GeoInfer", "url": "https://geoinfer.com", "description": "Image geolocation tool, no EXIF data required."}, {"name": "GeoGuessr.ai", "url": "https://geoguessr.ai", "description": "AI-powered geolocation tool for identifying locations from images."}, {"name": "GeoNames", "url": "http://www.geonames.org", "description": ""}, {"name": "Google Earth Pro", "url": "https://www.google.com/intl/en/earth/versions/#earth-pro", "description": ""}, {"name": "Google Earth", "url": "http://www.google.com/earth", "description": ""}, {"name": "Google Maps", "url": "https://www.google.com/maps", "description": ""}, {"name": "Google My Maps", "url": "https://www.google.com/maps/about/mymaps", "description": ""}, {"name": "GPSVisualizer", "url": "http://www.gpsvisualizer.com", "description": ""}, {"name": "GrassGIS", "url": "http://grass.osgeo.org", "description": ""}, {"name": "Here", "url": "http://here.com", "description": ""}, {"name": "Hyperlapse", "url": "https://github.com/TeehanLax/Hyperlapse.js", "description": "", "stars": "2.6k"}, {"name": "Inspire Geoportal", "url": "http://inspire-geoportal.ec.europa.eu", "description": ""}, {"name": "Instant Google Street View", "url": "http://www.instantstreetview.com", "description": ""}, {"name": "InstantAtlas", "url": "http://www.instantatlas.com", "description": ""}, {"name": "KartaView", "url": "https://kartaview.org/map/", "description": ""}, {"name": "Kartograph", "url": "http://kartograph.org", "description": ""}, {"name": "Leaflet", "url": "http://leafletjs.com", "description": ""}, {"name": "Liveuamap", "url": "https://liveuamap.com/", "description": ""}, {"name": "Map Maker", "url": "https://maps.co", "description": ""}, {"name": "MapAList", "url": "http://mapalist.com", "description": ""}, {"name": "MapBox", "url": "https://www.mapbox.com", "description": ""}, {"name": "Mapchart.net", "url": "https://mapchart.net", "description": ""}, {"name": "MapChecking", "url": "https://www.mapchecking.com/", "description": ""}, {"name": "Maperitive", "url": "http://maperitive.net", "description": ""}, {"name": "MapHub", "url": "https://maphub.net", "description": ""}, {"name": "Mapillary", "url": "https://www.mapillary.com/app/", "description": ""}, {"name": "MapJam", "url": "http://mapjam.com", "description": ""}, {"name": "Mapline", "url": "https://mapline.com", "description": ""}, {"name": "Mapquest", "url": "https://www.mapquest.com", "description": ""}, {"name": "Modest Maps", "url": "http://modestmaps.com", "description": ""}, {"name": "NGA GEOINT", "url": "https://github.com/ngageoint", "description": ""}, {"name": "Open Street Map", "url": "http://www.openstreetmap.org", "description": ""}, {"name": "OpenLayers", "url": "http://openlayers.org", "description": ""}, {"name": "Perry Castaneda Library", "url": "https://www.lib.utexas.edu/maps", "description": ""}, {"name": "Pic2Map", "url": "https://www.pic2map.com/", "description": ""}, {"name": "Polymaps", "url": "http://polymaps.org", "description": ""}, {"name": "QGIS", "url": "http://qgis.org", "description": ""}, {"name": "QuickMaps", "url": "https://chrome.google.com/webstore/detail/quick-maps/bgbojmobaekecckmomemopckmeipecij", "description": ""}, {"name": "SAS Planet", "url": "http://www.sasgis.org/sasplaneta/", "description": "Software used to view, download and stitch satellite images."}, {"name": "Satellites Pro", "url": "https://satellites.pro/", "description": ""}, {"name": "SatIntel", "url": "https://github.com/ANG13T/SatIntel", "description": "", "stars": "867"}, {"name": "Scribble Maps", "url": "http://scribblemaps.com", "description": ""}, {"name": "Sentinel Hub", "url": "https://www.sentinel-hub.com/explore/sentinelplayground/", "description": ""}, {"name": "SOAR", "url": "https://soar.earth/", "description": ""}, {"name": "StoryMaps", "url": "http://storymaps.arcgis.com/en", "description": ""}, {"name": "SunCalc", "url": "https://www.suncalc.org/", "description": ""}, {"name": "Tableau", "url": "http://www.tableausoftware.com", "description": ""}, {"name": "USGS (EarthExplorer)", "url": "https://earthexplorer.usgs.gov/", "description": ""}, {"name": "ViaMichelin", "url": "http://www.viamichelin.com", "description": ""}, {"name": "View in Google Earth", "url": "http://www.mgmaps.com/kml/#view", "description": ""}, {"name": "Wikimapia", "url": "http://wikimapia.org", "description": ""}, {"name": "Windy", "url": "https://www.windy.com/", "description": ""}, {"name": "World Monitor", "url": "https://www.worldmonitor.app", "description": "Real-time global intelligence platform with live conflict tracking, military flight and vessel monitoring, GPS jamming data, satellite imagery, and geopolitical risk scores across 5 specialized dashboards."}, {"name": "WorldMap Harvard", "url": "http://worldmap.harvard.edu", "description": ""}, {"name": "Worldwide OSINT Tools Map", "url": "https://cipher387.github.io/osintmap/", "description": "A global map of databases and OSINT sources by applicable location."}, {"name": "Yahoo Maps", "url": "https://maps.yahoo.com", "description": ""}, {"name": "Zeemaps", "url": "https://www.zeemaps.com", "description": ""}, {"name": "Zoom Earth", "url": "https://zoom.earth/", "description": ""}, {"name": "1st Headlines", "url": "http://www.1stheadlines.com", "description": ""}, {"name": "ABYZNewsLinks", "url": "http://www.abyznewslinks.com", "description": ""}, {"name": "Agence France-Presse (AFP)", "url": "http://www.afp.com", "description": ""}, {"name": "AllYouCanRead", "url": "http://www.allyoucanread.com", "description": ""}, {"name": "AP", "url": "http://hosted.ap.org", "description": ""}, {"name": "BBC News", "url": "http://www.bbc.co.uk/news", "description": ""}, {"name": "Bing News", "url": "http://www.bing.com/news", "description": ""}, {"name": "CNN", "url": "http://edition.cnn.com", "description": ""}, {"name": "Cyber Alert", "url": "http://www.cyberalert.com", "description": ""}, {"name": "DailyEarth", "url": "http://dailyearth.com", "description": ""}, {"name": "DPA International", "url": "http://www.dpa-international.com", "description": ""}, {"name": "Euronews", "url": "http://www.euronews.com", "description": ""}, {"name": "Factiva", "url": "http://www.dowjones.com/factiva", "description": ""}, {"name": "France24", "url": "http://www.france24.com", "description": ""}, {"name": "Google News", "url": "https://news.google.com", "description": ""}, {"name": "Google News Print Archive", "url": "http://news.google.com/newspapers", "description": ""}, {"name": "HeadlineSpot", "url": "http://www.headlinespot.com", "description": ""}, {"name": "Itar-Tass", "url": "http://www.itar-tass.com", "description": ""}, {"name": "List of Newspapers.com", "url": "http://www.listofnewspapers.com", "description": ""}, {"name": "MagPortal", "url": "http://www.magportal.com", "description": ""}, {"name": "News Map", "url": "http://newsmap.jp", "description": ""}, {"name": "News Now", "url": "http://www.newsnow.co.uk", "description": ""}, {"name": "Newseum - Today Front Pages", "url": "http://www.newseum.org/todaysfrontpages", "description": ""}, {"name": "Newslink", "url": "http://www.newslink.org", "description": ""}, {"name": "NewsLookup", "url": "http://www.newslookup.com", "description": ""}, {"name": "Newspaper Map", "url": "http://newspapermap.com", "description": ""}, {"name": "Newspaperindex", "url": "http://www.newspaperindex.com", "description": ""}, {"name": "Newspapers.com", "url": "http://www.newspapers.com", "description": ""}, {"name": "NewsWhip", "url": "http://www.newswhip.com", "description": ""}, {"name": "OnlineNewspapers", "url": "http://www.onlinenewspapers.com", "description": ""}, {"name": "Paperboy", "url": "http://www.thepaperboy.com", "description": ""}, {"name": "PR Newswire", "url": "http://www.prnewswire.com", "description": ""}, {"name": "Press Reader", "url": "http://www.pressreader.com", "description": ""}, {"name": "Reuters", "url": "http://www.reuters.com", "description": ""}, {"name": "Silobreaker", "url": "http://www.silobreaker.com", "description": ""}, {"name": "Topix", "url": "http://www.topix.com", "description": ""}, {"name": "WorldNews", "url": "http://wn.com", "description": ""}, {"name": "World-Newspapers", "url": "http://www.world-newspapers.com", "description": ""}, {"name": "Yahoo News", "url": "http://news.yahoo.com", "description": ""}, {"name": "Flipboard", "url": "https://flipboard.com", "description": ""}, {"name": "Inshorts", "url": "https://www.inshorts.com", "description": ""}, {"name": "Newsinshorts", "url": "http://newsinshorts.com", "description": ""}, {"name": "Nod", "url": "http://get-nod.com", "description": ""}, {"name": "Reeder", "url": "http://reederapp.com", "description": ""}, {"name": "Spike", "url": "http://www.newswhip.com", "description": ""}, {"name": "Storyful", "url": "http://storyful.com", "description": ""}, {"name": "Superdesk", "url": "https://www.superdesk.org", "description": ""}, {"name": "Trooclick", "url": "http://trooclick.com", "description": ""}, {"name": "Captin Fact", "url": "https://captainfact.io/", "description": ""}, {"name": "Check", "url": "https://meedan.com/check", "description": ""}, {"name": "Emergent", "url": "http://www.emergent.info", "description": ""}, {"name": "Fact Check", "url": "http://www.factcheck.org", "description": ""}, {"name": "Full Fact", "url": "https://fullfact.org", "description": ""}, {"name": "Snopes", "url": "http://www.snopes.com", "description": "The definitive Internet reference source for urban legends, folklore, myths, rumors, and misinformation."}, {"name": "Verification Handbook", "url": "http://verificationhandbook.com", "description": ""}, {"name": "AGOA Data Center", "url": "http://agoa.info", "description": ""}, {"name": "AidData", "url": "http://aiddata.org", "description": ""}, {"name": "AWS Public Datasets", "url": "http://aws.amazon.com/datasets", "description": ""}, {"name": "Bank for International Settlements Statistics", "url": "http://www.bis.org/statistics/index.htm", "description": ""}, {"name": "Berkely Library: Data Lab", "url": "http://www.lib.berkeley.edu/libraries/data-lab", "description": ""}, {"name": "BP Statistical Review of World Energy", "url": "http://www.bp.com/en/global/corporate/energy-economics/statistical-review-of-world-energy.html", "description": ""}, {"name": "Center for International Earth Science Information Network", "url": "http://www.ciesin.org", "description": ""}, {"name": "CEPII", "url": "http://www.cepii.fr/CEPII/en/welcome.asp", "description": ""}, {"name": "CIA World Factbook", "url": "https://www.cia.gov/the-world-factbook/", "description": ""}, {"name": "Data.gov.uk", "url": "https://data.gov.uk", "description": ""}, {"name": "DBPedia", "url": "http://wiki.dbpedia.org", "description": ""}, {"name": "European Union Open Data Portal", "url": "http://open-data.europa.eu/en/data", "description": ""}, {"name": "Eurostat", "url": "http://ec.europa.eu/eurostat", "description": ""}, {"name": "Freebase", "url": "https://developers.google.com/freebase", "description": ""}, {"name": "Gapminder World", "url": "http://www.gapminder.org/data", "description": ""}, {"name": "globalEDGE Database of International Business Statistics", "url": "http://globaledge.msu.edu/tools-and-data/dibs", "description": ""}, {"name": "Google Finance", "url": "https://www.google.com/finance", "description": ""}, {"name": "Google Public Data Explorer", "url": "http://www.google.com/publicdata/directory", "description": ""}, {"name": "Government of Canada Open Data", "url": "http://open.canada.ca/en", "description": ""}, {"name": "HIS Piers", "url": "https://www.ihs.com/products/piers.html", "description": ""}, {"name": "Human Development Reports", "url": "http://hdr.undp.org/en/global-reports", "description": ""}, {"name": "ILO World Employment and Social Outlook Trends", "url": "http://www.ilo.org/global/research/global-reports/weso/2015/lang--en/index.htm", "description": ""}, {"name": "ILOSTAT", "url": "http://www.ilo.org/ilostat/faces/oracle/webcenter/portalapp/pagehierarchy/Page137.jspx?_afrLoop=443508925711569\\&clean=true#%40%3F_afrLoop%3D443508925711569%26clean%3Dtrue%26_adf.ctrl-state%3Dl4dwldaf3_9", "description": ""}, {"name": "IMF World Economic Outlook Database", "url": "http://www.imf.org/external/ns/cs.aspx?id=28", "description": ""}, {"name": "Index Mundi", "url": "http://www.indexmundi.com", "description": ""}, {"name": "International Energy Agency Statistics", "url": "http://www.iea.org/statistics", "description": ""}, {"name": "International Labour Comparisons", "url": "http://www.bls.gov/fls/chartbook.htm", "description": ""}, {"name": "International Trade Center", "url": "http://www.intracen.org/ByCountry.aspx", "description": ""}, {"name": "Junar", "url": "http://junar.com", "description": ""}, {"name": "Knoema", "url": "https://knoema.com", "description": ""}, {"name": "LandMatrix", "url": "http://landmatrix.org", "description": ""}, {"name": "Latinobarometro", "url": "http://www.latinobarometro.org", "description": ""}, {"name": "Library, University of Michigan: Statistics and Datasets", "url": "http://www.lib.umich.edu/browse/Statistics%20and%20Data%20Sets", "description": ""}, {"name": "Nation Master", "url": "http://www.nationmaster.com/statistics", "description": ""}, {"name": "OECD Aid Database", "url": "http://www.oecd.org/dac/stats/data.htm", "description": ""}, {"name": "OECD Data", "url": "https://data.oecd.org", "description": ""}, {"name": "OECD Factbook", "url": "http://www.oecd-ilibrary.org/economics/oecd-factbook_18147364", "description": ""}, {"name": "Open Data Network", "url": "http://www.opendatanetwork.com", "description": ""}, {"name": "Paul Hensel\u2019s General Informational Data Page", "url": "http://www.paulhensel.org/dataintl.html", "description": ""}, {"name": "Penn World Table", "url": "http://www.rug.nl/research/ggdc/data/pwt/pwt-8.1", "description": ""}, {"name": "Pew Research Center", "url": "http://www.pewinternet.org/datasets", "description": ""}, {"name": "Population Reference Bureau Data Finder", "url": "http://www.prb.org/DataFinder.aspx", "description": ""}, {"name": "PRS Risk Indicators", "url": "http://www.prsgroup.com", "description": ""}, {"name": "SESRIC Basic Social and Economic Indicators", "url": "http://www.sesric.org/baseind.php", "description": ""}, {"name": "SESRIC Databases", "url": "http://www.sesric.org/databases-index.php", "description": ""}, {"name": "Statista", "url": "http://www.statista.com", "description": ""}, {"name": "The Atlas of Economic Complexity", "url": "http://atlas.cid.harvard.edu", "description": ""}, {"name": "The Data and Story Library", "url": "http://lib.stat.cmu.edu/DASL", "description": ""}, {"name": "Trading Economics", "url": "http://www.tradingeconomics.com", "description": ""}, {"name": "Transparency.org Corruption Perception Index", "url": "http://www.transparency.org/cpi2015", "description": ""}, {"name": "UN COMTRADE Database", "url": "http://comtrade.un.org", "description": ""}, {"name": "UN Data", "url": "http://data.un.org", "description": ""}, {"name": "UNCTAD Country Fact Sheets", "url": "http://unctad.org/en/Pages/DIAE/World%20Investment%20Report/Country-Fact-Sheets.aspx", "description": ""}, {"name": "UNCTAD Investment Country Profiles", "url": "http://unctad.org/en/Pages/Publications/Investment-country-profiles.aspx", "description": ""}, {"name": "UNCTAD STAT", "url": "http://unctadstat.unctad.org", "description": ""}, {"name": "UNDPs Human Development Index", "url": "http://hdr.undp.org/en/data", "description": ""}, {"name": "UNECE", "url": "http://w3.unece.org/PXWeb/en", "description": ""}, {"name": "UNESCO Institute for Statistics", "url": "http://uis.unesco.org", "description": ""}, {"name": "UNIDO Statistical Databases", "url": "http://www.unido.org/resources/statistics/statistical-databases.html", "description": ""}, {"name": "UNStats Social Indicators", "url": "http://unstats.un.org/unsd/demographic/products/socind", "description": ""}, {"name": "Upsala Conflict Data Program", "url": "http://www.pcr.uu.se/research/UCDP", "description": ""}, {"name": "US Data and Statistics", "url": "https://www.usa.gov/statistics", "description": ""}, {"name": "Vizala", "url": "https://vizala.com", "description": ""}, {"name": "WHO Data", "url": "http://www.who.int/gho/en", "description": ""}, {"name": "World Bank Data", "url": "http://data.worldbank.org", "description": ""}, {"name": "World Bank Data", "url": "http://datatopics.worldbank.org/consumption/home", "description": ""}, {"name": "World Bank Doing Business", "url": "http://www.doingbusiness.org", "description": ""}, {"name": "World Bank Enterprise Surveys", "url": "http://www.enterprisesurveys.org", "description": ""}, {"name": "World Bank Investing Across Borders", "url": "http://iab.worldbank.org", "description": ""}, {"name": "World Integrated Trade Solution", "url": "http://wits.worldbank.org", "description": ""}, {"name": "WTO Statistics", "url": "https://www.wto.org/english/res_e/statis_e/statis_e.htm", "description": ""}, {"name": "Zanran", "url": "http://zanran.com", "description": ""}, {"name": "Alltop", "url": "http://alltop.com", "description": ""}, {"name": "Awasu", "url": "http://www.awasu.com", "description": ""}, {"name": "Bridge.Leslibres", "url": "https://bridge.leslibres.org", "description": ""}, {"name": "Bridge.Suumitsu", "url": "https://bridge.suumitsu.eu", "description": ""}, {"name": "ChangeDetection.io", "url": "https://changedetection.io", "description": ""}, {"name": "ChangeDetection.io Open Source", "url": "https://github.com/dgtlmoon/changedetection.io", "description": "", "stars": "31k"}, {"name": "ChangeDetect", "url": "http://www.changedetect.com", "description": ""}, {"name": "ChangeDetection", "url": "http://www.changedetection.com", "description": ""}, {"name": "Deltafeed", "url": "http://bitreading.com/deltafeed", "description": ""}, {"name": "DiggReader", "url": "http://digg.com/login?next=%2Freader", "description": ""}, {"name": "FeedBooster", "url": "http://www.qsensei.com", "description": ""}, {"name": "Feederator", "url": "http://www.feederator.org", "description": ""}, {"name": "Feed Exileed", "url": "http://feed.exileed.com", "description": ""}, {"name": "Feed Filter Maker", "url": "http://feed.janicek.co", "description": ""}, {"name": "Feedly", "url": "http://www.feedly.com", "description": ""}, {"name": "FeedReader", "url": "http://www.feedreader.com", "description": ""}, {"name": "FetchRSS", "url": "http://fetchrss.com", "description": ""}, {"name": "Flipboard", "url": "http://flipboard.com", "description": ""}, {"name": "FollowThatPage", "url": "http://www.followthatpage.com", "description": ""}, {"name": "Google Alerts", "url": "http://www.google.com/alerts", "description": "A content change detection and notification service."}, {"name": "InfoMinder", "url": "http://www.infominder.com/webminder", "description": ""}, {"name": "Mention", "url": "https://en.mention.com", "description": ""}, {"name": "Netvibes", "url": "http://www.netvibes.com", "description": ""}, {"name": "Newsblur", "url": "http://newsblur.com", "description": ""}, {"name": "OmeaReader", "url": "http://www.jetbrains.com/omea/reader", "description": ""}, {"name": "OnWebChange", "url": "http://onwebchange.com", "description": ""}, {"name": "Reeder", "url": "http://reederapp.com", "description": ""}, {"name": "RSS Bridge", "url": "https://bridge.suumitsu.eu", "description": ""}, {"name": "RSS Feed Reader", "url": "https://chrome.google.com/webstore/detail/rss-feed-reader/pnjaodmkngahhkoihejjehlcdlnohgmp", "description": ""}, {"name": "RSS Micro", "url": "http://www.rssmicro.com", "description": ""}, {"name": "RSS Search Engine", "url": "http://ctrlq.org/rss", "description": ""}, {"name": "RSS Search Hub", "url": "http://www.rsssearchhub.com", "description": ""}, {"name": "RSSOwl", "url": "http://www.rssowl.org", "description": ""}, {"name": "Selfoss", "url": "http://selfoss.aditu.de", "description": ""}, {"name": "Silobreaker", "url": "http://www.silobreaker.com", "description": ""}, {"name": "Talkwalker", "url": "http://www.talkwalker.com", "description": ""}, {"name": "The Old Reader", "url": "http://theoldreader.com", "description": ""}, {"name": "versionista", "url": "http://versionista.com", "description": ""}, {"name": "visualping", "url": "https://visualping.io", "description": ""}, {"name": "WebReader", "url": "http://www.getwebreader.com", "description": ""}, {"name": "WebSite Watcher", "url": "http://www.aignes.com/index.htm", "description": ""}, {"name": "Website-Diff", "url": "https://github.com/GeiserX/Website-Diff", "description": "", "stars": "1"}, {"name": "Winds", "url": "http://winds.getstream.io", "description": ""}, {"name": "Atom", "url": "https://browser.ru/", "description": ""}, {"name": "Brave", "url": "https://brave.com", "description": "is an open-source web browser that allows you to completely block ads and website trackers."}, {"name": "Bromite", "url": "https://www.bromite.org/", "description": "Bromite is a Chromium fork with ad blocking and enhanced privacy; take back your browser. Works only on Android."}, {"name": "CentBrowser", "url": "http://www.centbrowser.com", "description": ""}, {"name": "Chrome", "url": "https://www.google.com/chrome", "description": ""}, {"name": "Comodo Dragon", "url": "https://www.comodo.com/home/browsers-toolbars/browser.php", "description": ""}, {"name": "Coowon", "url": "http://coowon.com", "description": ""}, {"name": "Gnu Icecat", "url": "https://icecatbrowser.org/", "description": ""}, {"name": "Edge", "url": "https://www.microsoft.com/en-us/windows/microsoft-edge/microsoft-edge", "description": ""}, {"name": "Firefox", "url": "https://www.mozilla.org", "description": ""}, {"name": "LibreWolf", "url": "https://librewolf.net", "description": "Privacy-focused Firefox fork with enhanced security defaults."}, {"name": "Maxthon", "url": "http://www.maxthon.com", "description": ""}, {"name": "Mullvad Browser", "url": "https://mullvad.net/en/browser", "description": "Privacy-focused browser developed in collaboration with Tor Project."}, {"name": "Opera", "url": "http://www.opera.com", "description": ""}, {"name": "Safari", "url": "http://www.apple.com/safari", "description": ""}, {"name": "Sleipnir", "url": "http://www.fenrir-inc.com/jp/sleipnir", "description": ""}, {"name": "Slimjet", "url": "http://www.slimjet.com", "description": ""}, {"name": "SRWare Iron", "url": "http://www.srware.net/en/software_srware_iron.php", "description": ""}, {"name": "Tor Browser", "url": "https://www.torproject.org/projects/torbrowser.html.en", "description": "Tor is a free software that prevents people from learning your location or browsing habits by letting you communicate anonymously on the Internet."}, {"name": "Torch", "url": "http://www.torchbrowser.com", "description": ""}, {"name": "UCBrowser", "url": "http://www.ucweb.com", "description": ""}, {"name": "Vivaldi", "url": "https://vivaldi.com", "description": "Powerful, Private and Personal Web Browser."}, {"name": "Waterfox", "url": "https://www.waterfox.net/", "description": "Fast and Private Web Browser. Get privacy out of the box with Waterfox."}, {"name": "Yandex Browser", "url": "https://browser.yandex.com/desktop/main", "description": ""}, {"name": "A1 Website Download", "url": "http://www.microsystools.com/products/website-download", "description": "Download entire websites to disk."}, {"name": "Cyotek WebCopy", "url": "http://www.cyotek.com/cyotek-webcopy", "description": "is a free tool for automatically downloading the content of a website onto your local device."}, {"name": "gmapcatcher", "url": "https://github.com/heldersepu/gmapcatcher", "description": "", "stars": "223"}, {"name": "Hooey webprint", "url": "http://www.hooeeywebprint.com.s3-website-us-east-1.amazonaws.com/download.html", "description": ""}, {"name": "HTTrack", "url": "http://www.httrack.com", "description": "Allows you to download a World Wide Web site from the Internet to a local directory, building recursively all directories, getting HTML, images, and other files from the server to your computer."}, {"name": "Offliberty", "url": "http://offliberty.com", "description": "is a website that lets you access any online content without a permanent Internet connection."}, {"name": "Resolver", "url": "https://metaproductsrevolver.com", "description": ""}, {"name": "SiteSucker", "url": "http://ricks-apps.com/osx/sitesucker/index.html", "description": ""}, {"name": "WebAssistant", "url": "http://www.proxy-offline-browser.com/download.html", "description": ""}, {"name": "Website Ripper Copier", "url": "http://www.tensons.com/products/websiterippercopier", "description": ""}, {"name": "OffShore.cat", "url": "https://offshore.cat/vpn", "description": "list of vpns for the privacy conscious"}, {"name": "TorrentFreak List of VPNs", "url": "https://torrentfreak.com/vpn-services-anonymous-review-2017-170304/", "description": ""}, {"name": "VPN Comparison by That One Privacy Guy", "url": "https://thatoneprivacysite.net/", "description": "is a summary list of top best VPN services."}, {"name": "Aeon", "url": "http://www.aeontimeline.com", "description": ""}, {"name": "Arbor.js", "url": "http://arborjs.org", "description": ""}, {"name": "Beaker", "url": "http://beakernotebook.com", "description": ""}, {"name": "Befunky", "url": "https://www.befunky.com", "description": ""}, {"name": "Bizint", "url": "http://www.bizint.com", "description": ""}, {"name": "Cacoo", "url": "https://cacoo.com", "description": ""}, {"name": "Canva", "url": "https://www.canva.com", "description": ""}, {"name": "Chart.js", "url": "http://www.chartjs.org", "description": "a javascript library that allows you to create charts easly"}, {"name": "chartblocks", "url": "http://www.chartblocks.com", "description": ""}, {"name": "Circos", "url": "http://circos.ca", "description": ""}, {"name": "creately", "url": "http://creately.com", "description": ""}, {"name": "Crossfilter", "url": "http://square.github.io/crossfilter", "description": ""}, {"name": "csvkit", "url": "https://github.com/wireservice/csvkit", "description": "", "stars": "6.4k"}, {"name": "D3js", "url": "https://d3js.org", "description": "is a powerful data visualization javascript library."}, {"name": "Data Visualization Catalogue", "url": "http://datavizcatalogue.com", "description": ""}, {"name": "Datawrapper", "url": "https://datawrapper.de", "description": ""}, {"name": "Dropmark", "url": "http://www.dropmark.com", "description": ""}, {"name": "dygraphs", "url": "http://dygraphs.com", "description": ""}, {"name": "easely", "url": "http://www.easel.ly", "description": ""}, {"name": "Exhibit", "url": "http://www.simile-widgets.org/exhibit", "description": ""}, {"name": "Flot", "url": "http://www.flotcharts.org", "description": ""}, {"name": "FusionCharts", "url": "http://www.fusioncharts.com", "description": ""}, {"name": "Google Developers: Charts", "url": "https://developers.google.com/chart", "description": ""}, {"name": "GraphX", "url": "http://spark.apache.org/graphx", "description": ""}, {"name": "Highcharts", "url": "http://www.highcharts.com", "description": ""}, {"name": "Hohli", "url": "http://charts.hohli.com", "description": ""}, {"name": "Infogr.am", "url": "https://infogr.am", "description": ""}, {"name": "Inkscape", "url": "https://inkscape.org", "description": ""}, {"name": "Java Infovis Toolkit", "url": "http://philogb.github.io/jit", "description": ""}, {"name": "JpGraph", "url": "http://jpgraph.net", "description": ""}, {"name": "jqPlot", "url": "http://www.jqplot.com", "description": "A Versatile and Expandable jQuery Plotting Plugin."}, {"name": "Knoema", "url": "https://knoema.com", "description": ""}, {"name": "Leaflet", "url": "http://leafletjs.com", "description": "an open-source JavaScript library for mobile-friendly interactive maps."}, {"name": "Linkuroius", "url": "http://linkurio.us", "description": ""}, {"name": "Listify", "url": "http://listify.okfnlabs.org", "description": "Turn a Google spreadsheet into a beautiful, searchable listing in seconds."}, {"name": "LocalFocus", "url": "https://www.localfocus.nl", "description": ""}, {"name": "Lucidchart", "url": "https://www.lucidchart.com", "description": "the intelligent diagramming application that brings teams together to make better decisions and build the future."}, {"name": "Mapline", "url": "https://mapline.com", "description": ""}, {"name": "Nodebox", "url": "https://www.nodebox.net", "description": "a family of tools gives you the leverage to create generative design the way you want."}, {"name": "Observable", "url": "https://observablehq.com/", "description": "a modern way to create powerful, performant, polyglot data apps built on open source."}, {"name": "OpenLayers", "url": "http://openlayers.org", "description": "A high-performance, feature-packed library for all your mapping needs."}, {"name": "Palladio", "url": "http://hdlab.stanford.edu/palladio", "description": "Visualize complex historical data with ease."}, {"name": "Perspective", "url": "https://github.com/finos/perspective", "description": "interactive data visualization and analytics component, well-suited for large, streaming and static datasets.", "stars": "10k"}, {"name": "Piktochart", "url": "https://piktochart.com", "description": ""}, {"name": "Pixxa", "url": "http://www.pixxa.com", "description": ""}, {"name": "Plotly", "url": "https://plot.ly", "description": ""}, {"name": "Preceden", "url": "https://www.preceden.com/", "description": "Create a Visual Timeline About Any Topic"}, {"name": "QlikView", "url": "https://www.visualintelligence.co.nz/qlikview", "description": ""}, {"name": "Quadrigram", "url": "http://www.quadrigram.com", "description": ""}, {"name": "Raphael", "url": "http://dmitrybaranovskiy.github.io/raphael", "description": ""}, {"name": "RAW", "url": "http://raw.densitydesign.org", "description": ""}, {"name": "Shanti Interactive", "url": "http://www.viseyes.org", "description": ""}, {"name": "Snappa", "url": "https://snappa.io", "description": ""}, {"name": "StoryMap", "url": "https://storymap.knightlab.com", "description": ""}, {"name": "Tableau Public", "url": "https://public.tableau.com", "description": ""}, {"name": "Tableau", "url": "http://www.tableau.com", "description": ""}, {"name": "Tagul", "url": "https://tagul.com", "description": ""}, {"name": "Textures.js", "url": "https://riccardoscalco.github.io/textures", "description": ""}, {"name": "Tik-tok", "url": "https://datanews.github.io/tik-tok", "description": ""}, {"name": "Tiki-toki", "url": "http://www.tiki-toki.com", "description": ""}, {"name": "Timeflow", "url": "https://github.com/FlowingMedia/TimeFlow/wiki", "description": "", "stars": "459"}, {"name": "Timeline", "url": "http://timeline.knightlab.com", "description": ""}, {"name": "Timeline", "url": "http://www.simile-widgets.org/timeline", "description": ""}, {"name": "Timetoast", "url": "http://www.timetoast.com", "description": ""}, {"name": "Venngage", "url": "https://venngage.com", "description": ""}, {"name": "Vis.js", "url": "http://visjs.org", "description": ""}, {"name": "Visme", "url": "http://www.visme.co", "description": ""}, {"name": "Visualize Free", "url": "http://visualizefree.com", "description": ""}, {"name": "Visualize.me", "url": "http://vizualize.me", "description": ""}, {"name": "visually", "url": "http://create.visual.ly", "description": ""}, {"name": "Vortex", "url": "http://www.dotmatics.com/products/vortex", "description": ""}, {"name": "ZingChart", "url": "http://www.zingchart.com", "description": ""}, {"name": "Gephi", "url": "https://gephi.org", "description": "is an open-source graph and network visualization software."}, {"name": "ORA", "url": "http://www.casos.cs.cmu.edu/projects/ora/software.php", "description": ""}, {"name": "Sentinel Visualizer", "url": "http://www.fmsasg.com", "description": ""}, {"name": "Visual Investigative Scenarios", "url": "https://vis.occrp.org", "description": ""}, {"name": "Wynyard Group", "url": "https://wynyardgroup.com", "description": ""}, {"name": "Abine", "url": "https://www.abine.com", "description": ""}, {"name": "Adium", "url": "https://adium.im", "description": ""}, {"name": "Bitwarden", "url": "https://bitwarden.com", "description": "Open-source password manager with cross-platform support."}, {"name": "boxcryptor", "url": "https://www.boxcryptor.com", "description": ""}, {"name": "CCleaner", "url": "https://www.piriform.com/ccleaner", "description": ""}, {"name": "Chatsecure", "url": "https://chatsecure.org", "description": ""}, {"name": "Disconnect", "url": "https://disconnect.me", "description": ""}, {"name": "Do Not Track", "url": "http://donottrack.us", "description": ""}, {"name": "Duck Duck Go Search Engine", "url": "https://duckduckgo.com", "description": ""}, {"name": "EncSF MP", "url": "http://encfsmp.sourceforge.net", "description": ""}, {"name": "Epic Privacy Browser", "url": "https://www.epicbrowser.com", "description": ""}, {"name": "Eraser", "url": "http://eraser.heidi.ie", "description": ""}, {"name": "FileVault", "url": "https://support.apple.com/en-us/HT204837", "description": ""}, {"name": "Ghostery", "url": "https://www.ghostery.com", "description": ""}, {"name": "GNU PG", "url": "https://www.gnupg.org/download/index.html", "description": ""}, {"name": "GPG Tools", "url": "https://gpgtools.org", "description": ""}, {"name": "Guardian Project", "url": "https://guardianproject.info", "description": ""}, {"name": "Guerrilla Mail", "url": "https://www.guerrillamail.com", "description": ""}, {"name": "Hotspot Shield", "url": "https://www.hotspotshield.com", "description": ""}, {"name": "HTTPs Everywhere", "url": "https://www.eff.org/https-everywhere/", "description": ""}, {"name": "I2P", "url": "https://geti2p.net", "description": ""}, {"name": "justdeleteme", "url": "http://justdelete.me", "description": ""}, {"name": "KeePass Password Safe", "url": "http://keepass.info", "description": "is a free and open-source password manager that uses the most secure encryption algorithms to safegard your passwords."}, {"name": "Lastpass", "url": "https://lastpass.com", "description": ""}, {"name": "Lockbin", "url": "https://lockbin.com", "description": ""}, {"name": "Mailbox", "url": "https://mailbox.org", "description": ""}, {"name": "Mailvelope", "url": "https://www.mailvelope.com", "description": ""}, {"name": "Master Password", "url": "http://masterpasswordapp.com", "description": ""}, {"name": "Nixory", "url": "http://nixory.sourceforge.net", "description": ""}, {"name": "NoScript", "url": "https://noscript.net", "description": ""}, {"name": "Open DNS", "url": "https://www.opendns.com/home-internet-security", "description": ""}, {"name": "Open PGP", "url": "https://www.enigmail.net/index.php/en", "description": ""}, {"name": "Oscobo Search Engine", "url": "https://oscobo.co.uk", "description": ""}, {"name": "OSSEC", "url": "https://ossec.github.io", "description": ""}, {"name": "Panopticlick", "url": "https://panopticlick.eff.org", "description": ""}, {"name": "Peerblock", "url": "http://forums.peerblock.com", "description": ""}, {"name": "Pidgin", "url": "https://www.pidgin.im", "description": ""}, {"name": "Pixel Block", "url": "https://chrome.google.com/webstore/detail/pixelblock/jmpmfcjnflbcoidlgapblgpgbilinlem", "description": ""}, {"name": "Privacy.com", "url": "https://privacy.com", "description": "Virtual payment cards for online privacy and security."}, {"name": "Privacy Badger", "url": "https://www.eff.org/privacybadger", "description": ""}, {"name": "Privazer", "url": "http://privazer.com", "description": ""}, {"name": "Proton Mail", "url": "https://protonmail.com", "description": ""}, {"name": "Qubes", "url": "https://www.qubes-os.org", "description": "a security-focused desktop operating system that aims to provide security through isolation."}, {"name": "Script Safe", "url": "https://chrome.google.com/webstore/detail/scriptsafe/oiigbmnaadbkfbmpbfijlflahbdbdgdf?hl=en", "description": ""}, {"name": "Securesha", "url": "https://securesha.re", "description": ""}, {"name": "Silent circle", "url": "https://www.silentcircle.com", "description": ""}, {"name": "Signal", "url": "https://signal.org", "description": "End-to-end encrypted messaging and calls."}, {"name": "Snort", "url": "https://www.snort.org", "description": ""}, {"name": "Spideroak", "url": "https://spideroak.com", "description": ""}, {"name": "Steganography Online Codec", "url": "https://www.pelock.com/products/steganography-online-codec", "description": ""}, {"name": "Surveilliance Self Defense", "url": "https://ssd.eff.org", "description": ""}, {"name": "Tails", "url": "https://tails.boum.org", "description": ""}, {"name": "Thunderbird", "url": "https://www.thunderbird.net/en-US/", "description": ""}, {"name": "Tor Project", "url": "https://www.torproject.org", "description": ""}, {"name": "uBlock Origin", "url": "https://github.com/gorhill/uBlock", "description": "", "stars": "62k"}, {"name": "Wickr", "url": "https://wickr.com", "description": ""}, {"name": "WOT", "url": "https://www.mywot.com", "description": ""}, {"name": "ZMail", "url": "http://zmail.sourceforge.net", "description": ""}, {"name": "Amass", "url": "https://github.com/owasp-amass/amass", "description": "The amass tool searches Internet data sources, performs brute force subdomain enumeration, searches web archives, and uses machine learning to generate additional subdomain name guesses. DNS name resolution is performed across many public servers so the authoritative server will see the traffic coming from different locations. Written in Go.", "stars": "14k"}, {"name": "Columbus Project", "url": "https://github.com/elmasy-com/columbus", "description": "Columbus Project is an advanced subdomain discovery service with fast, powerful and easy to use API.", "stars": "34"}, {"name": "Merklemap", "url": "https://www.merklemap.com/", "description": "Discover and enumerate all subdomains associated with a website, including those not publicly advertised. Works by ingesting certificate transparency logs."}, {"name": "Hormuz Tracker", "url": "https://github.com/johnsmalls22-rgb/hormuz-tracker", "description": "Real-time Strait of Hormuz vessel tracking with AIS data, dark ship detection, oil prices, and carrier positions.", "stars": "11"}, {"name": "Phantom Tide", "url": "https://github.com/tg12/phantomtide", "description": "Cross-domain OSINT dashboard combining vessel tracking, airspace activity, official notices, environmental context, and satellite detections for maritime and airspace analysis.", "stars": "20"}, {"name": "VesselFinder", "url": "https://www.vesselfinder.com", "description": "a FREE AIS vessel tracking web site. VesselFinder displays real time ship positions and marine traffic detected by global AIS network."}, {"name": "aadinternals", "url": "https://aadinternals.com/osint", "description": "Provides tools and insights for advanced analysis and security testing of Azure Active Directory (AAD) and Microsoft 365."}, {"name": "ArkhamMirror", "url": "https://github.com/mantisfury/ArkhamMirror", "description": "Local-first AI document intelligence with offline RAG, contradiction detection, knowledge graphs, and vision AI table extraction.", "stars": "378"}, {"name": "Barcode Reader", "url": "http://online-barcode-reader.inliteresearch.com", "description": "Decode barcodes in C#, VB, Java, C\\C++, Delphi, PHP and other languages."}, {"name": "BeVigil-CLI", "url": "https://github.com/Bevigil/BeVigil-OSINT-CLI", "description": "A unified command line interface and python library for using BeVigil OSINT API to search for assets such as subdomains, URLs, applications indexed from mobile applications.", "stars": "135"}, {"name": "Cyberbro", "url": "https://github.com/stanfrbd/cyberbro", "description": "A self-hosted application, available as a Dockerized, for effortless searching and reputation checking of observables. Extracts IoCs from raw input and check their reputation using multiple services.", "stars": "619"}, {"name": "CyberGordon", "url": "https://cybergordon.com", "description": "CyberGordon is a threat intelligence search engine. It leverages 30+ sources."}, {"name": "CrowdSec", "url": "https://github.com/crowdsecurity/crowdsec", "description": "An open source, free, and collaborative IPS/IDS software written in Go, able to analyze visitor behavior & provide an adapted response to all kinds of attacks.", "stars": "13k"}, {"name": "Datasploit", "url": "https://github.com/DataSploit/datasploit", "description": "Tool to perform various OSINT techniques on usernames, emails addresses, and domains.", "stars": "3.3k"}, {"name": "Dehashed CLI", "url": "https://github.com/hmaverickadams/DeHashed-API-Tool", "description": "Command-line tool for searching breach databases via DeHashed API.", "stars": "264"}, {"name": "Discoshell", "url": "https://github.com/foozzi/discoshell", "description": "A simple discovery script that uses popular tools like subfinder, amass, puredns, alterx, massdns and others", "stars": "87"}, {"name": "Dorkgpt", "url": "https://www.dorkgpt.com", "description": "Artificial intelligence that generates advanced search queries to find specific or hidden information on the internet."}, {"name": "DuckDuckGo URL scraper", "url": "https://github.com/its0x08/duckduckgo", "description": "A simple DuckDuckGo URL scraper.", "stars": "32"}, {"name": "FaviconHash", "url": "https://kriztalz.sh/favicon-hash/", "description": "Generate favicon hashes of a website for use on Shodan, VirusTotal, Censys, ZoomEye or FOFA."}, {"name": "Find osint tool", "url": "https://find.osint-tool.com", "description": "Searches multiple OSINT tools to find information across various sources."}, {"name": "FOCA", "url": "https://github.com/ElevenPaths/FOCA", "description": "Tool to find metadata and hidden information in the documents.", "stars": "3.5k"}, {"name": "Glit", "url": "https://github.com/shadawck/glit", "description": "Retrieve all mails of users related to a git repository, a git user or a git organization.", "stars": "57"}, {"name": "Greynoise", "url": "https://greynoise.io/", "description": "\"Anti-Threat Intelligence\" Greynoise characterizes the background noise of the internet, so the user can focus on what is actually important."}, {"name": "IntelHub", "url": "https://github.com/tomsec8/IntelHub", "description": "Browser-based open-source OSINT extension. All analysis runs locally (no servers). Features include text profiler, metadata analyzer, site & archive analysis, reverse image search, crypto/telegram analyzers.", "stars": "89"}, {"name": "Hunchly", "url": "https://www.hunch.ly/", "description": "Hunchly is a web capture tool designed specifically for online investigations."}, {"name": "IntellyWeave", "url": "https://github.com/vericle/intellyweave", "description": "AI-powered OSINT platform with GLiNER entity extraction, Mapbox 3D geospatial visualization, and multi-agent archive research across 30+ international archives.", "stars": "57"}, {"name": "LinkScope Client", "url": "https://github.com/AccentuSoft/LinkScope_Client", "description": "LinkScope Client Github repository.", "stars": "460"}, {"name": "LinkScope", "url": "https://accentusoft.com/", "description": "LinkScope is an open source intelligence (OSINT) graphical link analysis tool and automation platform for gathering and connecting information for investigative tasks."}, {"name": "Maltego", "url": "https://www.maltego.com/", "description": "Maltego is an open source intelligence (OSINT) and graphical link analysis tool for gathering and connecting information for investigative tasks."}, {"name": "Mozilla HTTP Observatory", "url": "https://developer.mozilla.org/en-US/observatory", "description": "Observatory\u2069 enhances web security by analyzing compliance with best security practices."}, {"name": "Obsidian", "url": "https://obsidian.md", "description": "Knowledge base and note-taking tool ideal for OSINT case management."}, {"name": "OpenGraph Intel (OGI)", "url": "https://github.com/khashashin/ogi", "description": "Open Source Link Analysis & OSINT Framework. AI Powered Investigation Tool", "stars": "119"}, {"name": "OpenRefine", "url": "https://github.com/OpenRefine", "description": "Free & open source power tool for working with messy data and improving it."}, {"name": "Orbit", "url": "https://github.com/s0md3v/Orbit", "description": "Draws relationships between crypto wallets with recursive crawling of transaction history.", "stars": "597"}, {"name": "OSINT Framework", "url": "http://osintframework.com/", "description": "Web based framework for OSINT."}, {"name": "OSINT-Tool", "url": "https://www.osint-tool.com/", "description": "A browser extension that gives you access to a suite of OSINT utilities (Dehashed, Epieos, Domaintools, Exif data, Reverse image search, etc) directly on any webpage you visit."}, {"name": "OSINT.SH", "url": "https://osint.sh/", "description": "Information Gathering Toolset."}, {"name": "OsintStalker", "url": "https://github.com/milo2012/osintstalker", "description": "Python script for Facebook and geolocation OSINT.", "stars": "708"}, {"name": "Outwit", "url": "http://www.outwit.com", "description": "Find, grab and organize all kinds of data and media from online sources."}, {"name": "PGPKeyAnalyser", "url": "https://kriztalz.sh/pgp-key-analyser/", "description": "Analyse and view the details of a PGP key online without having to download the asc file."}, {"name": "Photon", "url": "https://github.com/s0md3v/Photon", "description": "Crawler designed for OSINT", "stars": "13k"}, {"name": "Pyba", "url": "https://github.com/fauvidoTechnologies/PyBrowserAutomation/", "description": "A browser automation framework which requires low-code to search the web and perform OSINT using DFS and BFS modes, ideal for exploratory tasks.", "stars": "28"}, {"name": "pygreynoise", "url": "https://github.com/GreyNoise-Intelligence/pygreynoise", "description": "Greynoise Python Library", "stars": "177"}, {"name": "QuickCode", "url": "https://quickcode.io/", "description": "Python and R data analysis environment."}, {"name": "Router Passwords", "url": "https://www.routerpasswords.com", "description": "Online database of default router passwords."}, {"name": "SerpApi", "url": "https://serpapi.com/", "description": "Scrapes Google search and 25+ search engines with ease and retruns a raw JSON. Supports 10 API wrappers."}, {"name": "SerpScan", "url": "https://github.com/Alaa-abdulridha/SerpScan", "description": "Powerful PHP script designed to allow you to leverage the power of dorking straight from the comfort of your command line. Analyzes data from Google, Bing, Yahoo, Yandex, and Badiu.", "stars": "70"}, {"name": "Sintelix", "url": "https://sintelix.com/", "description": "Sintelix is an open source intelligence (OSINT) and graphical link analysis tool for gathering and connecting information for investigative tasks."}, {"name": "sn0int", "url": "https://github.com/kpcyrd/sn0int", "description": "Semi-automatic OSINT framework and package manager.", "stars": "2.4k"}, {"name": "SpiderFoot", "url": "https://github.com/smicallef/spiderfoot", "description": "SpiderFoot Github repository.", "stars": "17k"}, {"name": "SpiderFoot", "url": "https://www.spiderfoot.net", "description": "SpiderFoot is an open source intelligence (OSINT) automation platform with over 200 modules for threat intelligence, attack surface monitoring, security assessments and asset discovery."}, {"name": "SpiderSuite", "url": "https://github.com/3nock/SpiderSuite", "description": "An advance, cross-platform, GUI web security crawler.", "stars": "945"}, {"name": "Sub3 Suite", "url": "https://github.com/3nock/sub3suite", "description": "A research-grade suite of tools for intelligence gathering & target mapping with both active and passive(100+ modules) intelligence gathering capabilities.", "stars": "569"}, {"name": "The Harvester", "url": "https://github.com/laramies/theHarvester", "description": "Gather emails, subdomains, hosts, employee names, open ports and banners from different public sources like search engines, PGP key servers and SHODAN computer database.", "stars": "16k"}, {"name": "Unfurl", "url": "https://dfir.blog/unfurl/", "description": "Unfurl analyzes and breaks down URLs into useful forensic components for digital investigation."}, {"name": "Waybackurls", "url": "https://github.com/tomnomnom/waybackurls", "description": "Fetch all URLs known by the Wayback Machine for a domain.", "stars": "4.4k"}, {"name": "Zen", "url": "https://github.com/s0md3v/Zen", "description": "Find email addresses of Github users urls and other data effortlessly", "stars": "591"}, {"name": "Threat Actor Usernames Scrape", "url": "https://github.com/spmedia/Threat-Actor-Usernames-Scrape", "description": "A collection of fresh intel and 350k+ threat actor usernames scraped from various cybercrime sources & forums.", "stars": "179"}, {"name": "GitGuardian - Public GitHub Monitoring", "url": "https://www.gitguardian.com/monitor-public-github-for-secrets", "description": "Monitor public GitHub repositories in real time. Detect secrets and sensitive information to prevent hackers from using GitHub as a backdoor to your business."}, {"name": "OnionScan", "url": "https://github.com/s-rah/onionscan", "description": "Free and open source tool for investigating the Dark Web. Its main goal is to help researchers and investigators monitor and track Dark Web sites.", "stars": "3.2k"}, {"name": "onion-lookup", "url": "https://onion.ail-project.org/", "description": "Free online service and API for checking the existence of Tor hidden services (.onion address) and retrieving their associated metadata. onion-lookup relies on an private AIL instance to obtain the metadata."}, {"name": "OTX AlienVault", "url": "https://otx.alienvault.com/", "description": "Open Threat Exchange is the neighborhood watch of the global intelligence community. It enables private companies, independent security researchers, and government agencies to openly collaborate and share the latest information about emerging threats, attack methods, and malicious actors, promoting greater security across the entire community."}, {"name": "Pharos AI", "url": "https://conflicts.app", "description": "Real-time open-source intelligence dashboard for conflict tracking with interactive geospatial visualization, multi-source RSS monitoring, and actor dossiers."}, {"name": "PhishingSecLists", "url": "https://github.com/spmedia/PhishingSecLists", "description": "This list is to be used with web scanning tools (Gobuster, ffuf, Burp Suite, DirBuster). These lists are specifically tailored and designed for fuzzing phishing, crypto scam landing pages, and other malicious sketch af websites. You can gain vaulable intel on successful hits.", "stars": "80"}, {"name": "REScure Threat Intel Feed", "url": "https://rescure.fruxlabs.com/", "description": "REScure is an independent threat intelligence project which we undertook to enhance our understanding of distributed systems, their integration, the nature of threat intelligence and how to efficiently collect, store, consume, distribute it."}, {"name": "STIX Viewer", "url": "https://stix-viewer.threatlandscape.io/", "description": "An online free STIX 2.1 viewer / visualizer."}, {"name": "lol\\_monitor", "url": "https://github.com/misiektoja/lol_monitor", "description": "Tool for real-time tracking of LoL (League of Legends) players gaming activities including detection when a user starts or finishes a match with support for email alerts, CSV logging, playtime stats and more", "stars": "19"}, {"name": "psn\\_monitor", "url": "https://github.com/misiektoja/psn_monitor", "description": "Tool for real-time tracking of Sony Playstation (PSN) players gaming activities including detection when a user gets online/offline or plays games with support for email alerts, CSV logging, playtime stats and more", "stars": "34"}, {"name": "steam\\_monitor", "url": "https://github.com/misiektoja/steam_monitor", "description": "Tool for real-time tracking of Steam players' gaming activities including detection when a user gets online/offline or plays games with support for email alerts, CSV logging, playtime stats and more", "stars": "41"}, {"name": "xbox\\_monitor", "url": "https://github.com/misiektoja/xbox_monitor", "description": "Tool for real-time tracking of Xbox Live players gaming activities including detection when a user gets online/offline or plays games with support for email alerts, CSV logging, playtime stats and more", "stars": "24"}, {"name": "lastfm\\_monitor", "url": "https://github.com/misiektoja/lastfm_monitor", "description": "Tool for real-time tracking of Last.fm users' listening activity including detection when user gets online & offline, pauses or resumes playback, all played songs, its duration, skipped songs, with optional auto-play, email alerts, CSV logging, session stats and more", "stars": "24"}, {"name": "spotify\\_profile\\_monitor", "url": "https://github.com/misiektoja/spotify_profile_monitor", "description": "Tool for real-time tracking of Spotify users' activities and profile changes, including playlists, with support for email alerts, CSV logging, showing media in the terminal, detection of profile picture changes and more", "stars": "51"}, {"name": "spotify\\_monitor", "url": "https://github.com/misiektoja/spotify_monitor", "description": "Tool for real-time tracking of Spotify friends' listening activity including detection when user gets online & offline, played songs, its duration, skipped songs, with optional auto-play, email alerts, CSV logging, session stats and more", "stars": "96"}, {"name": "Amazing mind reader reveals his \u2018gift\u2019", "url": "https://www.youtube.com/watch?v=F7pYHN9iC9I", "description": ""}, {"name": "Bendobrown", "url": "https://www.youtube.com/c/Bendobrown", "description": ""}, {"name": "Data to Go", "url": "https://www.youtube.com/watch?v=_YRs28yBYuI", "description": ""}, {"name": "SANS OSINT Summit 2021 (Playlist)", "url": "https://www.youtube.com/playlist?list=PLs4eo9Tja8bj3jJvv42LxOkhc2_ylpS9y", "description": ""}, {"name": "See how easily freaks can take over your life", "url": "https://www.youtube.com/watch?v=Rn4Rupla11M", "description": ""}, {"name": "Bellingcat", "url": "https://www.bellingcat.com/", "description": ""}, {"name": "eInvestigator", "url": "https://www.einvestigator.com/", "description": ""}, {"name": "IntelTechniques", "url": "https://inteltechniques.com/", "description": ""}, {"name": "NixIntel", "url": "https://nixintel.info/", "description": ""}, {"name": "OSINT Techniques", "url": "https://www.osinttechniques.com/blog", "description": ""}, {"name": "OSINT Ambition Publication", "url": "https://publication.osintambition.org/", "description": ""}, {"name": "OSINT Team", "url": "https://www.osintteam.com/", "description": ""}, {"name": "OSINTCurious", "url": "https://osintcurio.us/", "description": ""}, {"name": "Sector035", "url": "https://sector035.nl/", "description": ""}, {"name": "Skopenow", "url": "https://www.skopenow.com/news", "description": ""}, {"name": "Sleuth For The Truth", "url": "http://sleuthforthetruth.com/", "description": ""}, {"name": "Social Links", "url": "https://blog.sociallinks.io/", "description": ""}, {"name": "EUvsDisinfo", "url": "https://euvsdisinfo.eu/category/blog/feed/", "description": "Research, analysis, and case studies focused on disinformation narratives and influence operations."}, {"name": "Fake News \u2013 Inforrm's Blog", "url": "https://inforrm.org/tag/fake-news/feed/", "description": "Media law and misinformation analysis relevant to disinformation investigations."}, {"name": "Krebs on Security", "url": "https://krebsonsecurity.com/feed/", "description": "Investigative reporting on cybercrime, breaches, and threat actors."}, {"name": "OSINT Combine Blog", "url": "https://www.osintcombine.com/blog-feed.xml", "description": "Current OSINT tradecraft, investigations, and monitoring workflows."}, {"name": "SANS Internet Storm Center Diary (Full Text)", "url": "https://isc.sans.edu/rssfeed_full.xml", "description": "High-signal incident reports, malware observations, and operational security analysis."}, {"name": "The Citizen Lab", "url": "https://citizenlab.ca/feed/", "description": "Research on surveillance, spyware, censorship, and digital threats relevant to advanced OSINT work."}, {"name": "Trace Labs Blog", "url": "https://www.tracelabs.org/blog/rss.xml", "description": "Missing-person OSINT methodology, case support, and investigative workflows."}, {"name": "appsec.fyi OSINT Resources", "url": "https://appsec.fyi/osint.html", "description": "Curated collection of OSINT resources for cybersecurity, including tools, techniques, and writeups."}, {"name": "Aware-online.com", "url": "https://www.aware-online.com/en/osint-tools", "description": "Curated collection of OSINT tools and methodologies for investigations."}, {"name": "Bellingcat's Online Investigation Toolkit", "url": "http://bit.ly/bcattools", "description": ""}, {"name": "Bellingcat Online Researcher Survey: Tool Wishes", "url": "https://docs.google.com/spreadsheets/d/1vNJRMrlwI7i06diBJtRJWrvt4YuPOqlbUV5o00P_YmE/edit#gid=1378107220", "description": "Wishlist of OSINT tools from a February Bellingcat survey."}, {"name": "Cipherstick", "url": "https://cipherstick.tech", "description": "Free OSINT Puzzles - No Account Needed!"}, {"name": "OSINT Dojo", "url": "https://www.osintdojo.com/resources/", "description": ""}, {"name": "OSINT Belarus", "url": "https://t.me/s/osintby", "description": ""}, {"name": "These Are the Tools Open Source Researchers Say They Need", "url": "https://www.bellingcat.com/resources/2022/08/12/these-are-the-tools-open-source-researchers-say-they-need/", "description": "Results of a survey Bellingcat conducted in February 2022."}, {"name": "OSINT Updates - a free weekly newsletter for OSINTers", "url": "https://osintupdates.com/", "description": ""}, {"name": "awesome-anti-forensic", "url": "https://github.com/remiflavien1/awesome-anti-forensic", "description": "", "stars": "985"}, {"name": "awesome-ctf", "url": "https://github.com/apsdehal/awesome-ctf", "description": "", "stars": "11k"}, {"name": "awesome-forensics", "url": "https://github.com/Cugu/awesome-forensics", "description": "", "stars": "5k"}, {"name": "awesome-hacking", "url": "https://github.com/carpedm20/awesome-hacking", "description": "", "stars": "16k"}, {"name": "awesome-honeypots", "url": "https://github.com/paralax/awesome-honeypots", "description": "", "stars": "10k"}, {"name": "awesome-incident-response", "url": "https://github.com/meirwah/awesome-incident-response", "description": "", "stars": "8.9k"}, {"name": "awesome-lockpicking", "url": "https://github.com/fabacab/awesome-lockpicking", "description": "", "stars": "1.8k"}, {"name": "awesome-malware-analysis", "url": "https://github.com/rshipp/awesome-malware-analysis", "description": "", "stars": "14k"}, {"name": "awesome-pentest", "url": "https://github.com/enaqx/awesome-pentest", "description": "", "stars": "26k"}, {"name": "awesome-privacy", "url": "https://github.com/Lissy93/awesome-privacy/", "description": "", "stars": "9.1k"}, {"name": "awesome-sec-talks", "url": "https://github.com/PaulSec/awesome-sec-talks", "description": "", "stars": "4.2k"}, {"name": "awesome-security", "url": "https://github.com/sbilly/awesome-security", "description": "", "stars": "14k"}, {"name": "awesome-threat-intelligence", "url": "https://github.com/hslatman/awesome-threat-intelligence", "description": "", "stars": "10k"}, {"name": "infosec reference", "url": "https://github.com/rmusser01/Infosec_Reference", "description": "", "stars": "5.9k"}, {"name": "personal-security-checklist", "url": "https://github.com/Lissy93/personal-security-checklist", "description": "", "stars": "21k"}, {"name": "SecLists", "url": "https://github.com/danielmiessler/SecLists", "description": "", "stars": "70k"}, {"name": "security-list", "url": "https://github.com/zbetcheckin/Security_list", "description": "", "stars": "1.9k"}], "notes": []}], "total_entries": 1458}, {"name": "Agi Cocosci", "subcategories": [{"name": "Agi Cocosci \u2014 Contributing", "entries": [{"name": "Papers", "url": "#papers", "description": ""}, {"name": "Academic Tools", "url": "#academic-tools", "description": ""}, {"name": "Institute & Researcher", "url": "#institute--researcher", "description": ""}, {"name": "People & Book", "url": "#people--book", "description": ""}, {"name": "About", "url": "#about", "description": ""}], "notes": []}, {"name": "Agi Cocosci \u2014 Abduction", "entries": [{"name": "Abduction", "url": "https://plato.stanford.edu/entries/abduction/index.html", "description": "***Plato Stanford***. A computational philosophy account on Abduction, one of the three thinking patterns besides Induction and Deduction, being unique for its potential to introduce new ideas into current knowledge."}, {"name": "Scientific Explanation", "url": "https://plato.stanford.edu/entries/scientific-explanation/", "description": "***Plato Stanford***. A computational philosophy account on Scientific Explanation, a canonical application of Abduction."}, {"name": "Scientific Reduction", "url": "https://plato.stanford.edu/entries/scientific-reduction/", "description": "***Plato Stanford***. A computational philosophy account on Scientific Reduction, which comes with no explicit boundary with Explanation."}, {"name": "Non-monotonic Logic", "url": "https://plato.stanford.edu/entries/logic-nonmonotonic/", "description": "***Plato Stanford***. A computational philosophy account on Non-monotonic Logic, a family of formal frameworks devised to capture and represent defeasible inference."}, {"name": "Philosophical Writings of Peirce", "url": "https://4lib.org/book/702071/e8ffe8", "description": "***Courier Corporation***, 1955. \\[[All Versions](https://scholar.google.com/scholar?cluster=3917019015464129592)]. Original writings by C. S. Peirce, the philosopher who first introduces the concept of Abduction."}, {"name": "Inference to the Best Explanation", "url": "https://www.hps.cam.ac.uk/files/lipton-inference.pdf", "description": "***Routledge***, 1991. \\[[All Versions](https://scholar.google.com/scholar?cluster=5097986614430666854)]. Lipton's original paper on Inference to the Best Explanation as a specialized condition of Abduction."}, {"name": "Abductive Reasoning and Learning", "url": "https://link.springer.com/book/10.1007/978-94-017-1733-5", "description": "***Springer***, 2000. \\[[All Versions](https://scholar.google.com/scholar?cluster=12074269365138058159)]. This book contains leading survey papers on the various aspects of Abduction, both logical and numerical approaches."}, {"name": "Abductive Cognition: The Epistemological and Eco-Cognitive Dimensions of Hypothetical Reasoning", "url": "https://link.springer.com/book/10.1007%2F978-3-642-03631-6", "description": "***Springer***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=8707351442527595188)]. Most philosophers of science in the twentieth century have concluded that no logic of creative processes exists and, moreover, that a rational model of discovery is impossible. In short, scientific creative inferences are irrational and there is no \u201creasoning\u201d to hypotheses. On the other hand, some research in the area of artificial intelligence has shown that methods for discovery could be found that are computationally adequate for rediscovering --- or discovering for the first time --- empirical or theoretical laws and theorems."}, {"name": "Explanation and Abductive Inference", "url": "https://cognition.princeton.edu/sites/default/files/cognition/files/explanation_abductive_inference.pdf", "description": "***The Oxford Handbook of Thinking and Reasoning***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=16126850654692681562)]. This chapter reviews evidence from cognitive psychology and cognitive development concerning the structure and function of explanations, with a focus on the role of explanations in learning and inference. The findings highlight the value of understanding explanation and abductive inference both as phenomena in their own right and for the insights they provide concerning foundational aspects of human cognition, such as representation, learning, and inference."}, {"name": "Probabilistic models of cognition: Conceptual foundations", "url": "https://www.cell.com/AJHG/fulltext/S1364-6613\\(06\\", "description": ""}, {"name": "The structure and function of explanations", "url": "https://cognition.princeton.edu/sites/default/files/cognition/files/tics_explanation.pdf", "description": "***Trends in Cognitive Sciences***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=2849189270394400667)]. Generating and evaluating explanations is spontaneous, ubiquitous and fundamental to our sense of understanding. Recent evidence suggests that in the course of an individual's reasoning, engaging in explanation can have profound effects on the probability assigned to causal claims, on how properties are generalized and on learning. These effects follow from two properties of the structure of explanations: explanations accommodate novel information in the context of prior beliefs, and do so in a way that fosters generalization."}, {"name": "Explanatory Preferences Shape Learning and Inference", "url": "https://scholar.princeton.edu/sites/default/files/cognition/files/explanatory_prefs_tics.pdf", "description": "***Trends in Cognitive Sciences***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=2040551538203889465)]. People often learn by seeking explanations, and they assess the viability of hypotheses by considering how well they explain the data. An emerging body of work reveals that both children and adults have strong and systematic intuitions about what constitutes a good explanation, and that these explanatory preferences have a systematic impact on explanation-based processes. In particular, people favor explanations that are simple and broad, with the consequence that engaging in explanation can shape learning and inference by leading people to seek patterns and favor hypotheses that support broad and simple explanations."}, {"name": "The Role of Explanatory Considerations in Updating", "url": "https://www.sciencedirect.com/science/article/pii/S0010027715000955", "description": "***Cognition***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=3089358487428261042)]. This paper investigates experimentally controversy in philosophy about the connection between explanation and inference, of whether judgments of the explanatory goodness of hypotheses do play a role when people revise their degrees of belief in those hypotheses upon the receipt of new evidence."}, {"name": "Explanation, updating, and accuracy", "url": "https://www.tandfonline.com/doi/full/10.1080/20445911.2016.1230122", "description": "***Journal of Cognitive Psychology***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=967127146748155733)]. There is evidence that people update their credences partly on the basis of explanatory considerations. Philosophers have recently argued that to minimise the inaccuracy of their credences, people's updates also ought to be partly based on such considerations. However, there are many ways in which explanatory considerations can factor into updating, not all of which minimise inaccuracy. It is an open question whether in their updating, people take explanatory considerations into account in a way that philosophers would deem recommendable. To address this question, the authors re-analyse data from an experiment reported in Douven and Schupbach, \u201cThe role of explanatory considerations in updating\u201d."}, {"name": "Best, second-best, and good-enough explanations: How they matter to reasoning", "url": "https://psycnet.apa.org/record/2018-03972-001", "description": "***Journal of Experimental Psychology***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=3067550385175104201)]. There is a wealth of evidence that people\u2019s reasoning is influenced by explanatory considerations. Three experiments investigate the descriptive adequacy of a precise proposal to be found in the philosophical literature, to wit, that we should infer to the best explanation, provided certain additional conditions are met. The main conslusions are that (a) the quality of an explanation is a good predictor of people\u2019s willingness to accept that explanation, and a better predictor than the prior probability of the explanation, and (b) if more than one possible explanation is given, people are the less willing to infer the best explanation the better they deem the second-best explanation."}, {"name": "How explanation guides belief change", "url": "https://www.sciencedirect.com/science/article/pii/S1364661321001790", "description": "***Trends in Cognitive Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15240531165875981526)]. Philosophers have argued that people ought to change their graded beliefs via Bayes\u2019 rule. Recent work in psychology indicates that people sometimes violate that rule by attending to explanatory factors. Results from computational modeling suggest that such violations may actually be rational."}, {"name": "Use of current explanations in multicausal abductive reasoning", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1207/s15516709cog2506_2", "description": "***Cognitive Science***, 2001. \\[[All Versions](https://scholar.google.com/scholar?cluster=7816050625957759346\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Kinematic mental simulations in abduction and deduction", "url": "https://www.pnas.org/content/110/42/16766.short", "description": "***Proceedings of the National Academy of Sciences***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=11864820390497230588)]. This paper presents a theory, and its computer implementation, of how mental simulations underlie the abductions of informal algorithms and deductions from these algorithms. Three experiments tested the theory\u2019s predictions, using an environment of a single railway track and a siding. The results corroborated the use of a kinematic mental model in creating and testing informal algorithms and showed that individuals differ reliably in the ability to carry out these tasks."}, {"name": "Patterns of abduction", "url": "https://link.springer.com/article/10.1007/s11229-007-9223-4", "description": "***Synthese***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=15230540023076470385\\&hl=en\\&as_sdt=0,5)]. A categorization for Abduction in the account of pure philosophy."}, {"name": "Abduction: A categorical characterization", "url": "https://www.sciencedirect.com/science/article/pii/S1570868314000895", "description": "***Journal of Applied Logic***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=17834260152484836885\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Defending Abduction", "url": "https://www.journals.uchicago.edu/doi/abs/10.1086/392744", "description": "***Philosophy of Science***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=13895790050138832555\\&hl=en\\&as_sdt=0,5)]."}, {"name": "On the distinction between Peirce's abduction and Lipton's Inference to the best explanation", "url": "https://link.springer.com/article/10.1007/s11229-009-9709-3", "description": "***Synthese***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=7865291004729010145\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Abduction\u2009\u2212\u2009the context of discovery\u2009+\u2009underdetermination\u2009=\u2009inference to the best explanation", "url": "https://link.springer.com/article/10.1007/s11229-019-02337-z", "description": "***Synthese***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4261649938116694095\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Towards an Architecture for Cognitive Vision Using Qualitative Spatio-temporal Representations and Abduction", "url": "https://link.springer.com/chapter/10.1007%2F3-540-45004-1_14", "description": "***Spatial Cognition***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=8072265283930278310\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Abductive inference within a pragmatic framework", "url": "https://link.springer.com/article/10.1007/s11229-018-1824-6", "description": "***Synthese***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=10285954503043361393\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Disjunctive Abduction", "url": "https://link.springer.com/article/10.1007/s00354-019-00059-x", "description": "***New Generation Computing***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=6664745483675209831\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Probabilistic alternatives to Bayesianism: the case of explanationism", "url": "https://www.frontiersin.org/articles/10.3389/fpsyg.2015.00459/full", "description": "***Frontiers in Psychology***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=9016714668469830914\\&hl=en\\&as_sdt=0,5)]. A non-Bayesian account of Abduction."}, {"name": "A Probabilistic Theory of Abductive Reasoning", "url": "https://www.scitepress.org/Link.aspx?doi=10.5220/0010195405620571", "description": "***ICAART***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=450937566244876051\\&hl=en\\&as_sdt=0,5)]. A probabilistic perspective for interpreting Abductive Reasoning."}, {"name": "The order effect in human abductive reasoning: an empirical and computational study", "url": "https://www.tandfonline.com/doi/full/10.1080/09528130600558141?scroll=top\\&needAccess=true", "description": "***Journal of Experimental & Theoretical Artificial Intelligence***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=3803536062463585043\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Abduction, Induction, and Analogy", "url": "https://link.springer.com/chapter/10.1007%2F978-3-642-15223-8_5", "description": "***Model-Based Reasoning in Science and Technology***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=14979764682921693390\\&hl=en\\&as_sdt=0,5)]. The distinctions and relations between Abduction, Induction, and Analogy."}, {"name": "Remembrance of inferences past: Amortization in human hypothesis generation", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0010027718301094", "description": "***Cognition***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=190340622765037472\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. A rational account of human hypothesis generation."}, {"name": "The AHA! Experience: Creativity Through Emergent Binding in Neural Networks", "url": "https://onlinelibrary.wiley.com/doi/full/10.1111/j.1551-6709.2010.01142.x", "description": "***Cognitive Science***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=10006889101167052798\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Explanation-seeking curiosity in childhood", "url": "https://www.sciencedirect.com/science/article/pii/S2352154620300851", "description": "***Current Opinion in Behavioral Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=4167956555501133663\\&hl=en\\&as_sdt=2005)]. A piece of developmental pshchological evidence for Abduction in young children."}, {"name": "A Grammar of Hypotheses for Visualization, Data, and Analysis", "url": "https://arxiv.org/abs/2204.14267", "description": "2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=10321469321980973246)]. This work presents a grammar for expressing hypotheses in visual data analysis to formalize the previously abstract notion of \"analysis tasks.\" Through the lens of this grammar, the authors lay the groundwork for how a user's data analysis questions can be operationalized and automated as a set of hypotheses (a hypothesis space). The authors demonstrate that the grammar-based approach for analysis tasks can provide a systematic method towards unifying three disparate spaces in visualization research: the hypotheses a dataset can express (a data hypothesis space), the hypotheses a user would like to refine or verify through analysis (an analysis hypothesis space), and the hypotheses a visualization design is capable of supporting (a visualization hypothesis space). The authors illustrate how the formalization of these three spaces can inform future research in visualization evaluation, knowledge elicitation, analytic provenance, and visualization recommendation by using a shared language for hypotheses. Finally, the authors compare the proposed grammar-based approach with existing visual analysis models and discuss the potential of a new hypothesis-driven theory of visual analytics."}, {"name": "Scientific Discovery", "url": "https://plato.stanford.edu/entries/scientific-discovery/", "description": "***Plato Stanford***. A computational philosophy account on Scientific Discovery, the process or product of successful scientific inquiry, sometimes an Abduction-like (Explanation) thinking pattern."}, {"name": "Models of Discovery: And Other Topics in the Methods of Science", "url": "https://hk1lib.org/book/2241843/c5d7b3?id=2241843\\&secret=c5d7b3", "description": "***Springer***, 1977. \\[[All Versions](https://scholar.google.com/scholar?cluster=9932701864897299105\\&hl=en\\&as_sdt=0,5)]. The original book on search as scientific thinking."}, {"name": "Scientific discovery: Computational explorations of the creative processes", "url": "https://hk1lib.org/book/970300/6b0ff7?id=970300\\&secret=6b0ff7", "description": "***MIT Press***, 1987. \\[[All Versions](https://scholar.google.com/scholar?cluster=11327000316248254911)]. The book is divided into four parts. Part I introduces the subject of discovery, defines the scope of our work, and discusses some of the issues that have surrounded and still surround our topic. Parts II and III contain the main body of our results, largely in the form of accounts of the performance of computer programs that simulate human thought processes to make scientific discoveries. Part II is devoted largely to the processes for inducing quantitative theories from data. Part III is devoted mainly to the processes for inducing qualitative descriptive and structural theories from data. In Part IV, on the basis of our experience, we discuss at a lower level of precision how the programs described in the preceding chapters could be combined into a single, more general discovery system, and we describe a wide range of the other component processes that enter into scientific discovery."}, {"name": "Exploring science: The cognition and development of discovery processes", "url": "https://psycnet.apa.org/record/2000-03968-000", "description": "***MIT Press***, 2000. \\[[All Versions](https://scholar.google.com/scholar?cluster=13091264356550286420)]. In this book, D. Klahr sets out to describe the cognitive and developmental processes that have enabled scientists to make the discoveries that comprise the body of information we call \"scientific knowledge.\" Over the past decade, Klahr and his colleagues have conducted laboratory experiments in which they create discovery contexts, computer-based environments, to evoke the kind of thinking characteristic of scientific discovery in the \"real world.\" In attempting to solve the problems posed by the discovery tasks, experiment participants (from preschoolers to university students) use many of the same higher-order cognitive processes used by practicing scientists. Through his work, Klahr integrates two disparate approaches\u2013the content-based approach and the process-based approach\u2013 to present a comprehensive model of the psychology of scientific discovery."}, {"name": "Dual Space Search During Scientific Reasoning", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1207/s15516709cog1201_1", "description": "***Cognitive Science***, 1988. \\[[All Versions](https://scholar.google.com/scholar?cluster=17542852673494089523\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. The original paper on the dual space search as scientific thinking theory."}, {"name": "Complexity Management in a Discovery Task", "url": "https://escholarship.org/uc/item/94n547fj", "description": "***CogSci'92***, 1992. \\[[All Versions](https://scholar.google.com/scholar?cluster=18138712608977258974)]. Previous psychological research about scientific discovery has often focused on subjects' heuristics for discovering simple concepts with one relevant dimension or a few relevant dimensions with simple two-way interactions. This paper presents results from an experiment in which subjects had to discover a concept involving complex three-way interactions on a multi-valued output by running experiments in a computerized microworld. Twenty-two CMU undergraduates attempted the task, of which sixteen succeeded, in an average of 85 minutes. The analyses focus on three strategies used to regulate task complexity. First, subjects preferred depth-first to breadth-first search, with successful subjects regulating the number of features varied from experiment to experiment most effectively. Second, subjects systematically regulated the length of their experiments. Third, a new explicit search heuristic (Put Upon Stack Heuristic) used by successful subjects is described."}, {"name": "A dual-space model of iteratively deepening exploratory learning", "url": "https://www.sciencedirect.com/science/article/pii/S1071581996900324", "description": "***International Journal of Human-Computer Studies***, 1996. \\[[All Versions](https://scholar.google.com/scholar?cluster=17337189265334825678)]. This paper describes a cognitive model of exploratory learning, which covers both trial-and-error and instruction-taking activities. The model, implemented in Soar, is grounded in empirical data of subjects in a task-oriented, trial-and-error exploratory learning situation. A key empirical finding reflected in the model is the repeated scanning of a subset of the available menu items, with increased attention to items on each successive scan. This is explained in terms of dual search spaces, the external interface and the user's internal knowledge, both of which must be tentatively explored with attention to changing costs and benefits."}, {"name": "Heuristics for Scientific Experimentation: A Developmental Study", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0010028583710030", "description": "***Cognitive Psychology***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=2469515962071844494\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. A piece of evidence on children have basic scientific thinking skills."}, {"name": "A 4-Space Model of Scientific Discovery", "url": "https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.645.248\\&rep=rep1\\&type=pdf", "description": "***CogSci'95***, 1995. \\[[All Versions](https://scholar.google.com/scholar?cluster=1063157789682040473\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. Extending the dual space search."}, {"name": "When to trust the data: Further investigations of system error in a scientific reasoning task", "url": "https://link.springer.com/article/10.3758/BF03201090", "description": "***Memory & Cognition***, 1996. \\[[All Versions](https://scholar.google.com/scholar?cluster=3131191372086488656)]. When evaluating experimental evidence, how do people deal with the possibility that some of the feedback is erroneous? The potential for error means that evidence evaluation must include decisions about when to \u201ctrust the data.\u201d This paper presents two studies that focus on subjects\u2019 responses to erroneous feedback in a hypothesis testing situation\u2014a variant of Wason\u2019s (1960) 2\u20134\u20136 rule discovery task in which some feedback was subject tosystem error: \u201chits\u201d were reported as \u201cmisses\u201d and vice versa. Results show that, in contrast to previous research, people are equally adept at identifying false negatives and false positives; further, successful subjects were less likely to use a positive test strategy (Klayman & Ha, 1987) than were unsuccessful subjects. Finally, although others have found that generating possible hypotheses prior to experimentation increases success and task efficiency, such a manipulation did little to mitigate the effects of system error."}, {"name": "Confirmation, disconfirmation, and information in hypothesis testing", "url": "https://psycnet.apa.org/record/1987-20689-001", "description": "***Psychological Review***, 1987. \\[[All Versions](https://scholar.google.com/scholar?cluster=1954141597807453515\\&hl=en\\&as_sdt=0,5)]. A psychological account on hypothesis testing."}, {"name": "Hypothesis generation, sparse categories, and the positive test strategy", "url": "https://psycnet.apa.org/record/2010-22980-001", "description": "***Psychological Review***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=4329636480235863472\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Children and adults as intuitive scientists", "url": "https://psycnet.apa.org/record/1990-03504-001", "description": "***Psychological Review***, 1989. \\[[All Versions](https://scholar.google.com/scholar?cluster=9577945454476127070\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. A perspective against search as scientific thinking."}, {"name": "Abduction and styles of scientific thinking", "url": "https://link.springer.com/content/pdf/10.1007/s11229-019-02127-7.pdf", "description": "***Synthese***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9336871656706514469\\&hl=en\\&as_sdt=0,5)]. A computational philosophy account connecting Abduction and scientific thinking."}, {"name": "Imagination and the generation of new ideas", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0885201414000744", "description": "***Cognitive Development***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=16920774374067505248)]. A variety of theories have been put forth to explain the function of imagination, most notably that imagination engages and develops children's theory of mind and counterfactual reasoning. This work proposes that a primary role for imagination is as a cognitive mechanism for efficiently generating new ideas without observing new evidence. Learners must generate hypotheses before they can assess the truth of these hypotheses. Given infinite possibilities, how do learners constrain the process of hypothesis generation? The authors suggest that learners represent abstract criteria for the solution to a problem and generate solutions that, if true, would solve the problem. As a preliminary test of this idea, the authors show that, in the absence of any fact of the matter (i.e., when neither prior knowledge nor statistical data distinguishes competing hypotheses), 4\u20136-year-olds (mean: 63 months) systematically converge on solutions to problems, consistent with an ability to imagine the abstract properties of causal problems and their solutions."}, {"name": "How We Know What Not To Think", "url": "https://www.sciencedirect.com/science/article/pii/S1364661319302311", "description": "***Trends in Cognitive Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=13106919756521743226)]. Humans often represent and reason about unrealized possible actions---the vast infinity of things that were not (or have not yet been) chosen. This capacity is central to the most impressive of human abilities: causal reasoning, planning, linguistic communication, moral judgment, etc. Nevertheless, how do we select possible actions that are worth considering from the infinity of unrealized actions that are better left ignored? This work reviews research across the cognitive sciences, and find that the possible actions considered by default are those that are both likely to occur and generally valuable. This paper then offers a unified theory of why. The authors propose that (i) across diverse cognitive tasks, the possible actions we consider are biased towards those of general practical utility, and (ii) a plausible primary function for this mechanism resides in decision making."}, {"name": "Rationalization is rational", "url": "https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/abs/rationalization-is-rational/2A13B99ED09BD802C0924D3681FEC55B", "description": "***Behavioral and Brain Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5165464589274056844)]. \\[[Preprint](https://bpb-us-e1.wpmucdn.com/websites.harvard.edu/dist/0/59/files/2022/03/rationalization_is_rational.pdf)]. Rationalization occurs when a person has performed an action and then concocts the beliefs and desires that would have made it rational. Then, people often adjust their own beliefs and desires to match the concocted ones. While many studies demonstrate rationalization, and a few theories describe its underlying cognitive mechanisms, we have little understanding of its function. Why is the mind designed to construct post hoc rationalizations of its behavior, and then to adopt them? This may accomplish an important task: transferring information between the different kinds of processes and representations that influence our behavior. Human decision making does not rely on a single process; it is influenced by reason, habit, instinct, norms, and so on. Several of these influences are not organized according to rational choice (i.e., computing and maximizing expected value). Rationalization extracts implicit information \u2013 true beliefs and useful desires \u2013 from the influence of these non-rational systems on behavior."}, {"name": "Rationalizing constraints on the capacity for cognitive control", "url": "https://www.sciencedirect.com/science/article/pii/S1364661321001480", "description": "***Trends in Cognitive Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=13060297961922073063)]. Humans are remarkably limited in: (i) how many control-dependent tasks they can execute simultaneously, and (ii) how intensely they can focus on a single task. These limitations are universal assumptions of most theories of cognition. Yet, a rationale for why humans are subject to these constraints remains elusive. This feature review draws on recent insights from psychology, neuroscience, and machine learning, to suggest that constraints on cognitive control may result from a rational adaptation to fundamental, computational dilemmas in neural architectures. The reviewed literature implies that limitations in multitasking may result from a trade-off between learning efficacy and processing efficiency and that limitations in the intensity of commitment to a single task may reflect a trade-off between cognitive stability and flexibility."}, {"name": "Why Imaginary Worlds? The psychological foundations and cultural evolution of fictions with imaginary worlds", "url": "https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/abs/why-imaginary-worlds/CA2AB4B1E1EDD8FE965E6DDB4A047B35", "description": "***Behavioral and Brain Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=16985691366494688837)]. Imaginary worlds are extremely successful. The most popular fictions produced in the last few decades contain such a fictional world. They can be found in all fictional media, from novels (e.g., Lord of The Rings and Harry Potter) to films (e.g., Star Wars and Avatar), video games (e.g., The Legend of Zelda and Final Fantasy), graphic novels (e.g., One Piece and Naruto), and TV series (e.g., Star Trek and Game of Thrones), and they date as far back as ancient literature (e.g., the Cyclops Islands in The Odyssey, 850 BCE). Why such a success? Why so much attention devoted to non-existent worlds? In this paper, the authors propose that imaginary worlds co-opt our preferences for exploration, which have evolved in humans and nonhuman animals alike, to propel individuals toward new environments and new sources of reward. Humans would find imaginary worlds very attractive for the very same reasons, and under the same circumstances, as they are lured by unfamiliar environments in real life. After reviewing research on exploratory preferences in behavioral ecology, environmental esthetics, neuroscience, and evolutionary and developmental psychology, the authors focus on the sources of their variability across time and space, which they argue can account for the variability of the cultural preference for imaginary worlds. This hypothesis can, therefore, explain the way imaginary worlds evolved culturally, their shape and content, their recent striking success, and their distribution across time and populations."}, {"name": "Coalescing the Vapors of Human Experience into a Viable and Meaningful Comprehension", "url": "https://escholarship.org/uc/item/5f64z7d7", "description": "***CogSci'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=5460385008324352958)]. Models of concept learning and theory acquisition often invoke a stochastic search process, in which learners generate hypotheses through some structured random process and thenevaluate them on some data measuring their quality or value. To be successful within a reasonable time-frame, these models need ways of generating good candidate hypotheses evenbefore the data are considered. Schulz (2012a) has proposed that studying the origins of new ideas in more everyday contexts, such as how we think up new names for things, can provide insight into the cognitive processes that generate good hypotheses for learning. We propose a simple generative model for how people might draw on their experience to propose new names in everyday domains such as pub names or action movies, and show that it captures surprisingly well the names that people actually imagine. We discuss the role for an analogous hypothesis-generation mechanism in enabling and constraining causal theory learning."}, {"name": "Functional genomic hypothesis generation and experimentation by a robot scientist", "url": "https://www.nature.com/articles/nature02236", "description": "***Nature***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=17461972625475533182)]. This paper describes a physically implemented robotic system that applies techniques from artificial intelligence to carry out cycles of scientific experimentation. The system automatically originates hypotheses to explain observations, devises experiments to test these hypotheses, physically runs the experiments using a laboratory robot, interprets the results to falsify hypotheses inconsistent with the data, and then repeats the cycle. The system is applied to the determination of gene function using deletion mutants of yeast (Saccharomyces cerevisiae) and auxotrophic growth experiments. The authors built and tested a detailed logical model (involving genes, proteins and metabolites) of the aromatic amino acid synthesis pathway."}, {"name": "Interpretation as abduction", "url": "https://www.sciencedirect.com/science/article/abs/pii/0004370293900154?via%3Dihub", "description": "***Artificial Intelligence***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=12658433318211361322)]. Abduction is inference to the best explanation. The authors have developed an approach to abductive inference, called \u201cweighted abduction\u201d, that has resulted in a significant simplification of how the problem of interpreting texts is conceptualized. The interpretation of a text is the minimal explanation of why the text would be true. More precisely, to interpret a text, one must prove the logical form of the text from what is already mutually known, allowing for coercions, merging redundancies where possible, and making assumptions where necessary. It is shown how such \u201clocal pragmatics\u201d problems as reference resolution, the interpretation of compound nominals, the resolution of syntactic ambiguity and metonymy, and schema recognition can be solved in this manner. Moreover, this approach of \u201cinterpretation as abduction\u201d can be combined with the older view of \u201cparsing as deduction\u201d to produce an elegant and thorough integration of syntax, semantics, and pragmatics, one that spans the range of linguistic phenomena from phonology to discourse structure."}, {"name": "Probabilistic Horn abduction and Bayesian networks", "url": "https://www.sciencedirect.com/science/article/abs/pii/000437029390061F?via%3Dihub", "description": "***Artificial Intelligence***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=7728248035489349629)]. This paper presents a simple framework for Horn-clause abduction, with probabilities associated with hypotheses. The framework incorporates assumptions about the rule base and independence assumptions amongst hypotheses. It is shown how any probabilistic knowledge representable in a discrete Bayesian belief network can be represented in this framework. The main contribution is in finding a relationship between logical and probabilistic notions of evidential reasoning. This provides a useful representation language in its own right, providing a compromise between heuristic and epistemic adequacy."}, {"name": "Abductive Inference in Bayesian Networks: A Review", "url": "https://link.springer.com/chapter/10.1007/978-3-540-39879-0_6", "description": "***Advances in Bayesian Networks***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=8502276402734843212)]. The goal of this paper is to serve as a survey for the problem of abductive inference (or belief revision) in Bayesian networks. Thus, the problem is introduced in its two variants: total abduction (or MPE) and partial abduction (or MAP) . Also, the problem is formulated in its general case, that is, looking for the K best explanations. Then, a (non exhaustive) review of exact and approximate algorithms for dealing with both abductive inference problems is carried out. Finally, the authors collect the main complexity results appeared in the literature for both problems (MPE and MAP)."}, {"name": "Abductive Logic Programming", "url": "https://academic.oup.com/logcom/article-abstract/2/6/719/942121", "description": "***Journal of Logic Computation***, 1992. \\[[All Versions](https://scholar.google.com/scholar?cluster=18119357517656745518)]. This paper is a survey and critical overview of recent work on the extension of logic programming to perform abductive reasoning (abductive logic programming). The authors outline the general framework of abduction and its applications to knowledge assimilation and default reasoning; and they introduce an argumentation-theoretic approach to the use of abduction as an interpretation for negation as failure."}, {"name": "ACLP: Abductive Constraint Logic Programming", "url": "https://www.sciencedirect.com/science/article/pii/S0743106699000758", "description": "***The Journal of Logic Programming***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=14319574550421192429)]. This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and enhanced by its non-trivial integration with constraint solving. This integration of constraint solving into abductive reasoning facilitates a general form of constructive abduction and enables the application of abduction to computationally demanding problems. The paper studies the formal declarative and operational semantics of the ACLP framework together with its application to various problems."}, {"name": "Abduction in Logic Programming", "url": "https://link.springer.com/chapter/10.1007/3-540-45628-7_16", "description": "***Computational Logic***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=902643678163312237)]. \\[[Preprint](https://web.stanford.edu/class/cs227/Readings/Abudction%20in%20LP.pdf)]. Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over the last ten years and to take a critical view of these developments from several perspectives: logical, epistemological, computational and suitability to application. The paper attempts to expose some of the challenges and prospects for the further development of the field."}, {"name": "Bayesian Abductive Logic Programs: A Probabilistic Logic for Abductive Reasoning", "url": "https://dl.acm.org/doi/abs/10.5555/2283696.2283887", "description": "***IJCAI'11***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=4453424083730209198)]. \\[[Preprint](https://www.cs.utexas.edu/~ml/papers/raghavan.starai10.pdf)]. This work introduces Bayesian Abductive Logic Programs (BALP), a probabilistic logic that adapts Bayesian Logic Programs (BLPs) for abductive reasoning. Like BLPs, BALPs also combine first-order logic and Bayes nets. However, unlike BLPs, which use deduction to construct Bayes nets, BALPs employ logical abduction. As a result, BALPs are more suited for problems like plan/activity recognition that require abductive reasoning."}, {"name": "Abductive Plan Recognition by Extending Bayesian Logic Programs", "url": "https://www.cs.utexas.edu/~ml/papers/raghavan.ecml11.pdf", "description": "***ECML'11***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=7276511797197017483)]. Plan recognition is the task of predicting an agent\u2019s top-level plans based on its observed actions. It is an abductive reasoning task that involves inferring cause from effect. Most existing approaches to plan recognition use either first-order logic or probabilistic graphical models. While the former cannot handle uncertainty, the latter cannot handle structured representations. In order to overcome these limitations, this work develops an approach to plan recognition using Bayesian Logic Programs (BLPs), which combine first-order logic and Bayesian networks. Since BLPs employ logical deduction to construct the networks, they cannot be used effectively for plan recognition. Therefore, the authors extend BLPs to use logical abduction to construct Bayesian networks and call the resulting model Bayesian Abductive Logic Programs (BALPs). The authors learn the parameters in BALPs using the Expectation Maximization algorithm adapted for BLPs. Finally, the authors present an experimental evaluation of BALPs on three benchmark data sets and compare its performance with the state-of-the-art for plan recognition."}, {"name": "An Approach to Abductive Reasoning in Equational Logic", "url": "https://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6624/6619", "description": "***IJCAI'13***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=686895264429811190)]. Abduction has been extensively studied in propositional logic because of its many applications in artificial intelligence. However, its intrinsic complexity has been a limitation to the implementation of abductive reasoning tools in more expressive logics. The authors have devised such a tool in ground flat equational logic, in which literals are equations or disequations between constants. The tool is based on the computation of prime implicates. It uses a relaxed paramodulation calculus, designed to generate all prime implicates of a formula, together with a carefully defined data structure storing the implicates and able to efficiently detect, and remove, redundancies."}, {"name": "Abduction-Based Explanations for Machine Learning Models", "url": "https://ojs.aaai.org//index.php/AAAI/article/view/3964", "description": "***AAAI'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7355960657107994022)]. The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand. Most earlier work on computing explanations is based on heuristic approaches, providing no guarantees of quality, in terms of how close such solutions are from cardinality- or subset-minimal explanations. This paper develops a constraint-agnostic solution for computing explanations for any ML model. The proposed solution exploits abductive reasoning, and imposes the requirement that the ML model can be represented as sets of constraints using some target constraint reasoning system for which the decision problem can be answered with some oracle. The experimental results, obtained on well-known datasets, validate the scalability of the proposed approach as well as the quality of the computed solutions."}, {"name": "Probabilistic Sufficient Explanations", "url": "https://www.ijcai.org/proceedings/2021/0424.pdf", "description": "***IJCAI'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1874102360688341104)]. Understanding the behavior of learned classifiers is an important task, and various black-box explanations, logical reasoning approaches, and model-specific methods have been proposed. This paper introduces probabilistic sufficient explanations, which formulate explaining an instance of classification as choosing the \"simplest\" subset of features such that only observing those features is \"sufficient\" to explain the classification. That is, sufficient to give us strong probabilistic guarantees that the model will behave similarly when all features are observed under the data distribution. In addition, the authors leverage tractable probabilistic reasoning tools such as probabilistic circuits and expected predictions to design a scalable algorithm for finding the desired explanations while keeping the guarantees intact. The experiments demonstrate the effectiveness of the algorithm in finding sufficient explanations, and showcase its advantages compared to Anchors and logical explanations."}, {"name": "Machine Translation Using Abductive Inference", "url": "https://www.aclweb.org/anthology/H91-1024.pdf", "description": "***COLING***, 1990. \\[[All Versions](https://scholar.google.com/scholar?cluster=15275163177548183539)]. Many existing approaches to machine translation take for granted that the information presented in the output is found somewhere in the input, and, moreover, that such information should be expressed at a single representational level, say, in terms of the parse trees or of \"semantic\" assertions. Languages, however, not only express the equivalent information by drastically different linguistic means, but also often disagree in what distinctions should be expressed linguistically at all. For example, in translating from Japanese to English, it is often necessary to supply determiners for noun phrases, and this in general cannot be done without deep understanding of the source text. Similarly, in translating from English to Japanese, politeness considerations, which in English are implicit in the social situation and explicit in very diffuse ways in, for example, the heavy use of hypotheticals, must be realized grammatically in Japanese. Machine translation therefore requires that the appropriate inferences be drawn and that the text be interpreted to some depth. Recently, an elegant approach to inference in discourse interpretation has been developed at a number of sites, all based on the notion of abduction, and the authors have begun to explore its potential application to machine translation. The authors argue that this approach provides the possibility of deep reasoning and of mapping between the languages at a variety of levels."}, {"name": "Automated Biodesign Engineering by Abductive Meta-Interpretive Learning", "url": "https://arxiv.org/abs/2105.07758", "description": "***AAAI Spring Symposium Series 2021 on Artificial Intelligence for Synthetic Biology***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=543730388062329581)]. This work proposes an automated biodesign engineering framework empowered by Abductive Meta-Interpretive Learning (MetaAbd), a novel machine learning approach that combines symbolic and sub-symbolic machine learning, to further enhance the design-build-test-learn cycle by enabling the learning machine to 1) exploit domain knowledge and learn human-interpretable models that are expressed by formal languages such as first-order logic; 2) simultaneously optimise the structure and parameters of the models to make accurate numerical predictions; 3) reduce the cost of experiments and effort on data annotation by actively generating hypotheses and examples."}, {"name": "Human Comprehensible Active Learning of Genome-Scale Metabolic Networks", "url": "https://arxiv.org/abs/2308.12740", "description": "***AAAI Spring Symposium Series 2023 on Computational Scientific Discovery***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=10875437066608527790)]. \\[[Extended Abstract](http://cogsys.org/symposium/discovery-2023/abstracts/Abstract_3169.pdf)]. \\[[Slides](http://cogsys.org/symposium/discovery-2023/talks/Ai.pdf)]. This work introduces a novel machine learning framework ILP-iML1515 based on Inductive Logic Programming (ILP) that performs abductive logical reasoning and actively learns from training examples. The ILP-iML1515 framework 1) allows high-throughput simulations and 2) actively selects experiments that reduce the experimental cost of learning gene functions in comparison to randomly selected experiments."}, {"name": "Automated causal inference in application to randomized controlled clinical trials", "url": "https://www.nature.com/articles/s42256-022-00470-y", "description": "***Nature Machine Intelligence***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=7468801599737513065)]. Randomized controlled trials (RCTs) are considered the gold standard for testing causal hypotheses in the clinical domain; however, the investigation of prognostic variables of patient outcome in a hypothesized cause\u2013effect route is not feasible using standard statistical methods. This work proposes a new automated causal inference method (AutoCI) built on the invariant causal prediction (ICP) framework for the causal reinterpretation of clinical trial data. Compared with existing methods, the authors show that the proposed AutoCI allows one to clearly determine the causal variables of two real-world RCTs of patients with endometrial cancer with mature outcome and extensive clinicopathological and molecular data. This is achieved via suppressing the causal probability of non-causal variables by a wide margin. In ablation studies, the authors further demonstrate that the assignment of causal probabilities by AutoCI remains consistent in the presence of confounders. In conclusion, these results confirm the robustness and feasibility of AutoCI for future applications in real-world clinical analysis."}], "notes": []}, {"name": "Agi Cocosci \u2014 Bayesian Modeling", "entries": [{"name": "Bayesian Epistemology", "url": "https://plato.stanford.edu/entries/epistemology-bayesian/", "description": "***Plato Stanford***. A computational philosophy account on the nature of uncertainty modeling in Bayesian Epistemology."}, {"name": "Probabilistic machine learning and artificial intelligence", "url": "https://www.nature.com/articles/nature14541", "description": "***Nature***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=1783282361269717744)]. Probabilistic modelling provides a framework for understanding what learning is, and has therefore emerged as one of the principal theoretical and practical approaches for designing machines that learn from data acquired through experience. The probabilistic framework, which describes how to represent and manipulate uncertainty about models and predictions, has a central role in scientific data analysis, machine learning, robotics, cognitive science and artificial intelligence. This Review provides an introduction to this framework, and discusses some of the state-of-the-art advances in the field, namely, probabilistic programming, Bayesian optimization, data compression and automatic model discovery."}, {"name": "Generalization, similarity, and Bayesian inference", "url": "https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/generalization-similarity-and-bayesian-inference/595CAA321C9C56270C624057021DE77A", "description": "***Behavioral and Brain Sciences***, 2001. \\[[All Versions](https://scholar.google.com/scholar?cluster=14074987155133342565)]. \\[[Preprint](http://web.mit.edu/cocosci/archive/Papers/tenenbaum_griffiths01.pdf)]. Shepard has argued that a universal law should govern generalization across different domains of perception and cognition, as well as across organisms from different species or even different planets. Starting with some basic assumptions about natural kinds, he derived an exponential decay function as the form of the universal generalization gradient, which accords strikingly well with a wide range of empirical data. However, his original formulation applied only to the ideal case of generalization from a single encountered stimulus to a single novel stimulus, and for stimuli that can be represented as points in a continuous metric psychological space. The authors recast Shepard's theory in a more general Bayesian framework and show how this naturally extends his approach to the more realistic situation of generalizing from multiple consequential stimuli with arbitrary representational structure. This framework also subsumes a version of Tversky's set-theoretic model of similarity, which is conventionally thought of as the primary alternative to Shepard's continuous metric space model of similarity and generalization."}, {"name": "Bayesian modeling of human concept learning", "url": "https://proceedings.neurips.cc/paper_files/paper/1998/hash/d010396ca8abf6ead8cacc2c2f2f26c7-Abstract.html", "description": "***NeurIPS'98***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=3772493362518191863)]. \\[[Preprint](http://web.mit.edu/cocosci/archive/Papers/bayes.pdf)]. This work considers the problem of learning concepts from small numbers of positive examples, a feat which humans perform routinely but which computers are rarely capable of. Bridging machine learning and cognitive science perspectives, this work presents both theoretical analysis and an empirical study with human subjects for the simple task oflearning concepts corresponding to axis-aligned rectangles in a multidimensional feature space. Existing learning models, when applied to this task, cannot explain how subjects generalize from only a few examples of the concept. The author proposes a principled Bayesian model based on the assumption that the examples are a random sample from the concept to be learned. The model gives precise fits to human behavior on this simple task and provides qualitati ve insights into more complex, realistic cases of concept learning."}, {"name": "Rules and Similarity in Concept Learning", "url": "https://proceedings.neurips.cc/paper/1999/hash/86d7c8a08b4aaa1bc7c599473f5dddda-Abstract.html", "description": "***NeurIPS'99***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=10968021160883668417)]. \\[[Preprint](http://web.mit.edu/cocosci/archive/Papers/nips99preprint.pdf)]. This paper argues that two apparently distinct modes of generalizing concepts - abstracting rules and computing similarity to exemplars - should both be seen as special cases of a more general Bayesian learning framework. Bayes explains the specific workings of these two modes - which rules are abstracted, how similarity is measured - as well as why generalization should appear rule- or similarity-based in different situations. This analysis also suggests why the rules/similarity distinction, even if not computationally fundamental, may still be useful at the algorithmic level as part of a principled approximation to fully Bayesian learning."}, {"name": "Theory-based Bayesian models of inductive learning and reasoning", "url": "https://www.cell.com/AJHG/fulltext/S1364-6613\\(06\\", "description": ""}, {"name": "Word learning as Bayesian inference", "url": "https://psycnet.apa.org/doiLanding?doi=10.1037%2F0033-295X.114.2.245", "description": "***Psychological Review***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=5476233692839102256)]. \\[[Preprint](https://tallinzen.net/media/readings/xu_tenenbaum_2007.pdf)]. The authors present a Bayesian framework for understanding how adults and children learn the meanings of words. The theory explains how learners can generalize meaningfully from just one or a few positive examples of a novel word's referents, by making rational inductive inferences that integrate prior knowledge about plausible word meanings with the statistical structure of the observed examples. The theory addresses shortcomings of the two best known approaches to modeling word learning, based on deductive hypothesis elimination and associative learning. Three experiments with adults and children test the Bayesian account's predictions in the context of learning words for object categories at multiple levels of a taxonomic hierarchy. Results provide strong support for the Bayesian account over competing accounts, in terms of both quantitative model fits and the ability to explain important qualitative phenomena. Several extensions of the basic theory are discussed, illustrating the broader potential for Bayesian models of word learning."}, {"name": "How to Grow a Mind: Statistics, Structure, and Abstraction", "url": "https://www.science.org/doi/full/10.1126/science.1192788", "description": "***Science***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=2667398573353002097)]. \\[[Preprint](https://cocosci.princeton.edu/tom/papers/growamind.pdf)]. This review describes recent approaches to reverse-engineering human learning and cognitive development and, in parallel, engineering more humanlike machine learning systems. Computational models that perform probabilistic inference over hierarchies of flexibly structured representations can address some of the deepest questions about the nature and origins of human thought: How does abstract knowledge guide learning and reasoning from sparse data? What forms does our knowledge take, across different domains and tasks? And how is that abstract knowledge itself acquired?"}, {"name": "Human-level concept learning through probabilistic program induction", "url": "https://www.science.org/doi/full/10.1126/science.aab3050", "description": "***Science***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=11844685101409624506)]. \\[[Preprint](https://ai6034.mit.edu/wiki/images/LakeDec2015.pdf)]. \\[[Supplementary Material](https://cims.nyu.edu/~brenden/LakeEtAl2015Science_supp.pdf)]. People learning new concepts can often generalize successfully from just a single example, yet machine learning algorithms typically require tens or hundreds of examples to perform with similar accuracy. People can also use learned concepts in richer ways than conventional algorithms\u2014for action, imagination, and explanation. This work presents a computational model that captures these human learning abilities for a large class of simple visual concepts: handwritten characters from the world\u2019s alphabets. The model represents concepts as simple programs that best explain observed examples under a Bayesian criterion. On a challenging one-shot classification task, the model achieves human-level performance while outperforming recent deep learning approaches."}, {"name": "Building Machines That Learn and Think Like People", "url": "https://www.cambridge.org/core/journals/behavioral-and-brain-sciences/article/building-machines-that-learn-and-think-like-people/A9535B1D745A0377E16C590E14B94993", "description": "***Behavioral and Brain Sciences***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=8504723689348856287)]. \\[[Preprint](https://leylaroksancaglar.github.io/Caglar_Hanson_2017.pdf)]. Recent progress in artificial intelligence has renewed interest in building systems that learn and think like people. Many advances have come from using deep neural networks trained end-to-end in tasks such as object recognition, video games, and board games, achieving performance that equals or even beats that of humans in some respects. Despite their biological inspiration and performance achievements, these systems differ from human intelligence in crucial ways. The authors review progress in cognitive science suggesting that truly human-like learning and thinking machines will have to reach beyond current engineering trends in both what they learn and how they learn it. Specifically, the authors argue that these machines should (1) build causal models of the world that support explanation and understanding, rather than merely solving pattern recognition problems; (2) ground learning in intuitive theories of physics and psychology to support and enrich the knowledge that is learned; and (3) harness compositionality and learning-to-learn to rapidly acquire and generalize knowledge to new tasks and situations. The authors suggest concrete challenges and promising routes toward these goals that can combine the strengths of recent neural network advances with more structured cognitive models."}, {"name": "Building machines that learn and think with people", "url": "https://www.nature.com/articles/s41562-024-01991-9", "description": "***Nature Human Behavior***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=4420595706578245444)]. \\[[Preprint](https://arxiv.org/abs/2408.03943)]. This perspective shows how the science of collaborative cognition can be put to work to engineer systems that really can be called \u2018thought partners\u2019, systems built to meet humans' expectations and complement humans' limitations. The authors lay out several modes of collaborative thought in which humans and artificial intelligence thought partners can engage, and they propose desiderata for human-compatible thought partnerships. Drawing on motifs from computational cognitive science, this work motivates an alternative scaling path for the design of thought partners and ecosystems around their use through a Bayesian lens, whereby the constructed partners actively build and reason over models of the human and world."}, {"name": "The rational basis of representativeness", "url": "http://web.mit.edu/cocosci/archive/Papers/cogsci01_final.pdf", "description": "***CogSci'01***, 2001. \\[[All Versions](https://scholar.google.com/scholar?cluster=11464039134248091466\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Testing a Bayesian Measure of Representativeness Using a Large Image Database", "url": "https://proceedings.neurips.cc/paper/2011/hash/2c89109d42178de8a367c0228f169bf8-Abstract.html", "description": "***NeurIPS'11***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=8576570792794301292\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Constructing a hypothesis space from the Web for large-scale Bayesian word learning", "url": "https://cocosci.princeton.edu/tom/papers/abbott_cogsci2012_wordnet.pdf", "description": "***CogSci'12***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=9266416266046851766\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Modeling rules and similarity in colexification", "url": "https://escholarship.org/content/qt1md755ng/qt1md755ng.pdf", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=11578380234126546169)]. Rule- and similarity-based generalization in colexification."}, {"name": "Human-level few-shot concept induction through minimax entropy learning", "url": "https://www.science.org/doi/full/10.1126/sciadv.adg2488", "description": "***Science Advances***, 2024. \\[[All Versions](https://scholar.google.com/scholar?\\&cluster=9084477652494351940)]. This paper introduces a computational model designed to emulate human inductive reasoning on abstract reasoning tasks, such as those in IQ tests, using a minimax entropy approach. This method combines identifying the most effective constraints on data via minimum entropy with determining the best combination of them via maximum entropy."}, {"name": "Generative Modeling Explained", "url": "https://github.com/YuzheSHI/generative-modeling-explained", "description": "***Statistical Machine Learning Tutorials***, 2022. This tutorial on generative modeling is in part of Statistical Machine Learning Tutorial by Ying Nian Wu at UCLA Statistics. The tutorial goes over the key equations and algorithms for learning recent generative models, including energy-based models, diffusion/score-based models, autoregressive/flow-based models, VAEs, and GANs, and explains the connections between these models.", "stars": "64"}, {"name": "Bayesian Data Analysis", "url": "https://www.taylorfrancis.com/books/mono/10.1201/9780429258411/bayesian-data-analysis-andrew-gelman-donald-rubin-john-carlin-hal-stern", "description": "***Chapman and Hall/CRC***, 1995. \\[[All Versions](https://scholar.google.com/scholar?cluster=5067275302121330689\\&hl=en\\&as_sdt=0,5)]. Don Rubin's introductory book on Bayesian models."}, {"name": "Filters, random fields and maximum entropy (FRAME): Towards a unified theory for texture modeling", "url": "https://link.springer.com/article/10.1023/A:1007925832420", "description": "***International Journal of Computer Vision***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=11604954524863138240)]. \\[[Preprint](https://dash.harvard.edu/bitstream/handle/1/3637117/Mumford_FRAME.pdf?sequence=1)]. This article presents a statistical theory for texture modeling. This theory combines filtering theory and Markov random field modeling through the maximum entropy principle, and interprets and clarifies many previous concepts and methods for texture analysis and synthesis from a unified point of view. The theory characterizes the ensemble of images I with the same texture appearance by a probability distribution f(I) on a random field, and the objective of texture modeling is to make inference about f(I), given a set of observed texture examples."}, {"name": "Object Perception as Bayesian Inference", "url": "https://www.annualreviews.org/content/journals/10.1146/annurev.psych.55.090902.142005", "description": "***Annual Review of Psychology***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=1611451804975333652)]. \\[[Preprint](https://www.cs.jhu.edu/~ayuille/pubs/ucla/A189_dkersten_ARP2004.pdf)]. We perceive the shapes and material properties of objects quickly and reliably despite the complexity and objective ambiguities of natural images. Typical images are highly complex because they consist of many objects embedded in background clutter. Moreover, the image features of an object are extremely variable and ambiguous owing to the effects of projection, occlusion, background clutter, and illumination. The very success of everyday vision implies neural mechanisms, yet to be understood, that discount irrelevant information and organize ambiguous or noisy local image features into objects and surfaces. Recent work in Bayesian theories of visual perception has shown how complexity may be managed and ambiguity resolved through the task-dependent, probabilistic integration of prior object knowledge with image features."}, {"name": "A tale of three probabilistic families: Discriminative, descriptive, and generative models", "url": "https://www.ams.org/journals/qam/2019-77-02/S0033-569X-2018-01528-5/home.html", "description": "***Quarterly of Applied Mathematics***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=6129609629126793774)]. \\[[Preprint](http://www.stat.ucla.edu/~ywu/QAM2018.pdf)]. The pattern theory of Grenander is a mathematical framework where patterns are represented by probability models on random variables of algebraic structures. In this paper, the authors review three families of probability models, namely, the discriminative models, the descriptive models, and the generative models. A discriminative model is in the form of a classifier. It specifies the conditional probability of the class label given the input signal. A descriptive model specifies the probability distribution of the signal, based on an energy function defined on the signal. A generative model assumes that the signal is generated by some latent variables via a transformation. The authors shall review these models within a common framework and explore their connections, and shall also review the recent developments that take advantage of the high approximation capacities of deep neural networks."}, {"name": "From information scaling of natural images to regimes of statistical models", "url": "https://www.jstor.org/stable/43638808?seq=1", "description": "***Quarterly of Applied Mathematics***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=17387130978932998303)]. \\[[Preprint](http://www.stat.ucla.edu/~sczhu/papers/Quarterly_final.pdf)].  One fundamental property of natural image data that distinguishes vision from other sensory tasks such as speech recognition is that scale plays a profound role in image formation and interpretation. Specifically, visual objects can appear at a wide range of scales in the images due to the change of viewing distance as well as camera resolution. The same objects appearing at different scales produce different image data with different statistical properties. In particular, this work shows that the entropy rate of the image data changes over scale. Moreover, the inferential uncertainty changes over scale too. The authors call these changes information scaling. They then examine both empirically and theoretically two prominent and yet largely isolated classes of image models, namely, wavelet sparse coding models and Markov random field models. The results indicate that the two classes of models are appropriate for two different entropy regimes: sparse coding targets low entropy regimes, whereas Markov random fields are appropriate for high entropy regimes. Because information scaling connects different entropy regimes, both sparse coding and Markov random fields are necessary for representing natural image data, and information scaling triggers transitions between these two regimes."}, {"name": "A Theory of Generative ConvNet", "url": "https://proceedings.mlr.press/v48/xiec16.html", "description": "***ICML'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=11062907630625111054)]. The authors show that a generative random field model, which they call generative ConvNet, can be derived from the commonly used discriminative ConvNet, by assuming a ConvNet for multi-category classification and assuming one of the category is a base category generated by a reference distribution. For a further assumption that the non-linearity in the ConvNet is Rectified Linear Unit (ReLU) and the reference distribution is Gaussian white noise, then a generative ConvNet model that is unique among energy-based models is obtained: The model is piecewise Gaussian, and the means of the Gaussian pieces are defined by an auto-encoder, where the filters in the bottom-up encoding become the basis functions in the top-down decoding, and the binary activation variables detected by the filters in the bottom-up convolution process become the coefficients of the basis functions in the top-down deconvolution process."}, {"name": "Cooperative Training of Descriptor and Generator Networks", "url": "https://ieeexplore.ieee.org/abstract/document/8519332", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=18202808849093155435)]. This paper studies the cooperative training of two generative models for image modeling and synthesis. Both models are parametrized by convolutional neural networks (ConvNets). The first model is a deep energy-based model, whose energy function is defined by a bottom-up ConvNet, which maps the observed image to the energy. We call it the descriptor network. The second model is a generator network, which is a non-linear version of factor analysis. It is defined by a top-down ConvNet, which maps the latent factors to the observed image. The maximum likelihood learning algorithms of both models involve MCMC sampling such as Langevin dynamics. This work observes that the two learning algorithms can be seamlessly interwoven into a cooperative learning algorithm that can train both models simultaneously. Specifically, within each iteration of the cooperative learning algorithm, the generator model generates initial synthesized examples to initialize a finite-step MCMC that samples and trains the energy-based descriptor model. After that, the generator model learns from how the MCMC changes its synthesized examples. That is, the descriptor model teaches the generator model by MCMC, so that the generator model accumulates the MCMC transitions and reproduces them by direct ancestral sampling."}, {"name": "Learning Latent Space Energy-Based Prior Model", "url": "https://proceedings.neurips.cc/paper/2020/hash/fa3060edb66e6ff4507886f9912e1ab9-Abstract.html", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=9945264852135249894)]. \\[[Project](https://bpucla.github.io/latent-space-ebm-prior-project/)]. \\[[Code (\u2b5037)](https://github.com/bpucla/latent-space-EBM-prior)]. A milestone paper on Latent Energy-Based Model."}, {"name": "Learning Energy-Based Models by Diffusion Recovery Likelihood", "url": "https://openreview.net/forum?id=v_1Soh8QUNc", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=4399294843209736764)]. \\[[Code (\u2b5054)](https://github.com/ruiqigao/recovery_likelihood)]."}, {"name": "Score-Based Generative Modeling through Stochastic Differential Equations", "url": "https://openreview.net/forum?id=PxTIG12RRHS\\&utm_campaign=NLP%20News\\&utm_medium=email\\&utm_source=Revue%20newsletter", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=14592788616550656262)]."}, {"name": "Latent Space Factorisation and Manipulation via Matrix Subspace Projection", "url": "http://proceedings.mlr.press/v119/li20i.html", "description": "***ICML'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9592355331559392684)]."}, {"name": "Minimax entropy principle and its application to texture modeling", "url": "https://ieeexplore.ieee.org/abstract/document/6796444", "description": "***Neural Computing***, 1997. \\[[All Versions](https://scholar.google.com/scholar?cluster=407872717119429940)]. \\[[Preprint](https://www.dam.brown.edu/people/mumford/vision/papers/1997e--MinimaxEntropy-NC.pdf)]. This article proposes a general theory and methodology, called the minimax entropy principle, for building statistical models for images (or signals) in a variety of applications. This principle consists of two parts. The first is the maximum entropy principle for feature binding (or fusion): for a given set of observed feature statistics, a distribution can be built to bind these feature statistics together by maximizing the entropy over all distributions that reproduce them. The second part is the minimum entropy principle for feature selection: among all plausible sets of feature statistics, we choose the set whose maximum entropy distribution has the minimum entropy. Computational and inferential issues in both parts are addressed; in particular, a feature pursuit procedure is proposed for approximately selecting the optimal set of features. The minimax entropy principle is then corrected by considering the sample variation in the observed feature statistics, and an information criterion for feature pursuit is derived. The minimax entropy principle is applied to texture modeling, where a novel Markov random field (MRF) model, called FRAME (filter, random field, and minimax entropy), is derived, and encouraging results are obtained in experiments on a variety of texture images."}, {"name": "Parameter Expansion for Data Augmentation", "url": "https://www.tandfonline.com/doi/abs/10.1080/01621459.1999.10473879", "description": "***Journal of the American Statistical Association***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=15342818142955984734)]. \\[[Preprint](http://www.stat.ucla.edu/~ywu/research/papers/PXDA.pdf)]. Viewing the observed data of a statistical model as incomplete and augmenting its missing parts are useful for clarifying concepts and central to the invention of two well-known statistical algorithms: expectation-maximization (EM) and data augmentation. Recently, the authors demonstrated that expanding the parameter space along with augmenting the missing data is useful for accelerating iterative computation in an EM algorithm. The main purpose of this article is to rigorously define a parameter expanded data augmentation (PX-DA) algorithm and to study its theoretical properties. The PX-DA is a special way of using auxiliary variables to accelerate Gibbs sampling algorithms and is closely related to reparameterization techniques."}, {"name": "Image segmentation by data-driven markov chain monte carlo", "url": "https://ieeexplore.ieee.org/abstract/document/1000239", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=3461400072144667491)]. \\[[Preprint](http://www.stat.ucla.edu/~sczhu/papers/DDMCMC_reprint.pdf)]. This paper presents a computational paradigm called Data-Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contributes to image segmentation in four aspects. First, it designs efficient and well-balanced Markov Chain dynamics to explore the complex solution space and, thus, achieves a nearly global optimal solution independent of initial segmentations. Second, it presents a mathematical principle and a K-adventurers algorithm for computing multiple distinct solutions from the Markov chain sequence and, thus, it incorporates intrinsic ambiguities in image segmentation. Third, it utilizes data-driven (bottom-up) techniques, such as clustering and edge detection, to compute importance proposal probabilities, which drive the Markov chain dynamics and achieve tremendous speedup in comparison to the traditional jump-diffusion methods. Fourth, the DDMCMC paradigm provides a unifying framework in which the role of many existing segmentation algorithms, such as, edge detection, clustering, region growing, split-merge, snake/balloon, and region competition, are revealed as either realizing Markov chain dynamics or computing importance proposal probabilities. Thus, the DDMCMC paradigm combines and generalizes these segmentation methods in a principled way."}, {"name": "Efficient Learning of Sparse Representations with an Energy-Based Model", "url": "https://proceedings.neurips.cc/paper/2006/file/87f4d79e36d68c3031ccf6c55e9bbd39-Paper.pdf", "description": "***NeurIPS'06***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=2247668190782691760)]."}, {"name": "A Tutorial on Energy-Based Learning", "url": "http://yann.lecun.com/exdb/publis/orig/lecun-06.pdf", "description": "***Predicting Structured Data, MIT Press***, 2006. \\[[All Versiosn](https://scholar.google.com/scholar?cluster=8819502341081664768\\&hl=en\\&as_sdt=0,5)]. Yann LeCun's tutorial on energy-based learning."}, {"name": "Unsupervised Representaton Learning with Deep Convolutional Generative Adversarial Networks", "url": "https://arxiv.org/abs/1511.06434", "description": "***ICLR'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=3321343160055675528\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Analysis of Langevin Monte Carlo via Convex Optimization", "url": "https://www.jmlr.org/papers/v20/18-173.html", "description": "***Journal of Machine Learning Research***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=5305860199396047317)]. This paper provides new insights on the Unadjusted Langevin Algorithm. The authors show that this method can be formulated as the first order optimization algorithm for an objective functional defined on the Wasserstein space of order $2$. Using this interpretation and techniques borrowed from convex optimization, the authors give a non-asymptotic analysis of this method to sample from log-concave smooth target distribution on $\\mathbb{R}^d$. Based on this interpretation, the authors propose two new methods for sampling from a non-smooth target distribution. These new algorithms are natural extensions of the Stochastic Gradient Langevin Dynamics (SGLD) algorithm, which is a popular extension of the Unadjusted Langevin Algorithm for largescale Bayesian inference. Using the optimization perspective, the authors provide non-asymptotic convergence analysis for the newly proposed methods."}, {"name": "A generative vision model that trains with high data efficiency and breaks text-based CAPTCHAs", "url": "https://www.science.org/doi/full/10.1126/science.aag2612", "description": "***Science***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=1478382321633671444)]. \\[[Preprint](https://www.cs.jhu.edu/~ayuille/JHUcourses/ProbabilisticModelsOfVisualCognition2020/Lec22/GeorgeCAPCHAS.pdf)]. Learning from a few examples and generalizing to markedly different situations are capabilities of human visual intelligence that are yet to be matched by leading machine learning models. By drawing inspiration from systems neuroscience, this work introduces a probabilistic generative model for vision in which message-passing\u2013based inference handles recognition, segmentation, and reasoning in a unified way. The model demonstrates excellent generalization and occlusion-reasoning capabilities and outperforms deep neural networks on a challenging scene text recognition benchmark while being 300-fold more data efficient. In addition, the model fundamentally breaks the defense of modern text-based CAPTCHAs (Completely Automated Public Turing test to tell Computers and Humans Apart) by generatively segmenting characters without CAPTCHA-specific heuristics."}, {"name": "Where do hypotheses come from?", "url": "https://www.sciencedirect.com/science/article/pii/S0010028516302766", "description": "***Cognitive Psychology***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=17480320046655923235)]. \\[[Preprint](https://gershmanlab.com/pubs/Dasgupta17.pdf)]. Why are human inferences sometimes remarkably close to the Bayesian ideal and other times systematically biased? In particular, why do humans make near-rational inferences in some natural domains where the candidate hypotheses are explicitly available, whereas tasks in similar domains requiring the self-generation of hypotheses produce systematic deviations from rational inference. This work proposes that these deviations arise from algorithmic processes approximating Bayes\u2019 rule. Specifically in our account, hypotheses are generated stochastically from a sampling process, such that the sampled hypotheses form a Monte Carlo approximation of the posterior."}, {"name": "A Bayesian Analysis of Some Non-parametric Problems", "url": "https://www.jstor.org/stable/2958008?seq=1", "description": "***The Annals of Statistics***, 1973. \\[[All Versions](https://scholar.google.com/scholar?cluster=3969163427460060902)]. \\[[Preprint](https://people.stat.sc.edu/hansont/stat740/Ferguson1973.pdf)]. A classic review on non-parametric problems."}, {"name": "Mixtures of Dirichlet Process with Applications to Bayesian Nonparametric Problems", "url": "https://people.eecs.berkeley.edu/~jordan/courses/281B-spring04/readings/antoniak.pdf", "description": "***The Annals of Statistics***, 1974. \\[[All Versions](https://scholar.google.com/scholar?cluster=17937202534282344046\\&hl=en\\&as_sdt=0,5)]. The original paper on Dirichlet Process modeling for non-parametric problems."}, {"name": "Latent Semantic Indexing: A Probabilistic Analysis", "url": "https://www.sciencedirect.com/science/article/pii/S0022000000917112", "description": "***Journal of Computer and System Sciences***, 2000. \\[[All Versions](https://scholar.google.com/scholar?cluster=7296120469860429813\\&hl=en\\&as_sdt=0,5)]. The original paper on hierarchical topic model."}, {"name": "Nonparametric Bayesian Data Analysis", "url": "https://projecteuclid.org/journals/statistical-science/volume-19/issue-1/Nonparametric-Bayesian-Data-Analysis/10.1214/088342304000000017.full", "description": "***Statistical Science***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=13476170780072319995)]. This paper reviews the current state of nonparametric Bayesian inference. The discussion follows a list of important statistical inference problems, including density estimation, regression, survival analysis, hierarchical models and model validation. For each inference problem the authors review relevant nonparametric Bayesian models and approaches including Dirichlet process (DP) models and variations, P\u00f3lya trees, wavelet based models, neural network models, spline regression, CART, dependent DP models and model validation with DP and P\u00f3lya tree extensions of parametric models."}, {"name": "Finding scientific topics", "url": "https://www.pnas.org/doi/abs/10.1073/pnas.0307752101", "description": "***Proceedings of the National Academy of Sciences***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=17382767110929995134)]. A first step in identifying the content of a document is determining which topics that document addresses. This paper describes a generative model for documents, in which each document is generated by choosing a distribution over topics and then choosing each word in the document from a topic selected according to this distribution. The authors then present a Markov chain Monte Carlo algorithm for inference in this model. The authors use this algorithm to analyze abstracts from PNAS by using Bayesian model selection to establish the number of topics. This work shows that the extracted topics capture meaningful structure in the data, consistent with the class designations provided by the authors of the articles, and outline further applications of this analysis, including identifying \u201chot topics\u201d by examining temporal dynamics and tagging abstracts to illustrate semantic content."}, {"name": "Hierarchical topic models and the nested Chinese restaurant process", "url": "https://proceedings.neurips.cc/paper/2003/file/7b41bfa5085806dfa24b8c9de0ce567f-Paper.pdf", "description": "***NeurIPS'03***, 2003. \\[[All Versions](https://scholar.google.com/scholar?cluster=15040818675282958700\\&hl=en\\&as_sdt=0,5)]. The original paper for nested Chinese restaurant process."}, {"name": "Learning Systems of Concepts with an Infinite Relational Model", "url": "https://www.aaai.org/Papers/AAAI/2006/AAAI06-061.pdf", "description": "***AAAI'06***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=3207350432755252565\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies", "url": "https://dl.acm.org/doi/abs/10.1145/1667053.1667056", "description": "***Journal of the ACM***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=8216933258869737505\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Infinite Latent Feature Models and the Indian Buffet Process", "url": "http://mlg.eng.cam.ac.uk/zoubin/papers/ibptr.pdf", "description": "***Gatsby Computational Neuroscience Unit Technical Report 2005-001***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=13180738480564152907\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Indian Buffet Process: An Introduction and Review", "url": "https://jmlr.org/papers/v12/griffiths11a.html", "description": "***Journal of Machine Learning Research***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=6301314251995890943)]. The Indian buffet process is a stochastic process defining a probability distribution over equivalence classes of sparse binary matrices with a finite number of rows and an unbounded number of columns. This distribution is suitable for use as a prior in probabilistic models that represent objects using a potentially infinite array of features, or that involve bipartite graphs in which the size of at least one class of nodes is unknown. This work gives a detailed derivation of this distribution, and illustrate its use as a prior in an infinite latent feature model. The authors then review recent applications of the Indian buffet process in machine learning, discuss its extensions, and summarize its connections to other stochastic processes."}, {"name": "Nonparametric Bayesian Logic", "url": "https://dl.acm.org/doi/abs/10.5555/3020336.3020347", "description": "***UAI'05***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=18267211625980322095)]. \\[[Preprint](https://www.cs.ubc.ca/~nando/papers/npblog.pdf)]. The Bayesian Logic (BLOG) language was recently developed for defining first-order probability models over worlds with unknown numbers of objects. It handles important problems in AI, including data association and population estimation. This paper extends BLOG by adopting generative processes over function spaces \u2014 known as nonparametrics in the Bayesian literature. This work introduces syntax for reasoning about arbitrary collections of objects, and their properties, in an intuitive manner. By exploiting exchangeability, distributions over unknown objects and their attributes are cast as Dirichlet processes, which resolve difficulties in model selection and inference caused by varying numbers of objects."}, {"name": "Infinite Hidden Relational Models", "url": "https://dl.acm.org/doi/abs/10.5555/3020419.3020485", "description": "***UAI'06***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=2143172296528388141)]. \\[[Preprint](https://www.dbs.ifi.lmu.de/~yu_k/uai06_relation.pdf)]. Relational learning analyzes the probabilistic constraints between the attributes of entities and relationships. This work extends the expressiveness of relational models by introducing for each entity (or object) an infinite-dimensional latent variable as part of a Dirichlet process (DP) mixture model. This work discusses inference in the model, which is based on a DP Gibbs sampler, i.e., the Chinese restaurant process. The authors extended the Chinese restaurant process to be applicable to relational modeling."}, {"name": "Statistical Predicate Invention", "url": "https://alchemy.cs.washington.edu/papers/kok07/kok07.pdf", "description": "***ICML'07***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=17009312281859401704)]. This work proposes statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in structured data, and generalizes hidden variable discovery in statistical models and predicate invention in ILP. This work proposes an initial model for SPI based on second-order Markov logic, in which predicates as well as arguments can be variables, and the domain of discourse is not fully known in advance. The proposed approach iteratively refines clusters of symbols based on the clusters of symbols they appear in atoms with (e.g., it clusters relations by the clusters of the objects they relate)."}, {"name": "Taking the Human Out of the Loop: A Review of Bayesian Optimization", "url": "https://ieeexplore.ieee.org/abstract/document/7352306", "description": "***Proceedings of the IEEE***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=2039456143890648437)]. \\[[Preprint](https://www.cs.princeton.edu/~rpa/pubs/shahriari2016loop.pdf)]. Big Data applications are typically associated with systems involving large numbers of users, massive complex software systems, and large-scale heterogeneous computing and storage architectures. The construction of such systems involves many distributed design choices. The end products (e.g., recommendation systems, medical analysis tools, real-time game engines, speech recognizers) thus involve many tunable configuration parameters. These parameters are often specified and hard-coded into the software by various developers or teams. If optimized jointly, these parameters can result in significant improvements. Bayesian optimization is a powerful tool for the joint optimization of design choices that is gaining great popularity in recent years. It promises greater automation so as to increase both product quality and human productivity. This review paper introduces Bayesian optimization, highlights some of its methodological aspects, and showcases a wide range of applications."}, {"name": "Practical Bayesian Optimization of Machine Learning Algorithms", "url": "https://proceedings.neurips.cc/paper/2012/hash/05311655a15b75fab86956663e1819cd-Abstract.html", "description": "***NeurIPS'12***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=14442949298925775705)]. The use of machine learning algorithms frequently involves careful tuning of learning parameters and model hyperparameters. Unfortunately, this tuning is often a \u201cblack art\u201d requiring expert experience, rules of thumb, or sometimes brute-force search. There is therefore great appeal for automatic approaches that can optimize the performance of any given learning algorithm to the problem at hand. This work considers this problem through the framework of Bayesian optimization, in which a learning algorithm\u2019s generalization performance is modeled as a sample from a Gaussian process (GP). The authors show that certain choices for the nature of the GP, such as the type of kernel and the treatment of its hyperparameters, can play a crucial role in obtaining a good optimizer that can achieve expert-level performance. The authors describe new algorithms that take into account the variable cost (duration) of learning algorithm experiments and that can leverage the presence of multiple cores for parallel experimentation. These proposed algorithms improve on previous automatic procedures and can reach or surpass human expert-level optimization for many algorithms including Latent Dirichlet Allocation, Structured SVMs and convolutional neural networks."}, {"name": "A Tutorial on Bayesian Optimization", "url": "https://arxiv.org/abs/1807.02811", "description": "2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=7971934771645047583)]. Bayesian optimization is an approach to optimizing objective functions that take a long time (minutes or hours) to evaluate. It is best-suited for optimization over continuous domains of less than 20 dimensions, and tolerates stochastic noise in function evaluations. It builds a surrogate for the objective and quantifies the uncertainty in that surrogate using a Bayesian machine learning technique, Gaussian process regression, and then uses an acquisition function defined from this surrogate to decide where to sample. This tutorial describes how Bayesian optimization works, including Gaussian process regression and three common acquisition functions: expected improvement, entropy search, and knowledge gradient. The authors then discuss more advanced techniques, including running multiple function evaluations in parallel, multi-fidelity and multi-information source optimization, expensive-to-evaluate constraints, random environmental conditions, multi-task Bayesian optimization, and the inclusion of derivative information. The authors conclude with a discussion of Bayesian optimization software and future research directions in the field. This tutorial provides a generalization of expected improvement to noisy evaluations, beyond the noise-free setting where it is more commonly applied. This generalization is justified by a formal decision-theoretic argument, standing in contrast to previous ad hoc modifications."}, {"name": "Human-in-the-loop for Bayesian autonomous materials phase mapping", "url": "https://www.cell.com/matter/fulltext/S2590-2385\\(24\\", "description": ""}], "notes": []}, {"name": "Agi Cocosci \u2014 Concepts", "entries": [{"name": "Concepts", "url": "https://plato.stanford.edu/entries/concepts/", "description": "***Plato Stanford***. A collection of the computational philosophical debates about the concepts."}, {"name": "Theory-theory", "url": "https://en.wikipedia.org/wiki/Theory-theory", "description": "***Wikipedia***. Wikipedia for the Theory theory, a perspective that contextualizes concepts in theoretical (or empirical) systems."}, {"name": "Conceptual Change in Childhood", "url": "https://hk1lib.org/book/3659332/11fa44", "description": "***MIT Press***, 1985. \\[[All Versions](https://scholar.google.com/scholar?cluster=11720022076481483465)]. Susan Carey's book on the theory theory of concepts in child development."}, {"name": "Words, thoughts, and theories", "url": "http://library.lol/main/6A8215E9BAEB77F198C98CD75C517E02", "description": "***MIT Press***, 1997. \\[[All Versions](https://scholar.google.com/scholar?cluster=16726462136203686735\\&hl=en\\&as_sdt=0,5)]. Alison Gopnik's book that articulates and defends the \"theory theory\" of cognitive and semantic development, the idea that infants and young children, like scientists, learn about the world by forming and revising theories-a view of the origins of knowledge and meaning that has broad implications for cognitive science."}, {"name": "The Theory Theory", "url": "https://psycnet.apa.org/record/1994-97940-009", "description": "***Mapping the mind: Domain specificity in cognition and culture, Cambridge University Press***, 1994. \\[[All Versions](https://scholar.google.com/scholar?cluster=9397889700764191662\\&hl=en\\&as_sdt=0,5)]. Alison Gopnik's original paper on the theory theory."}, {"name": "The Origin of Concepts", "url": "https://hk1lib.org/book/844457/42178f?id=844457\\&secret=42178f", "description": "***Oxford University Press***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=11493102398422813821\\&hl=en\\&as_sdt=0,5)]. Susan Carey's extended book on the theory theory of concepts in child development."}, {"name": "What we mean when we say semantic: A Consensus statement on the nomenclature of semantic memory", "url": "https://osf.io/preprints/psyarxiv/xrnb2", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=7464626532716945232)]. The aim of this multidisciplinary workgroup was to establish consensus definitions for some of the major recurring constructs in semantic research (e.g., concept, amodal, abstract). These efforts yielded a glossary consisting of succinct definitions, agreement, subjective confidence ratings, relevant theoretical background, and principled dissenting views. These core definitions will potentially yield benchmarks for aligning perspectives and improving cross-disciplinary communication in semantic research."}, {"name": "Reconstructing constructivism: Causal models, Bayesian learning mechanisms, and the theory theory", "url": "https://psycnet.apa.org/record/2012-12791-001", "description": "***Psychological Bulletin***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=11218217347365817167\\&hl=en\\&as_sdt=0,5)]. Alison Gopnik's review on the constructivism idea of developmental research, including the theory theory of concepts."}, {"name": "Similarity involving attributes and relations: Judgments of similarity and difference are not inverses", "url": "https://groups.psych.northwestern.edu/gentner/newpdfpapers/MedinGoldstoneGentner90.pdf", "description": "***Psychological Science***, 1990. \\[[All Versions](https://scholar.google.com/scholar?cluster=13205938250772079784)]. Theory on similarity judgement by attributes and relations."}, {"name": "Organizing conceptual knowledge in humans with a gridlike code", "url": "https://www.science.org/doi/full/10.1126/science.aaf0941", "description": "***Science***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=10995575332310321503)]. \\[[Preprint](http://behavioralhealth2000.com/wp-content/uploads/2017/01/Organizing-conceptual-knowledge-in-humans-with-a-gridlike-code.pdf)]. It has been hypothesized that the brain organizes concepts into a mental map, allowing conceptual relationships to be navigated in a manner similar to that of space. Grid cells use a hexagonally symmetric code to organize spatial representations and are the likely source of a precise hexagonal symmetry in the functional magnetic resonance imaging signal. Humans navigating conceptual two-dimensional knowledge showed the same hexagonal signal in a set of brain regions markedly similar to those activated during spatial navigation. This gridlike signal is consistent across sessions acquired within an hour and more than a week apart. This work's findings suggest that global relational codes may be used to organize nonspatial conceptual representations and that these codes may have a hexagonal gridlike pattern when conceptual knowledge is laid out in two continuous dimensions."}, {"name": "Navigating cognition: Spatial codes for human thinking", "url": "https://www.science.org/doi/full/10.1126/science.aat6766", "description": "***Science***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=1407237757770081862)]. \\[[Preprint](https://doellerlab.com/wp-content/uploads/2018/11/Bellmund_et_al_2018_Science_Navigating-cognition.pdf)]. The hippocampal formation has long been suggested to underlie both memory formation and spatial navigation. This work discusses how neural mechanisms identified in spatial navigation research operate across information domains to support a wide spectrum of cognitive functions. In the proposed framework, place and grid cell population codes provide a representational format to map variable dimensions of cognitive spaces. This highly dynamic mapping system enables rapid reorganization of codes through remapping between orthogonal representations across behavioral contexts, yielding a multitude of stable cognitive spaces at different resolutions and hierarchical levels. Action sequences result in trajectories through cognitive space, which can be simulated via sequential coding in the hippocampus. In this way, the spatial representational format of the hippocampal formation has the capacity to support flexible cognition and behavior."}, {"name": "Structuring Knowledge with Cognitive Maps and Cognitive Graphs", "url": "https://www.cell.com/trends/cognitive-sciences/fulltext/S1364-6613\\(20\\", "description": ""}, {"name": "Natural speech reveals the semantic maps that tile human cerebral cortex", "url": "https://www.nature.com/articles/nature17637", "description": "***Nature***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=14997953800741854188)]. \\[[Preprint](https://www.polyu.edu.hk/cbs/rclcn/images/cdl_articles/H/Huth_et_al._2016.pdf)]. \\[[Code & Tutorial (\u2b5040)](https://github.com/HuthLab/speechmodeltutorial)]. The meaning of language is represented in regions of the cerebral cortex collectively known as the \u2018semantic system\u2019. However, little of the semantic system has been mapped comprehensively, and the semantic selectivity of most regions is unknown. This work systematically maps semantic selectivity across the cortex using voxel-wise modelling of functional MRI (fMRI) data collected while subjects listened to hours of narrative stories. This work shows that the semantic system is organized into intricate patterns that seem to be consistent across individuals. The authors then use a novel generative model to create a detailed semantic atlas. The results suggest that most areas within the semantic system represent information about specific semantic domains, or groups of related concepts, and the atlas shows which domains are represented in each area. This study demonstrates that data-driven methods---commonplace in studies of human neuroanatomy and functional connectivity---provide a powerful and efficient means for mapping functional representations in the brain."}, {"name": "Idiosyncratic Tower of Babel: Individual differences in word-meaning representation increase as word abstractness increases", "url": "https://journals.sagepub.com/doi/full/10.1177/09567976211003877", "description": "***Psychological Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=18214600097352809308)]. \\[[All Versions](http://bilab.bnu.edu.cn/paper/2021/Wang_2021_Psychology%20Science.pdf)]. Humans primarily rely on language to communicate, on the basis of a shared understanding of the basic building blocks of communication: words. Do we mean the same things when we use the same words? Although cognitive neural research on semantics has revealed the common principles of word-meaning representation, the factors underlying the potential individual variations in word meanings are unknown. This work empirically characterized the intersubject consistency of 90 words across 20 adult subjects (10 female) using both behavioral measures (rating-based semantic-relationship patterns) and neuroimaging measures (word-evoked brain activity patterns). Across both the behavioral and neuroimaging experiments, this work showed that the magnitude of individual disagreements on word meanings could be modeled on the basis of how much language or sensory experience is associated with a word and that this variation increases with word abstractness. Uncovering the cognitive and neural origins of word-meaning disagreements across individuals has implications for potential mechanisms to modulate such disagreements."}, {"name": "Semantic projection recovers rich human knowledge of multiple object features from word embeddings", "url": "https://www.nature.com/articles/s41562-022-01316-8", "description": "***Nature Human Behavior***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=2499199921371106654)]. \\[[Preprint](https://cap.csail.mit.edu/sites/default/files/research-pdfs/Semantic%20projection%20recovers%20rich%20human%20knowledge%20of%20multiple%20object%20features%20from%20word%20embeddings.pdf)]. How is knowledge about word meaning represented in the mental lexicon? Current computational models infer word meanings from lexical co-occurrence patterns. They learn to represent words as vectors in a multidimensional space, wherein words that are used in more similar linguistic contexts\u2014that is, are more semantically related\u2014are located closer together. However, whereas inter-word proximity captures only overall relatedness, human judgements are highly context dependent. For example, dolphins and alligators are similar in size but differ in dangerousness. This work proposes a domain-general method to extract context-dependent relationships from word embeddings: \u2018semantic projection\u2019 of word-vectors onto lines that represent features such as size (the line connecting the words \u2018small\u2019 and \u2018big\u2019) or danger (\u2018safe\u2019 to \u2018dangerous\u2019), analogous to \u2018mental scales\u2019. This method recovers human judgements across various object categories and properties. Thus, the geometry of word embeddings explicitly represents a wealth of context-dependent world knowledge."}, {"name": "Using a high-dimensional graph of semantic space to model relationships among words", "url": "https://www.frontiersin.org/articles/10.3389/fpsyg.2014.00385/full", "description": "***Frontiers in Psychology***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=472523411548302295)]. The GOLD model (Graph Of Language Distribution) is a network model constructed based on co-occurrence in a large corpus of natural language that may be used to explore what information may be present in a graph-structured model of language, and what information may be extracted through theoretically-driven algorithms as well as standard graph analysis methods. The present study will employ GOLD to examine two types of relationship between words: semantic similarity and associative relatedness. Semantic similarity refers to the degree of overlap in meaning between words, while associative relatedness refers to the degree to which two words occur in the same schematic context. It is expected that a graph structured model of language constructed based on co-occurrence should easily capture associative relatedness, because this type of relationship is thought to be present directly in lexical co-occurrence. However, it is hypothesized that semantic similarity may be extracted from the intersection of the set of first-order connections, because two words that are semantically similar may occupy similar thematic or syntactic roles across contexts and thus would co-occur lexically with the same set of nodes. Two versions the GOLD model that differed in terms of the co-occurence window, bigGOLD at the paragraph level and smallGOLD at the adjacent word level, were directly compared to the performance of a well-established distributional model, Latent Semantic Analysis (LSA). The superior performance of the GOLD models (big and small) suggest that a single acquisition and storage mechanism, namely co-occurrence, can account for associative and conceptual relationships between words and is more psychologically plausible than models using singular value decomposition (SVD)."}, {"name": "Simple shape feature computation across modalities: convergence and divergence between the ventral and dorsal visual streams", "url": "https://academic.oup.com/cercor/article/33/15/9280/7190929", "description": "***Cerebral Cortex***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=5977822802446917081)]. \\[[Preprints](http://bilab.bnu.edu.cn/paper/2023/Tian_2023_CC.pdf)]. Shape processing, whether by seeing or touching, is pivotal to object recognition and manipulation. Although the low-level signals are initially processed by different modality-specific neural circuits, multimodal responses to object shapes have been reported along both ventral and dorsal visual pathways. To understand this transitional process, the authors conducted visual and haptic shape perception fMRI experiments to test basic shape features (i.e. curvature and rectilinear) across the visual pathways. Using a combination of region-of-interest-based support vector machine decoding analysis and voxel selection method, the authors found that the top visual-discriminative voxels in the left occipital cortex (OC) could also classify haptic shape features, and the top haptic-discriminative voxels in the left posterior parietal cortex (PPC) could also classify visual shape features. Furthermore, these voxels could decode shape features in a cross-modal manner, suggesting shared neural computation across visual and haptic modalities. In the univariate analysis, the top haptic-discriminative voxels in the left PPC showed haptic rectilinear feature preference, whereas the top visual-discriminative voxels in the left OC showed no significant shape feature preference in either of the two modalities. Together, these results suggest that mid-level shape features are represented in a modality-independent manner in both the ventral and dorsal streams."}, {"name": "The Database of Cross-Linguistic Colexifications, reproducible analysis of cross-linguistic polysemies", "url": "https://www.nature.com/articles/s41597-019-0341-x", "description": "***Scientific Data***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=4039754406289857135)]. \\[[Project](https://clics.clld.org/)]. Advances in computer-assisted linguistic research have been greatly influential in reshaping linguistic research. With the increasing availability of interconnected datasets created and curated by researchers, more and more interwoven questions can now be investigated. Such advances, however, are bringing high requirements in terms of rigorousness for preparing and curating datasets. This work presents CLICS, a Database of Cross-Linguistic Colexifications (CLICS). CLICS tackles interconnected interdisciplinary research questions about the colexifcation of words across semantic categories in the world\u2019s languages, and show-cases best practices for preparing data for cross-linguistic research."}, {"name": "Locating what comes to mind in empirically derived representational spaces", "url": "https://www.sciencedirect.com/science/article/pii/S001002772300183X", "description": "***Cognition***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=57834483230365927)]. An evidence-based study concluding that people call category members to mind according to their location in representational space, specifically based on the predicted usefulness of considering category members with particular features."}, {"name": "Why concepts are (probably) vectors", "url": "https://www.cell.com/trends/cognitive-sciences/abstract/S1364-6613\\(24\\", "description": ""}, {"name": "A principal odor map unifies diverse tasks in olfactory perception", "url": "https://www.science.org/doi/full/10.1126/science.ade4401", "description": "***Science***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=17847258457660438418)]. \\[[Code (\u2b5030)](https://github.com/osmoai/publications/tree/main/lee_et_al_2023)]. \\[[Data (Reproduced)](https://www.kaggle.com/datasets/aryanamitbarsainyan/multi-labelled-smiles-odors-dataset)]. \\[[Preprint](https://centaur.reading.ac.uk/113304/1/Mayhew%20et%20al%20for%20Centaur.pdf)]. \\[[GoodScents Database](https://www.thegoodscentscompany.com/)]. \\[[Leffingwell Database](http://www.leffingwell.com/bacispmp.htm)]. Mapping molecular structure to odor perception is a key challenge in olfaction. This work used graph neural networks to generate a principal odor map (POM) that preserves perceptual relationships and enables odor quality prediction for previously uncharacterized odorants. The model was as reliable as a human in describing odor quality: On a prospective validation set of 400 out-of-sample odorants, the model-generated odor profile more closely matched the trained panel mean than did the median panelist. By applying simple, interpretable, theoretically rooted transformations, the POM outperformed chemoinformatic models on several other odor prediction tasks, indicating that the POM successfully encoded a generalized map of structure-odor relationships. This approach broadly enables odor prediction and paves the way toward digitizing odors."}, {"name": "Metabolic activity organizes olfactory representations", "url": "https://elifesciences.org/articles/82502", "description": "***eLife***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=8857896396450033667)]. \\[[Code & Data (\u2b5030)](https://github.com/osmoai/publications/tree/main/qian_et_al_2023)]. Odorous compounds with similar POM representations are more likely to co-occur within a substance and be metabolically closely related; metabolic reaction sequences also follow smooth paths in POM despite large jumps in molecular structure."}, {"name": "A Review of Tactile Information: Perception and Action Through Touch", "url": "https://ieeexplore.ieee.org/abstract/document/9136877", "description": "***IEEE Transactions on Robotics***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=15493221881484741343)]. \\[[Preprint](https://www.researchgate.net/profile/Qiang-Li-110/publication/342797645_A_Review_of_Tactile_Information_Perception_and_Action_Through_Touch/links/602f95bc92851c4ed5806e9f/A-Review-of-Tactile-Information-Perception-and-Action-Through-Touch.pdf)]. Tactile sensing is a key sensor modality for robots interacting with their surroundings. These sensors provide a rich and diverse set of data signals that contain detailed information collected from contacts between the robot and its environment. The data are however not limited to individual contacts and can be used to extract a wide range of information about the objects in the environment as well as the actions of the robot during the interactions. This article provides an overview of tactile information and its applications in robotics. The authors present a hierarchy consisting of raw, contact, object, and action levels to structure the tactile information, with higher-level information often building upon lower-level information. The authors discuss different types of information that can be extracted at each level of the hierarchy. The article also includes an overview of different types of robot applications and the types of tactile information that they employ. Finally the article ends with a discussion for future tactile applications which are still beyond the current capabilities of robots."}, {"name": "ImageBind: One Embedding Space To Bind Them All", "url": "https://openaccess.thecvf.com/content/CVPR2023/html/Girdhar_ImageBind_One_Embedding_Space_To_Bind_Them_All_CVPR_2023_paper.html", "description": "***CVPR'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=1657173986906232916)]. \\[[Project (\u2b509k)](https://github.com/facebookresearch/ImageBind)]. This work presents ImageBind, an approach to learn a joint embedding across six different modalities - images, text, audio, depth, thermal, and IMU data. The authors show that all combinations of paired data are not necessary to train such a joint embedding, and only image-paired data is sufficient to bind the modalities together. ImageBind can leverage recent large scale vision-language models, and extends their zero-shot capabilities to new modalities just by using their natural pairing with images. It enables novel emergent applications 'out-of-the-box' including cross-modal retrieval, composing modalities with arithmetic, cross-modal detection and generation. The emergent capabilities improve with the strength of the image encoder and this work sets a new state-of-the-art on emergent zero-shot recognition tasks across modalities, outperforming specialist supervised models. Finally, the authors show strong few-shot recognition results outperforming prior work, and that ImageBind serves as a new way to evaluate vision models for visual and non-visual tasks."}, {"name": "Semantic features of object concepts generated with GPT-3", "url": "https://escholarship.org/uc/item/44s454ng", "description": "***CogSci'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=16958563995984242923)]. Semantic features have been playing a central role in investigating the nature of our conceptual representations. Yet the enormous time and effort required to empirically sample and norm features from human raters has restricted their use to a limited set of manually curated concepts. Given recent promising developments with transformer-based language models, here the authors asked whether it was possible to use such models to automatically generate meaningful lists of properties for arbitrary object concepts and whether these models would produce features similar to those found in humans. To this end, the authors probed a GPT-3 model to generate semantic features for 1,854 objects and compared automatically-generated features to existing human feature norms. GPT-3 generated many more features than humans, yet showed a similar distribution in the types of generated features. Generated feature norms rivaled human norms in predicting similarity, relatedness, and category membership, while variance partitioning demonstrated that these predictions were driven by similar variance in humans and GPT-3. Together, these results highlight the potential of large language models to capture important facets of human knowledge and yield a new approach for automatically generating interpretable feature sets, thus drastically expanding the potential use of semantic features in psychological and linguistic studies."}, {"name": "Connecting Touch and Vision via Cross-Modal Prediction", "url": "https://ieeexplore.ieee.org/document/8953737", "description": "***CVPR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=17326564895972374001)]. \\[[Project (\u2b5077)](https://github.com/YunzhuLi/VisGel)]. Humans perceive the world using multi-modal sensory inputs such as vision, audition, and touch. This work investigates the cross-modal connection between vision and touch. The main challenge in this cross-domain modeling task lies in the significant scale discrepancy between the two: while our eyes perceive an entire visual scene at once, humans can only feel a small region of an object at any given moment. To connect vision and touch, this work introduces new tasks of synthesizing plausible tactile signals from visual inputs as well as imagining how we interact with objects given tactile data as input. To accomplish the goals, the authors first equip robots with both visual and tactile sensors and collect a large-scale dataset of corresponding vision and tactile image sequences. To close the scale gap, the authors present a new conditional adversarial model that incorporates the scale and location information of the touch. Human perceptual studies demonstrate that the model can produce realistic visual images from tactile data and vice versa."}, {"name": "Unit Testing for Concepts in Neural Networks", "url": "https://aclanthology.org/2022.tacl-1.69/", "description": "***Transactions of the Association for Computational Linguistics***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=3036662275506971282\\&hl=en\\&as_sdt=0,5)]. Testing the concept representation by neural networks through Fodor's theory of concepts."}, {"name": "Do Llamas Work in English? On the Latent Language of Multilingual Transformers", "url": "https://aclanthology.org/2024.acl-long.820/", "description": "***ACL'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=5847238732288003106)]. A preliminary work empirically showing that the intermediate embeddings of multilingual Transformers (1) start far away from output token embeddings; (2) already allow for decoding a semantically correct next token in the middle layers, but give higher probability to its version in English than in the input language; (3) finally move into an input-language-specific region of the embedding space. Also, the embedding of abstract concept space lies closer to English than to other languages."}, {"name": "From task structures to world models: what do LLMs know?", "url": "https://www.cell.com/trends/cognitive-sciences/abstract/S1364-6613\\(24\\", "description": ""}], "notes": []}, {"name": "Agi Cocosci \u2014 Complexity & Information Theory", "entries": [{"name": "A Mathematical Theory of Communication", "url": "http://www.cs.yale.edu/homes/yry/readings/general/shannon1948.pdf", "description": "***The Bell System Technical Journal***, 1948. \\[[All Versions](https://scholar.google.com/scholar?cluster=8313213127749369813)]. Shannon's original paper on Information Theory."}, {"name": "An introduction to Kolmogorov complexity and its applications", "url": "https://link.springer.com/content/pdf/10.1007/978-3-030-11298-1.pdf", "description": "***Springer***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=8746708322477453221)]. The introductory book for Algorithmic Information Theory, especially the Kolmogorov complexity theory."}, {"name": "Complexity and the representation of patterned sequences of symbols", "url": "https://psycnet.apa.org/record/1973-01647-001", "description": "***Psychological Review***, 1972. \\[[All Versions](https://scholar.google.com/scholar?cluster=3426861135318645138)]. Herbert Simon's review on subjective complexity."}, {"name": "Visual Pattern Discrimination", "url": "https://ieeexplore.ieee.org/abstract/document/1057698", "description": "***IRE Transactions on Information Theory***, 1962. \\[[All Versions](https://scholar.google.com/scholar?cluster=10729525966103382864)]."}, {"name": "Algorithmic Information Theory", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=5390997", "description": "***IBM Journal of Research and Development***, 1977. \\[[All Versions](https://scholar.google.com/scholar?cluster=14735710867906424793)]. Chaitin's original paper on Algorithmic Information Theory."}, {"name": "From Algorithmic to Subjective Randomness", "url": "https://proceedings.neurips.cc/paper/2003/hash/b06b5541a62ed438f956b662b4e1ec28-Abstract.html", "description": "***NeurIPS'03***, 2003. \\[[All Versions](https://scholar.google.com/scholar?cluster=14721764738308036578)]."}, {"name": "On the Complexity of Bayesian Generalization", "url": "https://proceedings.mlr.press/v202/shi23i.html", "description": "***ICML'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=5817813824878811147)]. \\[[Project (\u2b508)](https://github.com/SHI-Yu-Zhe/bayesian-generalization-complexity)]. \\[[Models](https://drive.google.com/file/d/1eCuFqBYN8kuiAmoVtXWedXW0r0TdY55W/view)]. This work examines concept generalization at a large scale in the natural visual spectrum. Established computational modes (i.e., rule-based or similarity-based) are primarily studied isolated, focusing on confined and abstract problem spaces. This work studies these two modes when the problem space scales up and when the complexity of concepts becomes diverse. At the representational level, the authors investigate how the complexity varies when a visual concept is mapped to the representation space. Prior literature has shown that two types of complexities build an inverted-U relation. Leveraging Representativeness of Attribute (RoA), the authors computationally confirm: Models use attributes with high RoA to describe visual concepts, and the description length falls in an inverted-U relation with the increment in visual complexity. At the computational level, the authors examine how the complexity of representation affects the shift between the rule- and similarity-based generalization. The authors hypothesize that category-conditioned visual modeling estimates the co-occurrence frequency between visual and categorical attributes, thus potentially serving as the prior for the natural visual world. Experimental results show that representations with relatively high subjective complexity outperform those with relatively low subjective complexity in rule-based generalization, while the trend is the opposite in similarity-based generalization."}, {"name": "Quantifying artificial intelligence through algorithmic generalization", "url": "https://www.nature.com/articles/s42256-025-01092-w", "description": "***Nature Machine Intelligence***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=16525845943864999422)]. The rapid development of artificial intelligence (AI) systems has created an urgent need for their scientific quantification. While their fluency across a variety of domains is impressive, AI systems fall short on tests requiring algorithmic reasoning---a glaring limitation, given the necessity for interpretable and reliable technology. Despite a surge in reasoning benchmarks emerging from the academic community, no theoretical framework exists to quantify algorithmic reasoning in AI systems. Here the authors adopt a framework from computational complexity theory to quantify algorithmic generalization using algebraic expressions: algebraic circuit complexity. Algebraic circuit complexity theory---the study of algebraic expressions as circuit models---is a natural framework for studying the complexity of algorithmic computation. Algebraic circuit complexity enables the study of generalization by defining benchmarks in terms of the computational requirements for solving a problem. Moreover, algebraic circuits are generic mathematical objects; an arbitrarily large number of samples can be generated for a specified circuit, making it an ideal experimental sandbox for the data-hungry models that are used today. In this Perspective, the authors adopt tools from algebraic circuit complexity, apply them to formalize a science of algorithmic generalization, and address key challenges for its successful application to AI science."}, {"name": "A global geometric framework for nonlinear dimensionality reduction", "url": "https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.1084.4695\\&rep=rep1\\&type=pdf", "description": "***Science***, 2000. \\[[All Versions](https://scholar.google.com/scholar?cluster=14602426245887619907)]. The original paper on spectrum clustering."}, {"name": "Reducing the dimensionality of data with neural networks", "url": "https://asset-pdf.scinapse.io/prod/2100495367/2100495367.pdf", "description": "***Science***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=15344645275208957628)]. The original paper on Variational Autoencoder."}, {"name": "Representation Learning: A Review and New Perspectives", "url": "https://arxiv.org/pdf/1206.5538.pdf", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=559463397382443088)]. Yoshua Bengio's review on representation learning."}, {"name": "Representation Learning: A Statistical Perspective", "url": "http://www.stat.ucla.edu/~jxie/personalpage_file/publications/representation_learning_Review.pdf", "description": "***Annual Review of Statistics and Its Application***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=14358027809538175293)]. Song-Chun Zhu and Ying Nian Wu's review on representation learning, in an account of statistics."}, {"name": "Deep Learning and the Information Bottleneck Principle", "url": "http://robotics.caltech.edu/wiki/images/8/8f/DeepLearningBottleneck.pdf", "description": "***IEEE Information Theory Workshop'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=13152354842433826281)]. The first paper identifying the problem of information bottleneck in representation learning."}, {"name": "On the information bottleneck theory of deep learning", "url": "https://artemyk.github.io/assets/pdf/papers/Saxe%20et%20al_2019_On%20the%20information%20bottleneck%20theory%20of%20deep%20learning.pdf", "description": "***Journal of Statistical Mechanics: Theory and Experiment***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=12271240925674881982)]."}, {"name": "Visual complexity: a review", "url": "https://www.researchgate.net/profile/Don-Donderi-2/publication/7337589_Visual_Complexity_A_Review/links/5f0875ed45851550509a3a7a/Visual-Complexity-A-Review.pdf", "description": "***Psychological Bulletin***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=10747901143387624939)]. \\[[APA](https://psycnet.apa.org/record/2006-00818-005)]. A psychological account on visual complexity."}, {"name": "Compressed File Length Predicts Search Time and Errors on Visual Displays", "url": "https://www.sciencedirect.com/science/article/pii/S0141938205000120", "description": "***Displays***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=15600966633648834042)]. Compressed file size, an objective, easily obtained measure of display complexity, predicts both subjective complexity judgments and objective search performance. It is analogous to algorithmic complexity, a theoretical but impractical measure of bit string complexity. The data suggest that it may be possible to use the compressed file size measure to predict display performance in applied tasks."}, {"name": "Image complexity and spatial information", "url": "https://stefan.winklerbros.net/Publications/qomex2013si.pdf", "description": "***International Workshop on Quality of Multimedia Experience***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=16011036229039693102)]."}, {"name": "Seeing and speaking: How verbal \u201cdescription length\u201d encodes visual complexity", "url": "https://perception.jhu.edu/files/PDFs/21_Complexity_Speaking/SunFirestone_SpeakingSeeing_2021_JEPG.pdf", "description": "***Journal of Experimental Psychology***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=246820603191585233)]. \\[[APA](https://psycnet.apa.org/record/2021-83037-001)]. Empirical evidencs showing the relation between visual complexity and description length."}, {"name": "How variability shapes learning and generalization", "url": "https://pure.mpg.de/rest/items/item_3380375/component/file_3383568/content", "description": "***Trends in Cognitive Sciences***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=10940775338620708972)]. A comprehensive review on the trade-off between variability and generalization ability."}, {"name": "Identifying concept libraries from language about object structure", "url": "https://arxiv.org/pdf/2205.05666.pdf", "description": "***CogSci'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=4019205027627496528)]."}, {"name": "Show or tell? Exploring when (and why) teaching with language outperforms demonstration", "url": "https://www.sciencedirect.com/science/article/pii/S0010027722003158", "description": "***Cognition***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11837154580063293174)]. The findings of this paper suggest that language communicates complex concepts by directly transmitting abstract rules. In contrast, demonstrations transmit examples, requiring the learner to infer the rules."}], "notes": []}, {"name": "Agi Cocosci \u2014 Communications", "entries": [{"name": "The Interactive Evolution of Human Communication Systems", "url": "https://onlinelibrary.wiley.com/doi/epdf/10.1111/j.1551-6709.2009.01090.x", "description": "***Cognitive Science***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=6689941517686043970)]. Nicolas Fay's original paper on iconicity."}, {"name": "Iconicity: From sign to system in human communication and language", "url": "https://benjamins.com/catalog/pc.22.2.05fay", "description": "***Pragmatics & Cognition***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=8525760321117094567)]. This paper explores the role of iconicity in spoken language and other human communication systems."}, {"name": "The Picture Exchange Communication System", "url": "https://journals.sagepub.com/doi/abs/10.1177/108835769400900301", "description": "***Behavior Modification***, 1994. \\[[All Versions](https://scholar.google.com/scholar?cluster=18113491434570143349\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Graphical Language Games: Interactional Constraints on Representational Form", "url": "https://onlinelibrary.wiley.com/doi/full/10.1080/15326900701221363", "description": "***Cognitive Science***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=280214578402050136\\&hl=en\\&as_sdt=0,5)]. The first paper introducing the graphical language game."}, {"name": "A multimodal discourse theory of visual narrative", "url": "https://www.sciencedirect.com/science/article/pii/S0378216614001830", "description": "***Journal of Pragmatics***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=912273653379961242\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Pixelor: A Competitive Sketching AI Agent. So you think you can beat me?", "url": "https://ayankumarbhunia.github.io/pixelor/image/pixelor.pdf", "description": "***ACM SIGGRAPH'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=6676723059377806081\\&hl=en\\&as_sdt=0,5)]. \\[[Project](http://sketchx.ai/pixelor)]. Rationality in feature sketching."}, {"name": "Pragmatic Inference and Visual Abstraction Enable Contextual Flexibility During Visual Communication", "url": "https://link.springer.com/article/10.1007/s42113-019-00058-7", "description": "***Computational Brain & Behavior***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=17971107104483505071\\&hl=en\\&as_sdt=0,5)]. A computational account on the rational behavior in graphical language games."}, {"name": "Emergent Graphical Conventions in a Visual Communication Game", "url": "https://proceedings.neurips.cc/paper_files/paper/2022/hash/550ff553efc2c58410f277c667d12786-Abstract-Conference.html", "description": "***NeurIPS***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=17122070906194572150)]. A computational account on the emergence of iconic language."}, {"name": "AI N\u00fcshu: An Exploration of Language Emergence in Sisterhood Through the Lens of Computational Linguistics", "url": "https://dl.acm.org/doi/abs/10.1145/3610591.3616427", "description": "***ACM SIGGRAPH Asia'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=6849286654402017109\\&hl=en\\&as_sdt=0,5)]. By continually observing their environment and communicating, AI agents trained in the Chinese dictionary and the N\u00fcshu corpus collaborate towards creating a standard writing system to encode Chinese."}, {"name": "Communicating artificial neural networks develop efficient color-naming systems", "url": "https://www.pnas.org/content/118/12/e2016569118", "description": "***Proceedings of the National Academy of Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1640459156303560508\\&hl=en\\&as_sdt=0,5)]. Simulating the emergence of code as the communication bottleneck in color learning task."}, {"name": "Bridging cultural and cognitive perspectives on similarity reasoning", "url": "https://escholarship.org/content/qt9p70d5s9/qt9p70d5s9.pdf", "description": "***CogSci'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Bridging+cultural+and+cognitive+perspectives+on+similarity+reasoning\\&btnG=)]."}, {"name": "Twelve-month-olds communicate helpfully and appropriately for knowledgeable and ignorant partners", "url": "https://www.eva.mpg.de/documents/Elsevier/Liszkowski_Twelve_Cognition_2008_1554509.pdf", "description": "***Cognition***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=8202048572661677635\\&hl=en\\&as_sdt=0,5)]. The original paper on child pointing."}, {"name": "12- and 18-Month-Olds Point to Provide Information for Others", "url": "https://pure.mpg.de/rest/items/item_64467_4/component/file_64468/content", "description": "***Journal of Cognition and Development***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=7322772656439413984\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Toward understanding the importance of gesture in distributed scientific collaboration", "url": "https://link.springer.com/article/10.1007/s10115-006-0062-2", "description": "***Knowledge and Information Systems***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=3145646721897130511)]."}, {"name": "Pragmatics", "url": "https://plato.stanford.edu/entries/pragmatics/", "description": "***Plato Stanford***. A computational philosophy account of Pragmatics, whilch studies utterances in specific contexts."}, {"name": "Predicting Pragmatic Reasoning in Language Games", "url": "https://www.science.org/doi/abs/10.1126/science.1218633", "description": "***Science***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=15533081031935746054)]. \\[[Preprint](https://langcog.stanford.edu/papers_new/frank-2012-science.pdf)]. One of the most astonishing features of human language is its capacity to convey information efficiently in context. Many theories provide informal accounts of communicative inference, yet there have been few successes in making precise, quantitative predictions about pragmatic reasoning. This work examined judgments about simple referential communication games, modeling behavior in these games by assuming that speakers attempt to be informative and that listeners use Bayesian inference to recover speakers\u2019 intended referents. The model provides a close, parameter-free fit to human judgments, suggesting that the use of information-theoretic tools to predict pragmatic reasoning may lead to more effective formal models of communication."}, {"name": "Pragmatic Language Interpretation as Probabilistic Inference", "url": "https://www.sciencedirect.com/science/article/pii/S136466131630122X", "description": "***Trends in Cognitive Sciences***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=11393505968563356130)]. Understanding language requires more than the use of fixed conventions and more than decoding combinatorial structure. Instead, comprehenders make exquisitely sensitive inferences about what utterances mean given their knowledge of the speaker, language, and context. Building on developments in game theory and probabilistic modeling, the authors describe the rational speech act (RSA) framework for pragmatic reasoning. RSA models provide a principled way to formalize inferences about meaning in context; they have been used to make successful quantitative predictions about human behavior in a variety of different tasks and situations, and they explain why complex phenomena, such as hyperbole and vagueness, occur. More generally, they provide a computational framework for integrating linguistic structure, world knowledge, and context in pragmatic language understanding."}, {"name": "Pragmatic Reasoning through Semantic Inference", "url": "http://cocolab.stanford.edu/papers/BergenLevyGoodman-LexUnc.pdf", "description": "***Semantics & Pragmatics***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=1433855075217315997)]."}, {"name": "Processing gradable adjectives in context: A visual world study", "url": "https://semantics.uchicago.edu/kennedy/docs/processing.pdf", "description": "***Semantics and Linguistic Theory***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=13426776838629402579)]. Adjective understanding as a rational inference in the context."}, {"name": "Colors in Context: A Pragmatic Neural Model for Grounded Language Understanding", "url": "https://transacl.org/index.php/tacl/article/view/1142", "description": "***Transactions of the Association for Computational Linguistics***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=11119271811833503059)]."}, {"name": "Social Pragmatics: Preschoolers Rely on Commonsense Psychology to Resolve Referential Underspecification", "url": "https://compdevlab.yale.edu/docs/2019/2019_ChildDev_Pragmatics.pdf", "description": "***Child Development***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=16352913537004112920)]. A piece of evidence for children's capability on social pragmatics."}, {"name": "Pragmatically Informative Image Captioning with Character-Level Inference", "url": "http://cocolab.stanford.edu/papers/CohnGordonEtAl2018_NAACL.pdf", "description": "***NAACL'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=1670953084401884599)]."}, {"name": "Pragmatic Issue-Sensitive Image Captioning", "url": "https://aclanthology.org/2020.findings-emnlp.173/", "description": "***EMNLP Findings'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=10608257248144445301)]. Application of Rational Speech Act to Image Captioning."}, {"name": "Disentangling contributions of visual information and interaction history in the formation of graphical conventions", "url": "https://cogsci.mindmodeling.org/2019/papers/0091/0091.pdf", "description": "***CogSci'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15046353579508199394\\&hl=en\\&as_sdt=0,5)]."}, {"name": "How young children integrate information sources to infer the meaning of words", "url": "https://www.nature.com/articles/s41562-021-01145-1", "description": "***Nature Human Behavior***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=10144794357802769844)]. Before formal education begins, children typically acquire a vocabulary of thousands of words. This learning process requires the use of many different information sources in their social environment, including their current state of knowledge and the context in which they hear words used. This paper specifies a developmental model according to which children consider information sources in an age-specific way and integrate them via Bayesian inference. This work presents a developmental theory of information integration during language learning and illustrates how formal models can be used to make a quantitative test of the predictive and explanatory power of competing theories."}, {"name": "Information Structure in Discourse: Towards an Integrated Formal Theory of Pragmatics", "url": "https://semprag.org/index.php/sp/article/view/sp.5.6/pdf", "description": "***Semantics and Pragmatics***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=9127222314768938599\\&hl=en\\&as_sdt=0,5)]."}, {"name": "When Lingens meets Frege: communication without common ground", "url": "https://link.springer.com/article/10.1007/s11098-020-01490-3", "description": "***Philosophical Studies***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=10912415595149303257\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The SocialAI School: Insights from Developmental Psychology Towards Artificial Socio-Cultural Agents", "url": "https://arxiv.org/abs/2307.07871", "description": "***ICML'23 Workshop on Theory-of-Mind***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11933410239580707313\\&hl=en\\&as_sdt=0,5)]. \\[[Project](https://sites.google.com/view/socialai-school)]."}, {"name": "Language as shaped by the environment: linguistic construal in a collaborative spatial task", "url": "https://www.nature.com/articles/s41599-020-0404-9", "description": "***Humanities and Social Sciences Communications***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7842508027049437987)]. \\[[Code & Data](https://osf.io/sxtaq)]. \\[[Dialogue Experimental Toolkit(DiET)](https://dialoguetoolkit.github.io/chattool/)]. The present study sets out to experimentally investigate how environmental factors come to shape the emergence of linguistic conventions. To this end, the authors adapt the classical Maze Game task to test the hypothesis that participants routinise different linguistic strategies to communicate positions in the maze contingent on particular environmental affordances (i.e. structure of the mazes). The results confirm that subtle environmental motivations drive the emergence of different communicative conventions in an otherwise identical task, suggesting that linguistic adaptations are highly sensitive to factors of the shared task environment."}, {"name": "Exploring Urban Form Through Openstreetmap Data: A Visual Introduction", "url": "https://arxiv.org/abs/2008.12142", "description": "***Urban Experience and Design: Contemporary Perspectives on Improving the Public Realm***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7094530618542001733\\&hl=en\\&as_sdt=0,5)]. \\[[OSMnx Tool (\u2b505.6k)](https://github.com/gboeing/osmnx)]. \\[[OpenStreetMap Website](https://www.openstreetmap.org/)]."}, {"name": "Saying what you mean in dialogue: A study in conceptual and semantic co-ordination", "url": "https://www.speech.kth.se/~edlund/bielefeld/references/garrod-and-anderson-1987.pdf", "description": "***Cognition***, 1987. \\[[All Versions](https://scholar.google.com/scholar?cluster=15377075954534820544\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Conversation, co-ordination and convention: an empirical investigation of how groups establish linguistic conventions", "url": "http://www.sfs.uni-tuebingen.de/~gjaeger/lehre/ws0708/spieltheorie/garrod.pdf", "description": "***Cognition***, 1994. \\[[All Versions](https://scholar.google.com/scholar?cluster=3784850469297049700\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Compositionality", "url": "https://plato.stanford.edu/entries/compositionality/", "description": "***Plato Stanford***. A computational philosophy account on compositionality, one of the distinctive feature of language."}, {"name": "Language is primarily a tool for communication rather than thought", "url": "https://www.nature.com/articles/s41586-024-07522-w", "description": "***Nature***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=13724799649075764503)]. This perspective brings recent evidence from neuroscience and allied disciplines to argue that in modern humans, language is a tool for communication, contrary to a prominent view that we use language for thinking. The authors begins by introducing the brain network that supports linguistic ability in humans. They then review evidence for a double dissociation between language and thought, and discuss several properties of language that suggest that it is optimized for communication. This perspective concludes that although the emergence of language has unquestionably transformed human culture, language does not appear to be a prerequisite for complex thought, including symbolic thought. Instead, language is a powerful tool for the transmission of cultural knowledge; it plausibly co-evolved with humans' thinking and reasoning capacities, and only reflects, rather than gives rise to, the signature sophistication of human cognition."}, {"name": "The Principle of Semantic Compositionality", "url": "https://link.springer.com/content/pdf/10.1007/BF00763644.pdf", "description": "***Topoi***, 1994. \\[[All Versions](https://scholar.google.com/scholar?cluster=10899040818001759322\\&hl=en\\&as_sdt=0,5)]. The original paper on the principle of semantic compositionality."}, {"name": "On The Emergence Of Compositionality", "url": "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.3235", "description": "***Proceedings of the Evolution of Language Conference'06***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=16315741180717951222\\&hl=en\\&as_sdt=0,5)]. The original paper on the emergence of compositionality."}, {"name": "Multi-Agent Cooperation and the Emergence of (Natural) Language", "url": "https://arxiv.org/pdf/1612.07182.pdf", "description": "***ICLR'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=1931070702879918446\\&hl=en\\&as_sdt=0,5)]. The original paper on the emergence of language in multi-agent reinforcement learning."}, {"name": "Emergence of Language with Multi-agent Games: Learning to Communicate with Sequences of Symbols", "url": "https://proceedings.neurips.cc/paper/2017/hash/70222949cc0db89ab32c9969754d4758-Abstract.html", "description": "***NeurIPS'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=17308624474306270808\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Emergent communication through negotiation", "url": "https://arxiv.org/abs/1804.03980", "description": "***ICLR'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=8825869866742501521\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The language of generalization", "url": "https://psycnet.apa.org/record/2019-07481-001", "description": "***Psychological Review***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7723877614160376324\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Compositionality and Generalization in Emergent Languages", "url": "https://arxiv.org/abs/2004.09124", "description": "***ACL'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5792073344743965767\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Word formation supports efficient communication: The case of compounds", "url": "https://escholarship.org/uc/item/5kv636c5", "description": "***CogSci'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=17465553221758916299\\&hl=en\\&as_sdt=0,5)]."}, {"name": "War and Peace (WarAgent): Large Language Model-based Multi-Agent Simulation of World Wars", "url": "https://arxiv.org/abs/2311.17227", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=3598519753107761968\\&hl=en\\&as_sdt=0,5)]."}, {"name": "In situ bidirectional human-robot value alignment", "url": "https://www.science.org/doi/full/10.1126/scirobotics.abm4183", "description": "***Science Robotics***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=18342339995965564405)]. \\[[Preprint](https://par.nsf.gov/servlets/purl/10351399)]. This paper proposes an explainable artificial intelligence (XAI) system in which a group of robots predicts users\u2019 values by taking in situ feedback into consideration while communicating their decision processes to users through explanations. To learn from human feedback, the XAI system integrates a cooperative communication model for inferring human values associated with multiple desirable goals. To be interpretable to humans, it simulates human mental dynamics and predicts optimal explanations using graphical models."}, {"name": "From Explicit Communication to Tacit Cooperation: A Novel Paradigm for Cooperative MARL", "url": "https://arxiv.org/pdf/2304.14656.pdf", "description": "***AAMAS'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=12114270828108588849)]. Drawing inspiration from human team cooperative learning, this paper proposes a novel paradigm that facilitates a gradual shift from explicit communication to tacit cooperation."}, {"name": "The future of open human feedback", "url": "https://www.nature.com/articles/s42256-025-01038-2", "description": "***Nature Machine Intelligence***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=8282207012874793204)]. Human feedback on conversations with language models is central to how these systems learn about the world, improve their capabilities and are steered towards desirable and safe behaviours. However, this feedback is mostly collected by frontier artificial intelligence labs and kept behind closed doors. This work brings together interdisciplinary experts to assess the opportunities and challenges to realizing an open ecosystem of human feedback for artificial intelligence. The authors first look for successful practices in the peer-production, open-source and citizen-science communities. The authors then characterize the main challenges for open human feedback. For each, the authors survey current approaches and offer recommendations. The authors end by envisioning the components needed to underpin a sustainable and open human feedback ecosystem. In the centre of this ecosystem are mutually beneficial feedback loops, between users and specialized models, incentivizing a diverse stakeholder community of model trainers and feedback providers to support a general open feedback pool."}, {"name": "HLSMAC: A New StarCraft Multi-Agent Challenge for High-Level Strategic Decision-Making", "url": "https://openreview.net/forum?id=b7VmJ4107q", "description": "***AAMAS'26***, 2026. \\[[All Versions](https://scholar.google.com/scholar?cluster=11127617290205220978)]. Benchmarks are crucial for assessing multi-agent reinforcement learning (MARL) algorithms. While StarCraft II-related environments have driven significant advances in MARL, existing benchmarks like SMAC focus primarily on micromanagement, limiting comprehensive evaluation of high-level strategic intelligence. To address this, this work introduces HLSMAC, a new cooperative MARL benchmark with 12 carefully designed StarCraft II scenarios based on classical stratagems from the *Thirty-Six Stratagems*. Each scenario corresponds to a specific stratagem and is designed to challenge agents with diverse strategic elements, including tactical maneuvering, timing coordination, and deception, thereby opening up avenues for evaluating high-level strategic decision-making capabilities. The authors also propose novel metrics across multiple dimensions beyond conventional win rate, such as ability utilization and advancement efficiency, to assess agents' overall performance within the HLSMAC environment. The authors conduct a large-scale evaluation of 21 state-of-the-art MARL algorithms and LLM-based agents, with additional multi-seed analysis for relatively better-performing methods. The results demonstrate that HLSMAC serves as a robust testbed for advancing multi-agent strategic decision-making."}], "notes": []}, {"name": "Agi Cocosci \u2014 Domain Specific Language", "entries": [{"name": "Domain-Specific Language", "url": "https://en.wikipedia.org/wiki/Domain-specific_language", "description": "***Wikipedia***. Wikipedia encyclopedia entry on Domain Specific Languages."}, {"name": "Domain Engineering", "url": "https://en.wikipedia.org/wiki/Domain_engineering", "description": "***Wikipedia***. Wikipedia encyclopedia entry on Domain Engineering."}, {"name": "Domain-Specific Languages", "url": "https://martinfowler.com/books/dsl.html", "description": "***Pearson Education***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=3653365103385845410)]. \\[[Domain-Specific Languages Guide](https://martinfowler.com/dsl.html)]. When carefully selected and used, Domain-Specific Languages (DSLs) may simplify complex code, promote effective communication with customers, improve productivity, and unclog development bottlenecks. In Domain-Specific Languages, noted software development expert Martin Fowler first provides the information software professionals need to decide if and when to utilize DSLs. Then, where DSLs prove suitable, Fowler presents effective techniques for building them, and guides software engineers in choosing the right approaches for their applications."}, {"name": "Comparison of multi-paradigm programming languages", "url": "https://en.wikipedia.org/wiki/Comparison_of_multi-paradigm_programming_languages", "description": "***Wikipedia***. Programming languages may support multiple programming paradigms. This Wikipedia encyclopedia entry lists a concise reference for the programming paradigms."}, {"name": "Epigrams on programming", "url": "https://dl.acm.org/doi/pdf/10.1145/947955.1083808", "description": "***ACM SIGPLAN Notices***, 1982. \\[[All Versions](https://scholar.google.com/scholar?cluster=6439127299132936476)]."}, {"name": "The complete guide to (external) Domain Specific Languages", "url": "https://tomassetti.me/domain-specific-languages/", "description": ""}, {"name": "When and How to Develop Domain-Specific Languages", "url": "https://dl.acm.org/doi/abs/10.1145/1118890.1118892", "description": "***ACM Computing Surveys***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=8598236436890577027)]. \\[[Preprint](https://people.cs.ksu.edu/~schmidt/505f14/Lectures/WhenDSL.pdf)]. Domain-specific languages (DSLs) are languages tailored to a specific application domain. They offer substantial gains in expressiveness and ease of use compared with general-purpose programming languages in their domain of application. DSL development is hard, requiring both domain knowledge and language development expertise. Few people have both. Not surprisingly, the decision to develop a DSL is often postponed indefinitely, if considered at all, and most DSLs never get beyond the application library stage. Although many articles have been written on the development of particular DSLs, there is very limited literature on DSL development methodologies and many questions remain regarding when and how to develop a DSL. To aid the DSL developer, this survey paper identifies patterns in the decision, analysis, design, and implementation phases of DSL development. These patterns improve and extend earlier work on DSL design patterns."}, {"name": "Design Guidelines for Domain Specific Languages", "url": "https://arxiv.org/abs/1409.2378", "description": "***OOPSLA Workshop on Domain-Specific Modeling (DSM' 09)***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=1962567819031018744)]. Designing a new domain specific language is as any other complex task sometimes error-prone and usually time consuming, especially if the language shall be of high-quality and comfortably usable. Existing tool support focuses on the simplification of technical aspects but lacks support for an enforcement of principles for a good language design. In this paper we investigate guidelines that are useful for designing domain specific languages, largely based on our experience in developing languages as well as relying on existing guidelines on general purpose (GPLs) and modeling languages. This work defined Guidelines to support a DSL developer to achieve better quality of the language design and a better acceptance among its users."}, {"name": "Domain-specific languages: an annotated bibliography", "url": "https://dl.acm.org/doi/abs/10.1145/352029.352035", "description": "***ACM SIGPLAN Notices***, 2000. \\[[All Versions](https://scholar.google.com/scholar?cluster=8845429548327315750)]. A survey on the topic of domain-specific languages as used for the construction and maintenance of software systems. The survey lists a selection of 75 key publications in the area, and provides a summary for each of the papers. Moreover, the survey discusses terminology, risks and benefits, example domain-specific languages, design methodologies, and implementation techniques."}, {"name": "Usability Evaluation of Domain-Specific Languages", "url": "https://ieeexplore.ieee.org/abstract/document/6511840", "description": "***ICQICT'12***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=3047215455890195199)]. \\[[Preprint](http://www-ctp.di.fct.unl.pt/QUASAR/Resources/Papers/2012/Barisic2012SEDES.pdf)]. The purpose of this proposal is to contribute to the systematic activity of Software Language Engineering by focusing on the issue of the Usability evaluation of DSLs. Usability evaluation is often skipped, relaxed, or at least omitted from papers reporting development of DSLs. The authors argue that a systematic approach based on User Interface experimental validation techniques should be used to assess the impact of new DSLs. For that purpose, the authors propose to merge common Usability evaluation processes with the DSL development process."}, {"name": "Domain-Specific Modeling Languages: Requirements Analysis and Design Guidelines", "url": "https://link.springer.com/chapter/10.1007/978-3-642-36654-3_6", "description": "***Domain Engineering: Product Lines, Languages, and Conceptual Models***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=15620404537599157753)]. In recent years, the development of domain-specific modeling languages has gained remarkable attention. This is for good reasons. A domain-specific modeling language incorporates concepts that represent domain-level knowledge. Hence, systems analysts are not forced to reconstruct these concepts from scratch. At the same time, domain-specific modeling languages contribute to model integrity, because they include already constraints that would otherwise have to be added manually. Even though there has been a considerable amount of research on developing and using domain-specific modeling languages, there is still lack of comprehensive methods to guide the design of these languages. With respect to the complexity and risk related to developing a domain-specific modeling language, this is a serious shortfall. This chapter is aimed at a contribution to filling the gap. At first, it presents guidelines for selecting a metamodeling language. Its main focus is on supporting the process from analyzing requirements to specifying and evaluating a domain-specific modeling language."}, {"name": "Domain-Specific Languages: A Systematic Mapping Study", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0950584915001858", "description": "***Information and Software Technology***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=10633158457161608253)]. This study reports on a Systematic Mapping Study (SMS) for Domain-Specific Languages (DSLs). The main objective of the described work was to perform an SMS on DSLs to better understand the DSL research field, identify research trends, and any possible open issues. This SMS discusses two main research questions: research space and trends/demographics of the literature within the field of DSLs. Both research questions are further subdivided into several research sub-questions. The results from the first research question clearly show that the DSL community focuses more on the development of new techniques/methods rather than investigating the integrations of DSLs with other software engineering processes or measuring the effectiveness of DSL approaches. Furthermore, there is a clear lack of evaluation research. Amongst different DSL development phases more attention is needed in regard to domain analysis, validation, and maintenance. The second research question revealed that the number of publications remains stable, and has not increased over the years."}, {"name": "Building Domain-Specific Machine Learning Workflows: A Conceptual Framework for the State of the Practice", "url": "https://dl.acm.org/doi/full/10.1145/3638243", "description": "***ACM Transactions on Software Engineering and Methodology***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=16602627179061103486)]. Domain experts are increasingly employing machine learning to solve their domain-specific problems. This article presents to software engineering researchers the six key challenges that a domain expert faces in addressing their problem with a computational workflow, and the underlying executable implementation. These challenges arise out of the proposed conceptual framework which presents the \u201croute\u201d of transformations that a domain expert may choose to take while developing their solution."}, {"name": "PLIERS: A Process that Integrates User-Centered Methods into Programming Language Design", "url": "https://dl.acm.org/doi/abs/10.1145/3452379", "description": "***ACM Transactions on Computer-Human Interaction***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=14808918880141361248)]. Programming language design requires making many usability-related design decisions. However, existing HCI methods can be impractical to apply to programming languages: languages have high iteration costs, programmers require significant learning time, and user performance has high variance. To address these problems, the authors adapted both formative and summative HCI methods to make them more suitable for programming language design. The authors integrated these methods into a new process, PLIERS, for designing programming languages in a user-centered way. The authors assessed PLIERS by using it to design two new programming languages. Glacier extends Java to enable programmers to express immutability properties effectively and easily. Obsidian is a language for blockchains that includes verification of critical safety properties. Empirical studies showed that the PLIERS process resulted in languages that could be used effectively by many programmers and revealed additional opportunities for language improvement."}, {"name": "Quantifying usability of domain-specific languages: An empirical study on software maintenance", "url": "https://www.sciencedirect.com/science/article/pii/S0164121214002799", "description": "***Journal of Systems and Software***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=3450893039446010260)]. A DSL aims to support software development by offering abstractions to a particular domain. It is expected that DSLs improve the maintainability of artifacts otherwise produced with general-purpose languages. However, the maintainability of the DSL artifacts and, hence, their adoption in mainstream development, is largely dependent on the usability of the language itself. Unfortunately, it is often hard to identify their usability strengths and weaknesses early, as there is no guidance on how to objectively reveal them. Usability is a multi-faceted quality characteristic, which is challenging to quantify beforehand by DSL stakeholders. There is even less support on how to quantitatively evaluate the usability of DSLs used in maintenance tasks. In this context, this paper reports a study to compare the usability of textual DSLs under the perspective of software maintenance. A usability measurement framework was developed based on the cognitive dimensions of notations. The framework was evaluated both qualitatively and quantitatively using two DSLs in the context of two evolving object-oriented systems. The results suggested that the proposed metrics were useful: (1) to early identify DSL usability limitations, (2) to reveal specific DSL features favoring maintenance tasks, and (3) to successfully analyze eight critical DSL usability dimensions."}, {"name": "A Taxonomy of Domain-Specific Aspect Languages", "url": "https://dl.acm.org/doi/abs/10.1145/2685028", "description": "***ACM Computing Surveys***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=17254174131160041640)]. Domain-Specific Aspect Languages (DSALs) are Domain-Specific Languages (DSLs) designed to express crosscutting concerns. Compared to DSLs, their aspectual nature greatly amplifies the language design space. This survey structures this space in order to shed light on and compare the different domain-specific approaches to deal with crosscutting concerns. This survey reports on a corpus of 36 DSALs covering the space, discuss a set of design considerations, and provide a taxonomy of DSAL implementation approaches. This work serves as a frame of reference to DSAL and DSL researchers, enabling further advances in the field, and to developers as a guide for DSAL implementations."}, {"name": "No Grammar to Rule Them All: A Survey of JSON-style DSLs for Visualization", "url": "https://ieeexplore.ieee.org/abstract/document/9904438", "description": "***IEEE Transactions on Visualization and Computer Graphics***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=17206818917381447796)]. There has been substantial growth in the use of JSON-based grammars, as well as other standard data serialization languages, to create visualizations. Each of these grammars serves a purpose: some focus on particular computational tasks (such as animation), some are concerned with certain chart types (such as maps), and some target specific data domains (such as ML). Despite the prominence of this interface form, there has been little detailed analysis of the characteristics of these languages. This study surveys and analyzes the design and implementation of 57 JSON-style DSLs for visualization. The authors analyze these languages supported by a collected corpus of examples for each DSL (consisting of 4395 instances) across a variety of axes organized into concerns related to domain, conceptual model, language relationships, affordances, and general practicalities. The authors identify tensions throughout these areas, such as between formal and colloquial specifications, among types of users, and within the composition of languages. Through this work, the authors seek to support language implementers by elucidating the choices, opportunities, and tradeoffs in visualization DSL design."}, {"name": "How Domain Experts Use an Embedded DSL", "url": "https://dl.acm.org/doi/abs/10.1145/3622851", "description": "***OOPSLA'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=8416124186663074528)]. Programming tools are increasingly integral to research and analysis in myriad domains, including specialized areas with no formal relation to computer science. Embedded domain-specific languages (eDSLs) have the potential to serve these programmers while placing relatively light implementation burdens on language designers. However, barriers to eDSL use reduce their practical value and adoption. This work aims to deepen the understanding of how programmers use eDSLs and identify user needs to inform future eDSL designs. The authors performed a contextual inquiry (9 participants) with domain experts using Mimi, an eDSL for climate change economics modeling. A thematic analysis identified five key themes, including: the interaction between the eDSL and the host language has significant and sometimes unexpected impacts on eDSL user experience, and users preferentially engage with domain-specific communities and code templates rather than host language resources."}, {"name": "Abstract Hardware Grounding Towards the Automated Design of Automation Systems", "url": "https://link.springer.com/chapter/10.1007/978-981-96-0780-8_9", "description": "***ICIRA'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=3331524500088540378)]. \\[[Preprint](https://arxiv.org/abs/2410.05663)]. Crafting automation systems tailored for specific domains requires aligning the space of human experts\u2019 semantics with the space of robot executable actions, and scheduling the required resources and system layout accordingly. Regrettably, there are three major gaps, fine-grained domain-specific knowledge injection, heterogeneity between human knowledge and robot instructions, and diversity of users\u2019 preferences, resulting automation system design a case-by-case and labour-intensive effort, thus hindering the democratization of automation. This work refers to this challenging alignment as the abstract hardware grounding problem, where the authors firstly regard the procedural operations in humans\u2019 semantics space as the abstraction of hardware requirements, then the authors ground such abstractions to instantiated hardware devices, subject to constraints and preferences in the real world\u2014optimizing this problem is essentially standardizing and automating the design of automation systems. On this basis, this work develops an automated design framework in a hybrid data-driven and principle-derived fashion. Results on designing self-driving laboratories for enhancing experiment-driven scientific discovery suggest the proposed framework\u2019s potential to produce compact systems that fully satisfy domain-specific and user-customized requirements with no redundancy."}, {"name": "Constraint Representation Towards Precise Data-Driven Storytelling", "url": "https://ieeexplore.ieee.org/abstract/document/10766486", "description": "***VIS-Gen4DS'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=12234019078719898658)]. \\[[Preprint](https://arxiv.org/abs/2410.07535)]. A position paper on DSL for data-driven storytelling. Data-driven storytelling serves as a crucial bridge for communicating ideas in a persuasive way. However, the manual creation of data stories is a multifaceted, labor-intensive, and case-specific effort, limiting their broader application. As a result, automating the creation of data stories has emerged as a significant research thrust. Despite advances in Artificial Intelligence, the systematic generation of data stories remains challenging due to their hybrid nature: they must frame a perspective based on a seed idea in a top-down manner, similar to traditional storytelling, while coherently grounding insights of given evidence in a bottom-up fashion, akin to data analysis. These dual requirements necessitate precise constraints on the permissible space of a data story. This viewpoint proposes integrating constraints into the data story generation process. Defined upon the hierarchies of interpretation and articulation, constraints shape both narrations and illustrations to align with seed ideas and contextualized evidence. The authors identify the taxonomy and required functionalities of these constraints. Although constraints can be heterogeneous and latent, this position paper explores the potential to represent them in a computation-friendly fashion via Domain-Specific Languages. The authors believe that leveraging constraints will facilitate both artistic and scientific aspects of data story generation."}, {"name": "Reproducibility in automated chemistry laboratories using computer science abstractions", "url": "https://www.nature.com/articles/s44160-024-00649-8", "description": "***Nature Synthesis***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=2583939834455194329)]. While abstraction is critical for the transferability of automated laboratory science in (bio)chemical and materials sciences, its improper implementation is a technical debt taken against the reproducibility of experimental results. Over the decades, computer science has developed guidelines and strategies for how abstractions are captured in programming languages---particularly concerning the substitutability of implementations of abstracted ideas and the clear definition of the contexts in which abstractions are used. However, few programming languages developed for automated experiments fully leverage the wisdom learned in computer science. To achieve collaborative sharing of scientific knowledge via automated laboratories, the way that experimental protocols are codified and interpreted by machine agents must use abstractions responsibly and with reproducibility, rather than solely transferability, at its core. This Review discusses how computer science principles of abstraction can be translated to create more reproducible automation as an enabler for the acceleration of collaborative research with self-driving laboratories."}, {"name": "AutoDSL: Automated domain-specific language design for structural representation of procedures with constraints", "url": "https://aclanthology.org/2024.acl-long.659/", "description": "***ACL'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=588082932830954126)]. \\[[Preprint](https://arxiv.org/abs/2406.12324)]. \\[[Project](https://autodsl.org/procedure/papers/acl24shi.html)]. The original paper on the automated design of DSLs, referred to as AutoDSL. Accurate representation of procedures in restricted scenarios, such as non-standardized scientific experiments, requires precise depiction of constraints. Unfortunately, Domain-Specific Language (DSL), as an effective tool to express constraints structurally, often requires case-by-case hand-crafting, necessitating customized, labor-intensive efforts. To overcome this challenge, this paper introduces the AutoDSL framework to automate DSL-based constraint design across various domains. Utilizing domain specified experimental protocol corpora, AutoDSL optimizes syntactic constraints and abstracts semantic constraints. Quantitative and qualitative analyses of the DSLs designed by AutoDSL across five distinct domains highlight its potential as an auxiliary module for language models, aiming to improve procedural planning and execution."}, {"name": "Hierarchically Encapsulated Representation for Protocol Design in Self-Driving Labs", "url": "https://openreview.net/forum?id=9nUBh4V6SA", "description": "***ICLR'25***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=6090102857833092474)]. \\[[Project](https://autodsl.org/procedure/papers/iclr25shi.html)]. Self-driving laboratories have begun to replace human experimenters in performing single experimental skills or predetermined experimental protocols. However, as the pace of idea iteration in scientific research has been intensified by Artificial Intelligence, the demand for rapid design of new protocols for new discoveries become evident. Efforts to automate protocol design have been initiated, but the capabilities of knowledge-based machine designers, such as Large Language Models, have not been fully elicited, probably for the absence of a systematic representation of experimental knowledge, as opposed to isolated, flatten pieces of information. To tackle this issue, this work proposes a multi-faceted, multi-scale representation, where instance actions, generalized operations, and product flow models are hierarchically encapsulated using Domain-Specific Languages. The authors further develop a data-driven algorithm based on non-parametric modeling that autonomously customizes these representations for specific domains. The proposed representation is equipped with various machine designers to manage protocol design tasks, including planning, modification, and adjustment. The results demonstrate that the proposed method could effectively complement Large Language Models in the protocol design process, serving as an auxiliary module in the realm of machine-assisted scientific exploration."}, {"name": "Organic synthesis in a modular robotic system driven by a chemical programming language", "url": "https://www.science.org/doi/full/10.1126/science.aav2211", "description": "***Science***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=13920677955690815682)]. \\[[Preprint](https://www.chem.gla.ac.uk/cronin/images/pubs/387-Steiner-ScienceJan19.full.pdf)]. \\[[Perspective: Democratizing synthesis by automation](https://www.science.org/doi/10.1126/science.aav8816)]. This paper develops an autonomous compiler and robotic laboratory platform to synthesize organic compounds on the basis of standardized methods descriptions. The platform comprises conventional equipment such as round-bottom flasks, separatory funnels, and a rotary evaporator to maximize its compatibility with extant literature. The authors showcase the system with short syntheses of three common pharmaceuticals that proceeded comparably to manual synthesis."}, {"name": "Convergence of multiple synthetic paradigms in a universally programmable chemical synthesis machine", "url": "https://www.nature.com/articles/s41557-020-00596-9", "description": "***Nature Chemistry***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=18024303106901939347)]. \\[[Preprint](https://eprints.gla.ac.uk/231947/)]. Although the automatic synthesis of molecules has been established, each reaction class uses bespoke hardware. This means that the connection of multi-step syntheses in a single machine to run many different protocols and reactions is not possible, as manual intervention is required. This paper shows how the Chemputer synthesis robot can be programmed to perform many different reactions, including solid-phase peptide synthesis, iterative cross-coupling and accessing reactive, unstable diazirines in a single, unified system with high yields and purity. Developing universal and modular hardware that can be automated using one software system makes a wide variety of batch chemistry accessible. This is shown by the proposed system, which performed around 8,500 operations while reusing only 22 distinct steps in 10 unique modules, with the code able to access 17 different reactions. The authors also demonstrate a complex convergent robotic synthesis of a peptide reacted with a diazirine---a process requiring 12 synthetic steps."}, {"name": "Biocoder: A programming language for standardizing and automating biology protocols", "url": "https://jbioleng.biomedcentral.com/track/pdf/10.1186/1754-1611-4-13.pdf", "description": "***Journal of Biological Engineering***, 2010. \\[[All Versions](https://scholar.google.com/scholar?start=0\\&hl=en\\&as_sdt=0,5\\&cluster=15572197190838916795)]. \\[[Project (\u2b501)](https://github.com/nmz787/BioCoder)]. \\[[Microsoft Page](https://www.microsoft.com/en-us/download/details.aspx?id=52556)] This paper introduces BioCoder, a C++ library that enables biologists to express the exact steps needed to execute a protocol. In addition to being suitable for automation, BioCoder converts the code into a readable, English-language description for use by biologists."}, {"name": "Universal chemical programming language for robotic synthesis repeatability", "url": "https://www.nature.com/articles/s44160-023-00473-6", "description": "***Nature Synthesis***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=3455106495990439366)]. \\[[Preprint](https://www.chem.gla.ac.uk/cronin/images/pubs/rauschen-natsynthesisjan24.pdf)]. The amount of chemical synthesis literature is growing quickly; however, it takes a long time to share and evaluate new processes among laboratories. This paper presents an approach that uses a universal chemical programming language (\u03c7DL) to encode and execute synthesis procedures for a variety of chemical reactions, including reductive amination, ring formation, esterification, carbon\u2013carbon bond formation and amide coupling on four different hardware systems in two laboratories. With around 50 lines of code per reaction, the approach uses abstraction to efficiently compress chemical protocols."}, {"name": "An integrated self-optimizing programmable chemical synthesis and reaction engine", "url": "https://www.nature.com/articles/s41467-024-45444-3", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=9157508627971047184)]. Robotic platforms for chemistry are developing rapidly but most systems are not currently able to adapt to changing circumstances in real-time. This paper presents a dynamically programmable system capable of making, optimizing, and discovering new molecules which utilizes seven sensors that continuously monitor the reaction. By developing a dynamic programming language, the work demonstrates the 10-fold scale-up of a highly exothermic oxidation reaction, end point detection, as well as detecting critical hardware failures."}, {"name": "Building an Open Representation for Biological Protocols", "url": "https://dl.acm.org/doi/full/10.1145/3604568", "description": "***ACM Journal on Emerging Technologies in Computing Systems***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=17225405546647782000)]. Laboratory protocols are critical to biological research and development, yet difficult to communicate and reproduce across projects, investigators, and organizations. While many attempts have been made to address this challenge, there is currently no available protocol representation that is unambiguous enough for precise interpretation and automation, yet simultaneously \u201chuman friendly\u201d and abstract enough to enable reuse and adaptation. The Laboratory Open Protocol language (LabOP) is a free and open protocol representation aiming to address this gap, building on a foundation of UML, Autoprotocol, Aquarium, SBOL RDF, and the Provenance Ontology. LabOP provides a linked-data representation both for protocols and for records of their execution and the resulting data, as well as a framework for exporting from LabOP for execution by either humans or laboratory automation. LabOP is currently implemented in the form of an RDF knowledge representation, specification document, and Python library, and supports execution as manual \u201cpaper protocols,\u201d by Autoprotocol or by Opentrons. From this initial implementation, LabOP is being further developed as an open community effort."}, {"name": "KnitScript: A Domain-Specific Scripting Language for Advanced Machine Knitting", "url": "https://dl.acm.org/doi/abs/10.1145/3586183.3606789", "description": "***UIST'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=KnitScript%3A+A+Domain-Specific+Scripting+Language+for+Advanced+Machine+Knitting\\&btnG=)]. \\[[Project](https://pypi.org/project/knit-script/)]. This paper presents KnitScript, a domain-specific machine knitting scripting language that supports computationally driven knitting designs. KnitScript provides a comprehensive virtual model of knitting machines, giving access to machine-level capabilities as they are needed while automating a variety of tedious and error-prone details."}, {"name": "A domain\u2011specifc language framework for farm management information systems in precision agriculture", "url": "https://link.springer.com/article/10.1007/s11119-020-09770-y", "description": "***Precision Agriculture***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=1495954486695213496)]. This paper proposes a domain-specific language framework for the design and development of precision-agriculture FMISs, which copes with challenges on supporting the understandability, enhancing communication and analysis of the design decisions, and the communication among stakeholders."}, {"name": "Corel: A DSL for Cooking Recipes", "url": "https://fse.studenttheses.ub.rug.nl/25731/", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9477049800574267813)]. \\[[Corel recipe page](https://roorda.dev/recipes/0)]. \\[[International Network of Food Data Systems (INFOODS)](https://www.fao.org/infoods/infoods/tables-and-databases/faoinfoods-databases/en/)]. The Corel DSL for cooking recipes enables understanding of and computation with ingredients, and can construct a nutrition label for the recipe."}, {"name": "Infinite Photorealistic Worlds Using Procedural Generation", "url": "https://openaccess.thecvf.com/content/CVPR2023/html/Raistrick_Infinite_Photorealistic_Worlds_Using_Procedural_Generation_CVPR_2023_paper.html", "description": "***CVPR'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11620922717915489091)]. \\[[Website](https://infinigen.org/)]. \\[[Supplementary Text](https://openaccess.thecvf.com/content/CVPR2023/supplemental/Raistrick_Infinite_Photorealistic_Worlds_CVPR_2023_supplemental.pdf)]. This paper introduces Infinigen, a procedural generator of photorealistic 3D scenes of the natural world. Infinigen is entirely procedural: every asset, from shape to texture, is generated from scratch via randomized mathematical rules, using no external source and allowing infinite variation and composition."}, {"name": "Infinigen Indoors: Photorealistic Indoor Scenes using Procedural Generation", "url": "https://openaccess.thecvf.com/content/CVPR2024/html/Raistrick_Infinigen_Indoors_Photorealistic_Indoor_Scenes_using_Procedural_Generation_CVPR_2024_paper.html", "description": "***CVPR'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=14526967027465419958)]. This work introduces Infinigen Indoors, a Blender-based procedural generator of photorealistic indoor scenes. It builds upon the existing Infinigen system, which focuses on natural scenes, but expands its coverage to indoor scenes by introducing a diverse library of procedural indoor assets, including furniture, architecture elements, appliances, and other day-to-day objects. It also introduces a constraint-based arrangement system, which consists of a domain-specific language for expressing diverse constraints on scene composition, and a solver that generates scene compositions that maximally satisfy the constraints. The authors provide an export tool that allows the generated 3D objects and scenes to be directly used for training embodied agents in real-time simulators such as Omniverse and Unreal. Infinigen Indoors is open-sourced under the BSD license."}, {"name": "\"We Need Structured Output\": Towards User-centered Constraints on Large Language Model Output", "url": "https://dl.acm.org/doi/full/10.1145/3613905.3650756", "description": "***CHI EA'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=12105435542197416648)]. \\[[Preprint](https://research.google/pubs/we-need-structured-output-towards-user-centered-constraints-on-large-language-model-output/)]. Large language models can produce creative and diverse responses. However, to integrate them into current developer workflows, it is essential to constrain their outputs to follow specific formats or standards. This work surveyed 51 experienced industry professionals to understand the range of scenarios and motivations driving the need for output constraints from a user-centered perspective. The authors identified 134 concrete use cases for constraints at two levels: low-level, which ensures the output adhere to a structured format and an appropriate length, and high-level, which requires the output to follow semantic and stylistic guidelines without hallucination. Critically, applying output constraints could not only streamline the currently repetitive process of developing, testing, and integrating LLM prompts for developers, but also enhance the user experience of LLM-powered features and applications. The authors conclude with a discussion on user preferences and needs towards articulating intended constraints for LLMs, alongside an initial design for a constraint prototyping tool."}, {"name": "Evolution-inspired engineering of nonribosomal peptide synthetases", "url": "https://www.science.org/doi/full/10.1126/science.adg4320", "description": "***Science***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=1405723492554017729)]. Many clinically used drugs are derived from natural microbial products that are assembled in a stepwise fashion by the condensation of amino acids or acyl groups. Using insights from evolutionary analysis, two independent groups now show that the cumbersome enzyme complexes that produce these molecules can be pieced together to create new products on demand---if one knows the right spot for joining the pieces. Working with nonribosomal peptide synthetases, Bozh\u00fcy\u00fck et al. developed an approach called XUT (\u201cexchange unit between T domains\u201d) and demonstrated the production of a proteasome inhibitor by an enzyme complex containing fragments of five separate systems. Mabesoone et al. worked with polyketide synthases, demonstrating facile deletion and insertion of conceptually similar exchange units, producing a large number of related polyketide products with diverse modifications. These approaches are an important step forward for rational engineering of large enzyme complexes for small-molecule drug discovery and production."}, {"name": "OCTOPUS: operation control system for task optimization and job parallelization via a user-optimal scheduler", "url": "https://www.nature.com/articles/s41467-024-54067-7", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=4172377940787950525)]. The material acceleration platform, empowered by robotics and artificial intelligence, is a transformative approach for expediting material discovery processes across diverse domains. However, the development of an operating system for material acceleration platform faces challenges in simultaneously managing diverse experiments from multiple users. Specifically, when it is utilized by multiple users, the overlapping challenges of experimental modules or devices can lead to inefficiencies in both resource utilization and safety hazards. To overcome these challenges, this work presents an operation control system for material acceleration platform, namely, OCTOPUS, which is an acronym for operation control system for task optimization and job parallelization via a user-optimal scheduler. OCTOPUS streamlines experiment scheduling and optimizes resource utilization through integrating its interface node, master node and module nodes. Leveraging process modularization and a network protocol, OCTOPUS ensures the homogeneity, scalability, safety and versatility of the platform. In addition, OCTOPUS embodies a user-optimal scheduler. Job parallelization and task optimization techniques mitigate delays and safety hazards within realistic operational environments, while the closed-packing schedule algorithm efficiently executes multiple jobs with minimal resource waste. Copilot of OCTOPUS is developed to promote the reusability of OCTOPUS for potential users with their own sets of lab resources, which substantially simplifies the process of code generation and customization through GPT recommendations and client feedback. This work offers a solution to the challenges encountered within the platform accessed by multiple users, and thereby will facilitate its widespread adoption in material development processes."}, {"name": "The BioPAX community standard for pathway data sharing", "url": "https://www.nature.com/articles/nbt.1666", "description": "***Nature Biotechnology***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=11368332679628594895)]. \\[[Preprint](https://core.ac.uk/download/pdf/216139091.pdf)]. Biological Pathway Exchange (BioPAX) is a standard language to represent biological pathways at the molecular and cellular level and to facilitate the exchange of pathway data. BioPAX can represent metabolic and signaling pathways, molecular and genetic interactions and gene regulation networks."}, {"name": "Learning the language of viral evolution and escape", "url": "https://www.science.org/doi/full/10.1126/science.abd7331", "description": "***Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=13862653184613223515)]. The ability for viruses to mutate and evade the human immune system and cause infection, called viral escape, remains an obstacle to antiviral and vaccine development. Understanding the complex rules that govern escape could inform therapeutic design. This work modeled viral escape with machine learning algorithms originally developed for human natural language. The authors identified escape mutations as those that preserve viral infectivity but cause a virus to look different to the immune system, akin to word changes that preserve a sentence\u2019s grammaticality but change its meaning. With this approach, language models of influenza hemagglutinin, HIV-1 envelope glycoprotein (HIV Env), and severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) Spike viral proteins can accurately predict structural escape patterns using sequence data alone. This study represents a promising conceptual bridge between natural language and viral evolution."}, {"name": "A high-level programming language for generative protein design", "url": "https://www.biorxiv.org/content/10.1101/2022.12.21.521526v1", "description": "2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=11732741354610784314)]. Combining a basic set of building blocks into more complex forms is a universal design principle. Most protein designs have proceeded from a manual bottom-up approach using parts created by nature, but top-down design of proteins is fundamentally hard due to biological complexity. This work demonstrates how the modularity and programmability long sought for protein design can be realized through generative artificial intelligence. Advanced protein language models demonstrate emergent learning of atomic resolution structure and protein design principles. The authors leverage these developments to enable the programmable design of de novo protein sequences and structures of high complexity. First, the authors describe a high-level programming language based on modular building blocks that allows a designer to easily compose a set of desired properties. The authors then develop an energy-based generative model, built on atomic resolution structure prediction with a language model, that realizes all-atom structure designs that have the programmed properties. Designing a diverse set of specifications, including constraints on atomic coordinates, secondary structure, symmetry, and multimerization, demonstrates the generality and controllability of the approach. Enumerating constraints at increasing levels of hierarchical complexity shows that the approach can access a combinatorially large design space."}, {"name": "Artificial intelligence driven design of catalysts and materials for ring opening polymerization using a domain-specific language", "url": "https://www.nature.com/articles/s41467-023-39396-3", "description": "***Nature Communications***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=6595955912508683146)]. \\[[Project (\u2b5016)](https://github.com/IBM/ibm-materials-notebook)]. Advances in machine learning (ML) and automated experimentation are poised to vastly accelerate research in polymer science. Data representation is a critical aspect for enabling ML integration in research workflows, yet many data models impose significant rigidity making it difficult to accommodate a broad array of experiment and data types found in polymer science. This inflexibility presents a significant barrier for researchers to leverage their historical data in ML development. This work shows that a domain specific language, termed Chemical Markdown Language (CMDL), provides flexible, extensible, and consistent representation of disparate experiment types and polymer structures. CMDL enables seamless use of historical experimental data to fine-tune regression transformer (RT) models for generative molecular design tasks. The authors demonstrate the utility of this approach through the generation and the experimental validation of catalysts and polymers in the context of ring-opening polymerization---although the authors provide examples of how CMDL can be more broadly applied to other polymer classes. Critically, this work shows how the CMDL tuned model preserves key functional groups within the polymer structure, allowing for experimental validation. These results reveal the versatility of CMDL and how it facilitates translation of historical data into meaningful predictive and generative models to produce experimentally actionable output."}, {"name": "OpenLaw", "url": "https://docs.openlaw.io/", "description": "***OpenLaw\\.io***. It is now possible to model all or parts of legal agreements using code (smart contracts), decreasing the cost and friction of creating, securing, and generating binding legal agreements. Lawyers lack basic tools to build these dynamic, \u201csmart\u201d contracts in a way that is enforceable and understandable to a legal professional. OpenLaw is a technology stack to help power next generation \"smart\" legal agreements, with a domain-specific markup language, a integration framework, and a series of general applications."}, {"name": "Scenic: a language for scenario specification and data generation", "url": "https://link.springer.com/article/10.1007/s10994-021-06120-5", "description": "***Machine Learning***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=13790565080942515865)]. This paper proposes a domain-specific language, Scenic, for describing scenarios that are distributions over scenes and the behaviors of their agents over time. Scenic combines concise, readable syntax for spatiotemporal relationships with the ability to declaratively impose hard and soft constraints over the scenario."}, {"name": "Domain Specific Language for Smart Contract Development", "url": "https://ieeexplore.ieee.org/abstract/document/9169399", "description": "***ICBC'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16998538751745390273)]. \\[[Preprint](http://eprints-dev5.cs.univie.ac.at/6341/1/PID6382125.pdf)]. This research addresses the understanding hardness raised from the conceptual discrepancy between contractual clauses and corresponding code of the Solidity programming language, by the design and study of a domain-specific smart contract language based on higher level of abstraction that can be automatically transformed to an implementation."}, {"name": "iContractML 2.0: A domain-specific language for modeling and deploying smart contracts onto multiple blockchain platforms", "url": "https://www.sciencedirect.com/science/article/pii/S0950584921002081", "description": "***Information and Software Technology***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=1548144959305241494)]. Smart contracts play a vital role in many fields. Despite being called smart, the development of smart contracts is a tedious task beyond defining a set of contractual rules. In addition to business knowledge, coding a smart contract requires strong technical knowledge in a multiplex of new and rapidly changing domain-specific languages and blockchain platforms. The goal of this paper is to assist developers in building smart contracts independently from the language or the target blockchain platform. In which, this paper presents the second-generation smart contract language iContractML 2.0. iContractML 2.0 is an extensible framework that empowers developers to model and generate functional smart contract code that can be deployed onto multiple blockchain platforms."}, {"name": "PClean: Bayesian Data Cleaning at Scale with Domain-Specific Probabilistic Programming", "url": "https://proceedings.mlr.press/v130/lew21a.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=2892523061439714130)]. This work presents PClean, a probabilistic programming language (PPL) for leveraging dataset-specific knowledge to automate Bayesian cleaning, automating Bayesian approaches given the diversity of real-world error patterns and the hardness of inference."}, {"name": "A Language for Counterfactual Generative Models", "url": "http://proceedings.mlr.press/v139/tavares21a.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=2067748786482591497)]. \\[[Project (\u2b50178)](https://github.com/zenna/Omega.jl)]. This paper presents Omega, a probabilistic programming language with support for counterfactual inference. This feature is accomplished by introducing a new operator to probabilistic programming akin to Pearl\u2019s do."}, {"name": "Product Line Engineering Using Domain-Specific Languages", "url": "https://ieeexplore.ieee.org/abstract/document/6030048", "description": "***ISPLC'11***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=17589685299346185442)]. \\[[Preprint](https://voelter.de/data/pub/VoelterVisser-PLEusingDSLs.pdf)]. This paper investigates the application of domain-specific languages in product line engineering (PLE). It starts by analyzing the limits of expressivity of feature models. Feature models correspond to context-free grammars without recursion, which prevents the expression of multiple instances and references. The authors then show how domain-specific languages (DSLs) can serve as a middle ground between feature modeling and programming. They can be used in cases where feature models are too limited, while keeping the separation between problem space and solution space provided by feature models. This work then categorizes useful combinations between configuration with feature model and construction with DSLs and provide an integration of DSLs into the conceptual framework of PLE. Finally the authors show how use of a consistent, unified formalism for models, code, and configuration can yield important benefits for managing variability and trace ability."}, {"name": "A Domain-Specific Language for Product-Process-Resource Modeling", "url": "https://ieeexplore.ieee.org/document/9613674", "description": "***ETFA'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=6006131184799036515)]. This paper presents the design of the PPR-DSL to effectively and efficiently represent Product-Process-Resource (PPR) aspects and evaluate constraints defined for modeling PPR views in the Formalized Process Description standard (VDI 3682)."}, {"name": "Configurable 3D Scene Synthesis and 2D Image Rendering with Per-pixel Ground Truth Using Stochastic Grammars", "url": "https://link.springer.com/article/10.1007/s11263-018-1103-5", "description": "***International Journal of Computer Vision***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=8301697457354598778)]. \\[[Preprint](https://yzhu.io/publication/scenesynthesis2018ijcv/paper.pdf)]. This work proposes a systematic learning-based approach to the generation of massive quantities of synthetic 3D scenes and arbitrary numbers of photorealistic 2D images thereof, with associated ground truth information, for the purposes of training, benchmarking, and diagnosing learning-based computer vision and robotics algorithms. In particular, the authors devise a learning-based pipeline of algorithms capable of automatically generating and rendering a potentially infinite variety of indoor scenes by using a stochastic grammar, represented as an attributed Spatial And-Or Graph, in conjunction with state-of-the-art physics-based rendering. The pipeline is capable of synthesizing scene layouts with high diversity, and it is configurable inasmuch as it enables the precise customization and control of important attributes of the generated scenes. It renders photorealistic RGB images of the generated scenes while automatically synthesizing detailed, per-pixel ground truth data, including visible surface depth and normal, object identity, and material information (detailed to object parts), as well as environments (e.g., illuminations and camera viewpoints). The authors demonstrate the value of the synthesized dataset, by improving performance in certain machine-learning-based scene understanding tasks\u2014depth and surface normal prediction, semantic segmentation, reconstruction, etc.---and by providing benchmarks for and diagnostics of trained models by modifying object attributes and scene properties in a controllable manner."}, {"name": "The Scene Language: Representing Scenes with Programs, Words, and Embeddings", "url": "https://arxiv.org/abs/2410.16770", "description": "***CVPR'25***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=8704845413716059914)]. \\[[Project](https://ai.stanford.edu/~yzzhang/projects/scene-language/)]. This paper introduces the Scene Language, a visual scene representation that concisely and precisely describes the structure, semantics, and identity of visual scenes. It represents a scene with three key components: a program that specifies the hierarchical and relational structure of entities in the scene, words in natural language that summarize the semantic class of each entity, and embeddings that capture the visual identity of each entity. This representation can be inferred from pre-trained language models via a training-free inference technique, given text or image inputs."}, {"name": "A prometastatic splicing program regulated by SNRPA1 interactions with structured RNA elements", "url": "https://www.science.org/doi/full/10.1126/science.abc7531", "description": "***Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9442501233912150085)]. Pathological changes in alternative splicing patterns are considered a hallmark of cancer, yet the underlying regulatory programs that control this process remain largely unknown. A major obstacle to better understanding these programs is that the bioinformatic strategies commonly used for the discovery of cis-regulatory elements fail to capture the contribution of RNA secondary structure to regulatory information. To address this, this work had previously developed the computational framework TEISER (Tool for Eliciting Informative Structural Elements in RNA), which uses both RNA structural and sequence information to identify cis-regulatory elements that are informative of transcriptomic changes. Here, the authors introduce pyTEISER (pythonic TEISER), which incorporates experimentally derived and additional computationally predicted RNA structural information to investigate the RNA sequence and structural code that governs a broader range of RNA-related processes, including splicing and RNA processing, in addition to steady-state gene expression."}, {"name": "Goals as reward-producing programs", "url": "https://www.nature.com/articles/s42256-025-00981-4", "description": "***Nature Human Behavior***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=10210797462358956689)]. \\[[Project (\u2b5013)](https://github.com/guydav/goals-as-reward-producing-programs/)]. People are remarkably capable of generating their own goals, beginning with child\u2019s play and continuing into adulthood. Despite considerable empirical and computational work on goals and goal-oriented behaviour, models are still far from capturing the richness of everyday human goals. This work bridges this gap by collecting a dataset of human-generated playful goals (in the form of scorable, single-player games), modelling them as reward-producing programs and generating novel human-like goals through program synthesis. Reward-producing programs capture the rich semantics of goals through symbolic operations that compose, add temporal constraints and allow program execution on behavioural traces to evaluate progress. To build a generative model of goals, the authors learn a fitness function over the infinite set of possible goal programs and sample novel goals with a quality-diversity algorithm. Human evaluators found that model-generated goals, when sampled from partitions of program space occupied by human examples, were indistinguishable from human-created games. The authors also discovered that the model\u2019s internal fitness scores predict games that are evaluated as more fun to play and more human-like."}, {"name": "A Generalized Earley Parser for Human Activity Parsing and Prediction", "url": "https://scholar.google.com/scholar?cluster=8196745813546421985", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=8196745813546421985)]. Detection, parsing, and future predictions on sequence data (e.g., videos) require the algorithms to capture non-Markovian and compositional properties of high-level semantics. Context-free grammars are natural choices to capture such properties, but traditional grammar parsers (e.g., Earley parser) only take symbolic sentences as inputs. This paper generalizes the Earley parser to parse sequence data which is neither segmented nor labeled. Given the output of an arbitrary probabilistic classifier, this generalized Earley parser finds the optimal segmentation and labels in the language defined by the input grammar. Based on the parsing results, it makes top-down future predictions. The proposed method is generic, principled, and widely applicable. Experiment results clearly show the benefit of the method for both human activity parsing and prediction on three video datasets."}, {"name": "Structured Generative Models for Scene Understanding", "url": "https://link.springer.com/article/10.1007/s11263-024-02316-z", "description": "***International Journal of Computer Vision***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=14048730122287265932)]. This position paper argues for the use of structured generative models (SGMs) for the understanding of static scenes. This requires the reconstruction of a 3D scene from an input image (or a set of multi-view images), whereby the contents of the image(s) are causally explained in terms of models of instantiated objects, each with their own type, shape, appearance and pose, along with global variables like scene lighting and camera parameters. This approach also requires scene models which account for the co-occurrences and inter-relationships of objects in a scene. The SGM approach has the merits that it is compositional and generative, which lead to interpretability and editability. To pursue the SGM agenda, people need models for objects and scenes, and approaches to carry out inference. The authors first review models for objects, which include \u201cthings\u201d (object categories that have a well defined shape), and \u201cstuff\u201d (categories which have amorphous spatial extent). The authors then move on to review scene models which describe the inter-relationships of objects. Perhaps the most challenging problem for SGMs is inference of the objects, lighting and camera parameters, and scene inter-relationships from input consisting of a single or multiple images. The authors conclude with a discussion of issues that need addressing to advance the SGM agenda."}, {"name": "Algorithm for optimized mRNA design improves stability and immunogenicity", "url": "https://www.nature.com/articles/s41586-023-06127-z", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=13852796394887781838)]. Messenger RNA (mRNA) vaccines are being used to combat the spread of COVID-19, but they still exhibit critical limitations caused by mRNA instability and degradation, which are major obstacles for the storage, distribution and efficacy of the vaccine products. Increasing secondary structure lengthens mRNA half-life, which, together with optimal codons, improves protein expression. Therefore, a principled mRNA design algorithm must optimize both structural stability and codon usage. However, owing to synonymous codons, the mRNA design space is prohibitively large---for example, there are around 2.4\u2009\u00d7\u200910632 candidate mRNA sequences for the SARS-CoV-2 spike protein. This poses insurmountable computational challenges. This work provides a simple and unexpected solution using the classical concept of lattice parsing in computational linguistics, where finding the optimal mRNA sequence is analogous to identifying the most likely sentence among similar-sounding alternatives6. The algorithm LinearDesign finds an optimal mRNA design for the spike protein in just 11 minutes, and can concurrently optimize stability and codon usage. LinearDesign substantially improves mRNA half-life and protein expression, and profoundly increases antibody titre by up to 128 times in mice compared to the codon-optimization benchmark on mRNA vaccines for COVID-19 and varicella-zoster virus. This result reveals the great potential of principled mRNA design and enables the exploration of previously unreachable but highly stable and efficient designs. This work is a timely tool for vaccines and other mRNA-based medicines encoding therapeutic proteins such as monoclonal antibodies and anti-cancer drugs7,8."}, {"name": "Penrose: from mathematical notation to beautiful diagrams", "url": "https://dl.acm.org/doi/abs/10.1145/3386569.3392375", "description": "***ACM Transactions on Graphics***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7935816003253127595)]. This work introduces a system called Penrose for creating mathematical diagrams. Its basic functionality is to translate abstract statements written in familiar math-like notation into one or more possible visual representations. Rather than rely on a fixed library of visualization tools, the visual representation is user-defined in a constraint-based specification language; diagrams are then generated automatically via constrained numerical optimization. The system is user-extensible to many domains of mathematics, and is fast enough for iterative design exploration. In contrast to tools that specify diagrams via direct manipulation or low-level graphics programming, Penrose enables rapid creation and exploration of diagrams that faithfully preserve the underlying mathematical meaning. The authors demonstrate the effectiveness and generality of the system by showing how it can be used to illustrate a diverse set of concepts from mathematics and computer graphics."}, {"name": "LegalLanguage: A Domain-Specific Language for Legal Contexts", "url": "https://link.springer.com/chapter/10.1007/978-3-030-37933-9_3", "description": "***EEWC'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=12637991160754186719)]. Nowadays legal ontologies have been used in the legal domain, however, being poorly explored in legislative and production processes. This paper analyses the adoption of legal ontologies as a tool to support these processes, in particular, related to activities span from the submission of bills and their subsequent authoring and ratification. This paper introduces the state of the art of legal (or normative) ontologies; and also discusses some application examples. The analysis of this state of the art allows us to identify some problems, namely regarding the activities involving the authoring and validation of laws that tend to be very human-intensive and error-prone. As a consequence of this analysis, the authors introduce the LegalLanguage, a language particularly suitable for the authoring and specification of law(s) in a more rigorous and systematic way, that would allow to keep track different types of intra and inter-laws relationships (e.g., structural, order or temporal relationships between articles or even between laws)."}, {"name": "GarmentCode: Programming Parametric Sewing Patterns", "url": "https://dl.acm.org/doi/abs/10.1145/3618351", "description": "***ACM Transactions on Graphics***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=9890151343262605598)]. Garment modeling is an essential task of the global apparel industry and a core part of digital human modeling. Realistic representation of garments with valid sewing patterns is key to their accurate digital simulation and eventual fabrication. However, little-to-no computational tools provide support for bridging the gap between high-level construction goals and low-level editing of pattern geometry, e.g., combining or switching garment elements, semantic editing, or design exploration that maintains the validity of a sewing pattern. This work suggests the first DSL for garment modeling - GarmentCode - that applies principles of object-oriented programming to garment construction and allows designing sewing patterns in a hierarchical, component-oriented manner. The programming-based paradigm naturally provides unique advantages of component abstraction, algorithmic manipulation, and free-form design parametrization. The authors additionally support the construction process by automating typical low-level tasks like placing a dart at a desired location. In the prototype garment configurator, users can manipulate meaningful design parameters and body measurements, while the construction of pattern geometry is handled by garment programs implemented with GarmentCode."}, {"name": "VMC: A Grammar for Visualizing Statistical Model Checks", "url": "https://ieeexplore.ieee.org/abstract/document/10700937", "description": "***IEEE Transactions on Visualization and Computer Graphics***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=884768102185861577)]. Visualizations play a critical role in validating and improving statistical models. However, the design space of model check visualizations is not well understood, making it difficult for authors to explore and specify effective graphical model checks. VMC defines a model check visualization using four components: (1) samples of distributions of checkable quantities generated from the model, including predictive distributions for new data and distributions of model parameters; (2) transformations on observed data to facilitate comparison; (3) visual representations of distributions; and (4) layouts to facilitate comparing model samples and observed data. This work contributes an implementation of VMC as an R package. The authors validate VMC by reproducing a set of canonical model check examples, and show how using VMC to generate model checks reduces the edit distance between visualizations relative to existing visualization toolkits. The findings of an interview study with three expert modelers who used VMC highlight challenges and opportunities for encouraging exploration of correct, effective model check visualizations."}, {"name": "RoboGrammar: graph grammar for terrain-optimized robot design", "url": "https://dl.acm.org/doi/abs/10.1145/3414685.3417831", "description": "***ACM Transactions on Graphics***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7042593841334771437)]. This work presents RoboGrammar, a fully automated approach for generating optimized robot structures to traverse given terrains. This framework represents each robot design as a graph, and uses a graph grammar to express possible arrangements of physical robot assemblies. Each robot design can then be expressed as a sequence of grammar rules. Using only a small set of rules the grammar can describe hundreds of thousands of possible robot designs. The construction of the grammar limits the design space to designs that can be fabricated. For a given input terrain, the design space is searched to find the top performing robots and their corresponding controllers. The authors introduce Graph Heuristic Search - a novel method for efficient search of combinatorial design spaces. In Graph Heuristic Search, the authors explore the design space while simultaneously learning a function that maps incomplete designs (e.g., nodes in the combinatorial search tree) to the best performance values that can be achieved by expanding these incomplete designs. Graph Heuristic Search prioritizes exploration of the most promising branches of the design space. To test the method the authors optimize robots for a number of challenging and varied terrains. The authors demonstrate that RoboGrammar can successfully generate nontrivial robots that are optimized for a single terrain or a combination of terrains."}, {"name": "Situation Calculus", "url": "https://en.wikipedia.org/wiki/Situation_calculus", "description": "***Wikipedia***. Wikipedia on Situation Calculus, a logic formalism designed for representing and reasoning about dynamical domains."}, {"name": "What is Answer Set Programming?", "url": "https://link.springer.com/content/pdf/10.1007/978-3-030-24658-7.pdf", "description": "***Springer***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=3691841207891991771)]. \\[[Tutorial on AAAI](https://dl.acm.org/doi/abs/10.5555/1620270.1620340)]. Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic."}, {"name": "Answer Set Programming", "url": "https://link.springer.com/chapter/10.1007/3-540-46767-x_28", "description": "***ICLPNR'99***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=15267370435063454675)]. \\[[Preprint](http://people.sabanciuniv.edu/~esraerdem/teaching/krr06/asp.pdf)]. The original paper on Answer Set Programming (ASP), a form of declarative programming oriented towards difficult search problems, on the use of nonmonotonic reasoning in knowledge representation. In ASP solutions to a problem are represented by answer sets (known also as stable models), and not by answer substitutions produced in response to a query, as in conventional logic programming."}, {"name": "Action Languages, Answer Sets, and Planning", "url": "https://link.springer.com/chapter/10.1007%2F978-3-642-60085-2_16", "description": "***The Logic Programming Paradigms***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=2045126541850245645)]. \\[[Preprint](https://citeseerx.ist.psu.edu/document?repid=rep1\\&type=pdf\\&doi=e58359b3dae3141fd2c85ee3f00c566411134929)]. This is a discussion of some of the achievements and challenges related to representing actions and the design of planners from the perspective of logic programming. The authors talk about recent work on action languages and translating them into logic programming, on representing possible histories of an action domain by answer sets, on efficient implementations of the answer set semantics and their use for generating plans, and on causal logic and its relation to planning algorithms. Recent progress in these areas may lead to the creation of planners which are based on the ideas of logic programming and combine the use of expressive action description languages with efficient computational procedures."}, {"name": "Qualitative Simulation", "url": "https://www.sciencedirect.com/science/article/abs/pii/0004370286900731", "description": "***Artificial Intelligence***, 1986. \\[[All Versions](https://scholar.google.com/scholar?cluster=4945009733425184345\\&hl=en\\&as_sdt=0,5)]. \\[[Preprint](https://www.cs.utexas.edu/ftp/qsim/papers/Kuipers-aij-86.pdf)]. This paper presents a precise definition of qualitative structure and behavior descriptions as abstractions of differential equations and continuously differentiable functions. The authors present a new algorithm for qualitative simulation that generalizes the best features of existing algorithms, and allows direct comparisons among alternate approaches. Starting with a set of constraints abstracted from a differential equation, this work proves that the QSIM algorithm is guaranteed to produce a qualitative behavior corresponding to any solution to the original equation. The paper also shows that any qualitative simulation algorithm will sometimes produce spurious qualitative behaviors: ones which do not correspond to any mechanism satisfying the given constraints. These observations suggest specific types of care that must be taken in designing applications of qualitative causal reasoning systems, and in constructing and validating a knowledge base of mechanism descriptions."}, {"name": "Qualitative Reasoning: Modeling and Simulation with Incomplete Knowledge", "url": "https://www.cs.utexas.edu/users/qr/QR-book.html", "description": "***MIT Press***, 1994. \\[[All Versions](https://scholar.google.com/scholar?\\&cluster=6634684154722677465)]. This book presents, within a conceptually unified theoretical framework, a body of methods that have been developed over the past fifteen years for building and simulating qualitative models of physical systems - bathtubs, tea kettles, automobiles, the physiology of the body, chemical processing plants, control systems, electrical systems - where knowledge of that system is incomplete. The primary tool for this work is the author's QSIM algorithm, which is discussed in detail. Qualitative models are better able than traditional models to express states of incomplete knowledge about continuous mechanisms. Qualitative simulation guarantees to find all possible behaviors consistent with the knowledge in the model. This expressive power and coverage is important in problem solving for diagnosis, design, monitoring, explanation, and other applications of artificial intelligence."}, {"name": "Qualitative and quantitative simulation: bridging the gap", "url": "https://www.sciencedirect.com/science/article/pii/S0004370297000507", "description": "***Artificial Intelligence***, 1997. \\[[All Versions](https://scholar.google.com/scholar?cluster=9033452473914228535)]. Shortcomings of qualitative simulation and of quantitative simulation motivate combining them to do simulations exhibiting strengths of both. The resulting class of techniques is called semiquantitative simulation. One approach to semi-quantitative simulation is to use numeric intervals to represent incomplete quantitative information. This research demonstrates semi-quantitative simulation using intervals in an implemented semi-quantitative simulator called Q3. Q3 progressively refines a qualitative simulation, providing increasingly specific quantitative predictions which can converge to a numerical simulation in the limit while retaining important correctness guarantees from qualitative and interval simulation techniques."}, {"name": "A Logic Programming Language for Computational Nucleic Acid Devices", "url": "https://pubs.acs.org/doi/10.1021/acssynbio.8b00229", "description": "***ACS Synthetic Biology***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=3336951672389047784)]. This paper presents a logic programming language that allows a broad range of computational nucleic acid systems to be designed and analyzed. The language extends standard logic programming with a novel equational theory to express nucleic acid molecular motifs. It automatically identifies matching motifs present in the full system, in order to apply a specified transformation expressed as a logical rule."}, {"name": "Genetic circuit design automation with Cello 2.0", "url": "https://www.nature.com/articles/s41596-021-00675-2", "description": "***Nature Protocol***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=7418307542591684967)]. \\[[Preprint](https://www.researchgate.net/profile/Samuel-Oliveira-38/publication/358801979_Genetic_circuit_design_automation_with_Cello_20/links/635debf412cbac6a3e0b19e4/Genetic-circuit-design-automation-with-Cello-20.pdf)]. Cells interact with their environment, communicate among themselves, track time and make decisions through functions controlled by natural regulatory genetic circuits consisting of interacting biological components. Synthetic programmable circuits used in therapeutics and other applications can be automatically designed by computer-aided tools. The Cello software designs the DNA sequences for programmable circuits based on a high-level software description and a library of characterized DNA parts representing Boolean logic gates. This process allows for design specification reuse, modular DNA part library curation and formalized circuit transformations based on experimental data. This protocol describes Cello 2.0, a freely available cross-platform software written in Java. Cello 2.0 enables flexible descriptions of the logic gates\u2019 structure and their mathematical models representing dynamic behavior, new formal rules for describing the placement of gates in a genome, a new graphical user interface, support for Verilog 2005 syntax and a connection to the SynBioHub parts repository software environment. Collectively, these features expand Cello\u2019s capabilities beyond Escherichia coli plasmids to new organisms and broader genetic contexts, including the genome. Designing circuits with Cello 2.0 produces an abstract Boolean network from a Verilog file, assigns biological parts to each node in the Boolean network, constructs a DNA sequence and generates highly structured and annotated sequence representations suitable for downstream processing and fabrication, respectively. The result is a sequence implementing the specified Boolean function in the organism and predictions of circuit performance. Depending on the size of the design space and users\u2019 expertise, jobs may take minutes or hours to complete."}, {"name": "MoVer: Motion Verification for Motion Graphics Animations", "url": "https://arxiv.org/abs/2502.13372", "description": "***ACM Transactions on Graphics***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=527747131334466686)]. While large vision-language models can generate motion graphics animations from text prompts, they regularly fail to include all of spatio-temporal properties described in the prompt. This work introduces MoVer, a motion verification DSL based on first-order logic that can check spatio-temporal properties of a motion graphics animation. The authors identify a general set of such properties that people commonly use to describe animations (e.g., the direction and timing of motions, the relative positioning of objects, etc.). The authors implement these properties as predicates in MoVer and provide an execution engine that can apply a MoVer program to any input SVG-based motion graphics animation. The authors then demonstrate how MoVer can be used in an LLM-based synthesis and verification pipeline for iteratively refining motion graphics animations. Given a text prompt, the pipeline synthesizes a motion graphics animation and a corresponding MoVer program. Executing the verification program on the animation yields a report of the predicates that failed and the report can be automatically fed back to LLM to iteratively correct the animation."}, {"name": "The KoLMogorov Test: Compression by Code Generation", "url": "https://openreview.net/forum?id=C45YqeBDUM", "description": "***ICLR'25***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=16809888292456252135)]. Compression is at the heart of intelligence. A theoretically optimal way to compress any sequence of data is to find the shortest program that outputs that sequence and then halts. However, such Kolmogorov compression is uncomputable, and code generating LLMs struggle to approximate this theoretical ideal, as it requires reasoning, planning and search capabilities beyond those of current models. This work introduces the KoLMogorov-Test (KT), a compression-as-intelligence intelligence test for code generation LLMs. In KT a model is presented with a sequence of data at inference time, and asked to generate the shortest DSL (designed specifically for the task) program that produces the sequence. The authors identify several benefits of KT for both evaluation and training: an essentially infinite number of problem instances of varying difficulty is readily available, strong baselines already exist, the evaluation metric (compression) cannot be gamed, and pretraining data contamination is highly unlikely. To evaluate current models, the authors use audio, text, and DNA data, as well as sequences produced by random synthetic DSL programs."}, {"name": "Meta-analysis of the functional neuroimaging literature with probabilistic logic programming", "url": "https://www.nature.com/articles/s41598-022-21801-4", "description": "***Scientific Reports***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=5952076495542489316)]. Inferring reliable brain-behavior associations requires synthesizing evidence from thousands of functional neuroimaging studies through meta-analysis. However, existing meta-analysis tools are limited to investigating simple neuroscience concepts and expressing a restricted range of questions. This work expands the scope of neuroimaging meta-analysis by designing NeuroLang: a domain-specific language to express and test hypotheses using probabilistic first-order logic programming. By leveraging formalisms found at the crossroads of artificial intelligence and knowledge representation, NeuroLang provides the expressivity to address a larger repertoire of hypotheses in a meta-analysis, while seamlessly modeling the uncertainty inherent to neuroimaging data. The authors demonstrate the language\u2019s capabilities in conducting comprehensive neuroimaging meta-analysis through use-case examples that address questions of structure-function associations. Specifically, the authors infer the specific functional roles of three canonical brain networks, support the role of the visual word-form area in visuospatial attention, and investigate the heterogeneous organization of the frontoparietal control network."}, {"name": "Prototyping an Ontological Framework for Cellular Senescence Mechanisms: A Homeostasis Imbalance Perspective", "url": "https://www.nature.com/articles/s41597-024-03331-y", "description": "***Scientific Data***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=16297381933381807246)]. Although cellular senescence is a key factor in organismal aging, with both positive and negative effects on individuals, its mechanisms remain largely unknown. Thus, integrating knowledge is essential to explain how cellular senescence manifests in tissue damage and age-related diseases. Here, this work proposes an ontological model that organizes knowledge of cellular senescence in a computer-readable form. The authors manually annotated and defined cellular senescence processes, molecules, anatomical structures, phenotypes, and other entities based on the Homeostasis Imbalance Process ontology (HOIP). The authors described the mechanisms as causal relationships of processes and modelled a homeostatic imbalance between stress and stress response in cellular senescence for a unified framework. HOIP was assessed formally, and the relationships between cellular senescence and diseases were inferred for higher-order knowledge processing. The authors visualized cellular senescence processes to support knowledge utilization. This study provides a knowledge base to help elucidate mechanisms linking cellular and organismal aging."}, {"name": "Knowledge-Based Embodied Question Answering", "url": "https://ieeexplore.ieee.org/abstract/document/10128752", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=3297900861513340459)]. This paper proposes a novel Knowledge-based Embodied Question Answering (K-EQA) task, in which the agent intelligently explores the environment to answer various questions with the knowledge. Different from explicitly specifying the target object in the question as existing EQA work, the agent can resort to external knowledge to understand more complicated question such as \u201cPlease tell me what are objects used to cut food in the room?\u201d, in which the agent must know the knowledge such as \u201cknife is used for cutting food\u201d. To address this K-EQA problem, a novel framework based on neural program synthesis reasoning is proposed, where the joint reasoning of the external knowledge and 3D scene graph is performed to realize navigation and question answering. Especially, the 3D scene graph can provide the memory to store the visual information of visited scenes, which significantly improves the efficiency for the multi-turn question answering. Experimental results have demonstrated that the proposed framework is capable of answering more complicated and realistic questions in the embodied environment. The proposed method is also applicable to multi-agent scenarios."}, {"name": "Explainable Robotic Plan Execution Monitoring Under Partial Observability", "url": "https://ieeexplore.ieee.org/abstract/document/9623348", "description": "***IEEE Transactions on Robotics***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=8699998059430654104)]. Successful plan generation for autonomous systems is necessary but not sufficient to guarantee reaching a goal state by an execution of a plan. Various discrepancies between an expected state and the observed state may occur during the plan execution (e.g., due to unexpected exogenous events, changes in the goals, or failure of robot parts) and these discrepancies may lead to plan failures. For that reason, autonomous systems should be equipped with execution monitoring algorithms so that they can autonomously recover from such discrepancies. This work introduces a plan execution monitoring algorithm that operates under partial observability. This algorithm relies on novel formal methods for hybrid prediction, diagnosis and explanation generation, and planning. The prediction module generates an expected state after the execution of a part of the plan from an incomplete state to check for discrepancies. The diagnostic reasoning module generates meaningful hypotheses to explain failures of robot parts. Unlike the existing diagnosis methods, the previous hypotheses can be revised, based on new partial observations, increasing the accuracy of explanations as further information becomes available. The replanning module considers these explanations while computing a new plan that would avoid such failures. All these reasoning modules are hybrid in that they combine high-level logical reasoning with low-level feasibility checks based on probabilistic methods. The authors experimentally show that these hybrid formal reasoning modules improve the performance of plan execution monitoring."}, {"name": "LogSay: An Efficient Comprehension System for Log Numerical Reasoning", "url": "https://ieeexplore.ieee.org/abstract/document/10494680", "description": "***IEEE Transactions on Computers***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=17053857493674669692)]. With the growth of smart systems and applications, high volume logs are generated that record important data for system maintenance. System developers are usually required to analyze logs to track the status of the system or applications. Therefore, it is essential to find the answers in large-scale logs when they have some questions. This work designs a multi-step \u201cRetriever-Reader\u201d question-answering system, namely LogSay, which aims at predicting answers accurately and efficiently. The proposed system can not only answers simple questions, such as a segment log or span, but also can answer complex logical questions through numerical reasoning. LogSay has two key components: Log Retriever and Log Reasoner, and the authors designed five operators to implement them. Log Retriever aims at retrieving some relevant logs based on a question. Then, Log Reasoner performs numerical reasoning to infer the final answer. In addition, due to the lack of available question-answering datasets for system logs, the authors constructed question-answering datasets based on three public log datasets and will make them publicly available. The evaluation results show that LogSay outperforms the state-of-the-art works in terms of accuracy and efficiency."}, {"name": "Learning to Infer Graphics Programs from Hand-Drawn Images", "url": "https://proceedings.neurips.cc/paper/2018/hash/6788076842014c83cedadbe6b0ba0314-Abstract.html", "description": "***NeurIPS'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=14065112485794121024)]. The method learns a model that uses program synthesis techniques to recover a graphics program from drawing primitives. These programs have constructs like variable bindings, iterative loops, or simple kinds of conditionals. With a graphics program in hand, we can correct errors made by the deep network and extrapolate drawings."}, {"name": "babble: Learning Better Abstractions with E-Graphs and Anti-unification", "url": "https://dl.acm.org/doi/abs/10.1145/3571207", "description": "***POPL'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=7935064016901049715)]. This paper proposes library learning modulo theory (LLMT), a new library learning algorithm that additionally takes as input an equational theory for a given problem domain. LLMT uses e-graphs and equality saturation to compactly represent the space of programs equivalent modulo the theory, and uses a novel e-graph anti-unification technique to find common patterns in the corpus more directly and efficiently."}, {"name": "Top-Down Synthesis for Library Learning", "url": "https://dl.acm.org/doi/abs/10.1145/3571234", "description": "***POPL'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=12324277007659029766)]. This paper introduces corpus-guided top-down synthesis as a mechanism for synthesizing library functions that capture common functionality from a corpus of programs in a domain specific language (DSL). The algorithm builds abstractions directly from initial DSL primitives, using syntactic pattern matching of intermediate abstractions to intelligently prune the search space and guide the algorithm towards abstractions that maximally capture shared structures in the corpus."}, {"name": "DreamCoder: growing generalizable, interpretable knowledge with wake\u2013sleep Bayesian program learning", "url": "https://royalsocietypublishing.org/doi/full/10.1098/rsta.2022.0050", "description": "***Philosophical Transactions of the Royal Society A***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11356436337624711843)]. \\[[Preprint](https://arxiv.org/abs/2006.08381)]. This paper presents DreamCoder, a system that learns to solve problems by writing programs. It builds expertise by creating domain-specific programming languages for expressing domain concepts, together with neural networks to guide the search for programs within these languages. A \u2018wake\u2013sleep\u2019 learning algorithm alternately extends the language with new symbolic abstractions and trains the neural network on imagined and replayed problems. DreamCoder solves both classic inductive programming tasks and creative tasks such as drawing pictures and building scenes."}, {"name": "Synthesizing theories of human language with Bayesian program induction", "url": "https://www.nature.com/articles/s41467-022-32012-w", "description": "***Nature Communications***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=8603772394100237159)]. Automated, data-driven construction and evaluation of scientific models and theories is a long-standing challenge in artificial intelligence. This work presents a framework for algorithmically synthesizing models of a basic part of human language: morpho-phonology, the system that builds word forms from sounds. The authors integrate Bayesian inference with program synthesis and representations inspired by linguistic theory and cognitive models of learning and discovery. Across 70 datasets from 58 diverse languages, the system synthesizes human-interpretable models for core aspects of each language\u2019s morpho-phonology, sometimes approaching models posited by human linguists. Joint inference across all 70 data sets automatically synthesizes a meta-model encoding interpretable cross-language typological tendencies. Finally, the same algorithm captures few-shot learning dynamics, acquiring new morphophonological rules from just one or a few examples. These results suggest routes to more powerful machine-enabled discovery of interpretable models in linguistics and other scientific domains."}, {"name": "Grammar Prompting for Domain-Specific Language Generation with Large Language Models", "url": "https://proceedings.neurips.cc/paper_files/paper/2023/hash/cd40d0d65bfebb894ccc9ea822b47fa8-Abstract-Conference.html", "description": "***NeurIPS'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11694070042468483715)]. Grammar prompting is a simple approach to enable LLMs to use external knowledge and domain-specific constraints expressed through a grammar in Backus--Naur Form (BNF) during in-context learning. Grammar prompting augments each demonstration example with a specialized grammar that is minimally sufficient for generating the particular output example, where the specialized grammar is a subset of the full DSL grammar. For inference, the LLM first predicts a BNF grammar given a test input, and then generates the output according to the rules of the grammar. Experiments demonstrate that grammar prompting can enable LLMs to perform competitively on a diverse set of DSL generation tasks, including semantic parsing (SMCalFlow, Overnight, GeoQuery), PDDL planning, and SMILES-based molecule generation."}, {"name": "Errors are Useful Prompts: Instruction Guided Task Programming with Verifier-Assisted Iterative Prompting", "url": "https://arxiv.org/abs/2303.14100", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=8063693456660536915)]. \\[[Project (\u2b5047)](https://github.com/ac-rad/xdl-generation)]. \\[[Website](https://ac-rad.github.io/clairify/)]. This paper proposes CLAIRIFY, an approach that combines automatic iterative prompting with program verification to ensure programs written in data-scarce domain-specific language are syntactically valid and incorporate environment constraints."}, {"name": "PhotoScout: Synthesis-Powered Multi-Modal Image Search", "url": "https://dl.acm.org/doi/full/10.1145/3613904.3642319", "description": "***ACM SIGCHI'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=6522231014055730719)]. This paper explores a new multi-modal image search approach that allows users to conveniently specify and perform semantic image search tasks. With the tool, PhotoScout, the user interactively provides natural language descriptions, positive and negative examples, and object tags to specify their search tasks. Under the hood, PhotoScout is powered by a program synthesis engine that generates visual queries in a domain-specific language and executes the synthesized program to retrieve the desired images."}, {"name": "Expert-level protocol translation for self-driving labs", "url": "https://proceedings.neurips.cc/paper_files/paper/2024/hash/54dd9e0cff6d9214e20d97eb2a3bae49-Abstract-Conference.html", "description": "***NeurIPS'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=13997597682274906943)]. \\[[Project](https://autodsl.org/procedure/papers/neurips24shi.html)]. Recent development in Artificial Intelligence (AI) models has propelled their application in scientific discovery, but the validation and exploration of these discoveries require subsequent empirical experimentation. The concept of self-driving laboratories promises to automate and thus boost the experimental process following AI-driven discoveries. However, the transition of experimental protocols, originally crafted for human comprehension, into formats interpretable by machines presents significant challenges, which, within the context of specific expert domain, encompass the necessity for structured as opposed to natural language, the imperative for explicit rather than tacit knowledge, and the preservation of causality and consistency throughout protocol steps. Presently, the task of protocol translation predominantly requires the manual and labor-intensive involvement of domain experts and information technology specialists, rendering the process time-intensive. To address these issues, this work proposes a framework that automates the protocol translation process through a three-stage workflow, which incrementally constructs Protocol Dependence Graphs (PDGs) that approach structured on the syntax level, completed on the semantics level, and linked on the execution level. Quantitative and qualitative evaluations have demonstrated its performance at par with that of human experts, underscoring its potential to significantly expedite and democratize the process of scientific discovery by elevating the automation capabilities within self-driving laboratories."}, {"name": "Mathematical discoveries from program search with large language models", "url": "https://www.nature.com/articles/s41586-023-06924-6", "description": "***Nature***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=5653439474813913484)]. Large language models (LLMs) have demonstrated tremendous capabilities in solving complex tasks, from quantitative reasoning to understanding natural language. However, LLMs sometimes suffer from confabulations (or hallucinations), which can result in them making plausible but incorrect statements1,2. This hinders the use of current large models in scientific discovery. This work introduces FunSearch (short for searching in the function space), an evolutionary procedure based on pairing a pretrained LLM with a systematic evaluator. The authors demonstrate the effectiveness of this approach to surpass the best-known results in important problems, pushing the boundary of existing LLM-based approaches3. Applying FunSearch to a central problem in extremal combinatorics\u2014the cap set problem\u2014we discover new constructions of large cap sets going beyond the best-known ones, both in finite dimensional and asymptotic cases. This shows that it is possible to make discoveries for established open problems using LLMs. The authors showcase the generality of FunSearch by applying it to an algorithmic problem, online bin packing, finding new heuristics that improve on widely used baselines. In contrast to most computer search approaches, FunSearch searches for programs that describe how to solve a problem, rather than what the solution is. Beyond being an effective and scalable strategy, discovered programs tend to be more interpretable than raw solutions, enabling feedback loops between domain experts and FunSearch, and the deployment of such programs in real-world applications."}, {"name": "CoLadder: Manipulating Code Generation via Multi-Level Blocks", "url": "https://dl.acm.org/doi/abs/10.1145/3654777.3676357", "description": "***UIST'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=6267750825019915015)]. This paper adopted an iterative design process to gain insights into programmers\u2019 strategies when using LLMs for programming. The authors proposed CoLadder, a novel system that supports programmers by facilitating hierarchical task decomposition, direct code segment manipulation, and result evaluation during prompt authoring. A user study with 12 experienced programmers showed that CoLadder is effective in helping programmers externalize their problem-solving intentions flexibly, improving their ability to evaluate and modify code across various abstraction levels, from their task\u2019s goal to final code implementation."}, {"name": "InverseCSG: automatic conversion of 3D models to CSG trees", "url": "https://dl.acm.org/doi/abs/10.1145/3272127.3275006", "description": "***ACM Transactions on Graphics***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=3247081749407570405)]. While computer-aided design is a major part of many modern manufacturing pipelines, the design files typically generated describe raw geometry. Lost in this representation is the procedure by which these designs were generated. This paper presents a method for reverse-engineering the process by which 3D models may have been generated, in the language of constructive solid geometry (CSG). Observing that CSG is a formal grammar, the authors formulate this inverse CSG problem as a program synthesis problem. The solution is an algorithm that couples geometric processing with state-of-the-art program synthesis techniques. In this scheme, geometric processing is used to convert the mixed discrete and continuous domain of CSG trees to a pure discrete domain where modern program synthesizers excel. The authors demonstrate the efficiency and scalability of the algorithm on several different examples, including those with over 100 primitive parts. The authors show that the algorithm is able to find simple programs which are close to the ground truth, and demonstrate the method's applicability in mesh re-editing. Finally, the authors compare the method to prior state-of-the-art. The authors demonstrate that the algorithm dominates previous methods in terms of resulting CSG compactness and runtime, and can handle far more complex input meshes than any previous method."}, {"name": "pix2code: Generating Code from a Graphical User Interface Screenshot", "url": "https://dl.acm.org/doi/abs/10.1145/3220134.3220135", "description": "***ACM SIGCHI Symposium on Engineering Interactive Computing Systems***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=8296741513177971931)]. \\[[Code (\u2b5012k)](https://github.com/tonybeltramelli/pix2code)]. \\[[Website](https://uizard.io/research/)]. This paper shows that deep learning methods can be leveraged to train a model end-to-end to automatically reverse engineer user interfaces and generate code from a single input image with over 77% of accuracy for three different platforms (i.e. iOS, Android and web-based technologies)."}, {"name": "Free2CAD: parsing freehand drawings into CAD commands", "url": "https://dl.acm.org/doi/abs/10.1145/3528223.3530133", "description": "***ACM Transactions on Graphics***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=5726506085191658159)]. CAD modeling, despite being the industry-standard, remains restricted to usage by skilled practitioners due to two key barriers. First, the user must be able to mentally parse a final shape into a valid sequence of supported CAD commands; and second, the user must be sufficiently conversant with CAD software packages to be able to execute the corresponding CAD commands. As a step towards addressing both these challenges, this work presents Free2CAD wherein the user can simply sketch the final shape and the system parses the input strokes into a sequence of commands expressed in a simplified CAD language. When executed, these commands reproduce the sketched object. Technically, the authors cast sketch-based CAD modeling as a sequence-to-sequence translation problem, for which the authors leverage the powerful Transformers neural network architecture. Given the sequence of pen strokes as input, the authors introduce the new task of grouping strokes that correspond to individual CAD operations. The authors combine stroke grouping with geometric fitting of the operation parameters, such that intermediate groups are geometrically corrected before being reused, as context, for subsequent steps in the sequence inference. Although trained on synthetically-generated data, the authors demonstrate that Free2CAD generalizes to sketches created from real-world CAD models as well as to sketches drawn by novice users."}, {"name": "ShapeAssembly: learning to generate programs for 3D shape structure synthesis", "url": "https://dl.acm.org/doi/abs/10.1145/3414685.3417812", "description": "***ACM Transactions on Graphics***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7510961460353268258)]. Manually authoring 3D shapes is difficult and time consuming; generative models of 3D shapes offer compelling alternatives. Procedural representations are one such possibility: they offer high-quality and editable results but are difficult to author and often produce outputs with limited diversity. On the other extreme are deep generative models: given enough data, they can learn to generate any class of shape but their outputs have artifacts and the representation is not editable. This work takes a step towards achieving the best of both worlds for novel 3D shape synthesis. The authors propose ShapeAssembly, a domain-specific \"assembly-language\" for 3D shape structures. ShapeAssembly programs construct shape structures by declaring cuboid part proxies and attaching them to one another, in a hierarchical and symmetrical fashion. ShapeAssembly functions are parameterized with continuous free variables, so that one program structure is able to capture a family of related shapes. The authors show how to extract ShapeAssembly programs from existing shape structures in the PartNet dataset. Then, the authors train a deep generative model, a hierarchical sequence VAE, that learns to write novel ShapeAssembly programs. The approach leverages the strengths of each representation: the program captures the subset of shape variability that is interpretable and editable, and the deep generative model captures variability and correlations across shape collections that is hard to express procedurally."}, {"name": "ShapeMOD: macro operation discovery for 3D shape programs", "url": "https://dl.acm.org/doi/abs/10.1145/3450626.3459821", "description": "***ACM Transactions on Graphics***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=16783678518681779265)]. A popular way to create detailed yet easily controllable 3D shapes is via procedural modeling, i.e. generating geometry using programs. Such programs consist of a series of instructions along with their associated parameter values. To fully realize the benefits of this representation, a shape program should be compact and only expose degrees of freedom that allow for meaningful manipulation of output geometry. One way to achieve this goal is to design higher-level macro operators that, when executed, expand into a series of commands from the base shape modeling language. However, manually authoring such macros, much like shape programs themselves, is difficult and largely restricted to domain experts. This paper presents ShapeMOD, an algorithm for automatically discovering macros that are useful across large datasets of 3D shape programs. ShapeMOD operates on shape programs expressed in an imperative, statement-based language. It is designed to discover macros that make programs more compact by minimizing the number of function calls and free parameters required to represent an input shape collection. The authors run ShapeMOD on multiple collections of programs expressed in a domain-specific language for 3D shape structures. The authors show that it automatically discovers a concise set of macros that abstract out common structural and parametric patterns that generalize over large shape collections. The authors also demonstrate that the macros found by ShapeMOD improve performance on downstream tasks including shape generative modeling and inferring programs from point clouds. Finally, the authors conduct a user study that indicates that ShapeMOD's discovered macros make interactive shape editing more efficient."}, {"name": "ShapeCoder: Discovering Abstractions for Visual Programs from Unstructured Primitives", "url": "https://dl.acm.org/doi/abs/10.1145/3592416", "description": "***ACM Transactions on Graphics***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=682217944594450121)]. This work introduces ShapeCoder, the first system capable of taking a dataset of shapes, represented with unstructured primitives, and jointly discovering (i) useful abstraction functions and (ii) programs that use these abstractions to explain the input shapes. The discovered abstractions capture common patterns (both structural and parametric) across a dataset, so that programs rewritten with these abstractions are more compact, and suppress spurious degrees of freedom. ShapeCoder improves upon previous abstraction discovery methods, finding better abstractions, for more complex inputs, under less stringent input assumptions. This is principally made possible by two methodological advancements: (a) a shape-to-program recognition network that learns to solve sub-problems and (b) the use of e-graphs, augmented with a conditional rewrite scheme, to determine when abstractions with complex parametric expressions can be applied, in a tractable manner. The authors evaluate ShapeCoder on multiple datasets of 3D shapes, where primitive decompositions are either parsed from manual annotations or produced by an unsupervised cuboid abstraction method. In all domains, ShapeCoder discovers a library of abstractions that captures high-level relationships, removes extraneous degrees of freedom, and achieves better dataset compression compared with alternative approaches. Finally, the authors investigate how programs rewritten to use discovered abstractions prove useful for downstream tasks."}, {"name": "Learning attribute grammars for movement primitive sequencing", "url": "https://journals.sagepub.com/doi/full/10.1177/0278364919868279", "description": "***International Journal of Robotics Research***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=3308554285811264465)]. Movement primitives are a well studied and widely applied concept in modern robotics. However, composing primitives out of an existing library has shown to be a challenging problem. This work proposes the use of probabilistic context-free grammars to sequence a series of primitives to generate complex robot policies from a given library of primitives. The rule-based nature of formal grammars allows an intuitive encoding of hierarchically structured tasks. This hierarchical concept strongly connects with the way robot policies can be learned, organized, and re-used. However, the induction of context-free grammars has proven to be a complicated and yet unsolved challenge. The authors exploit the physical nature of robot movement primitives to restrict and efficiently search the grammar space. The grammar is learned by applying a Markov chain Monte Carlo optimization over the posteriors of the grammars given the observations. The proposal distribution is defined as a mixture over the probabilities of the operators connecting the search space. Moreover, the authors present an approach for the categorization of probabilistic movement primitives and discuss how the connectibility of two primitives can be determined. These characteristics in combination with restrictions to the operators guarantee continuous sequences while reducing the grammar space. In addition, a set of attributes and conditions is introduced that augments probabilistic context-free grammars in order to solve primitive sequencing tasks with the capability to adapt single primitives within the sequence. The method was validated on tasks that require the generation of complex sequences consisting of simple movement primitives using a seven-degree-of-freedom lightweight robotic arm."}, {"name": "LogiCode: An LLM-Driven Framework for Logical Anomaly Detection", "url": "https://ieeexplore.ieee.org/abstract/document/10710633", "description": "***IEEE Transactions on Automation Science and Engineering***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=4279830355362202335)]. This paper presents LogiCode, a novel framework that leverages Large Language Models (LLMs) for identifying logical anomalies in industrial settings, moving beyond the traditional focus on structural inconsistencies. By harnessing LLMs for logical reasoning, LogiCode autonomously generates Python codes to pinpoint anomalies such as incorrect component quantities or missing elements, marking a significant leap forward in anomaly detection technologies. A custom dataset \u201cLOCO-Annotations\u201d and a benchmark \u201cLogiBench\u201d are introduced to evaluate the LogiCode\u2019s performance across various metrics including binary classification accuracy, code generation success rate, and precision in reasoning. Findings demonstrate LogiCode\u2019s enhanced interpretability, significantly improving the accuracy of logical anomaly detection and offering detailed explanations for identified anomalies. This represents a notable shift towards more intelligent, LLM-driven approaches in industrial anomaly detection, promising substantial impacts on industry-specific applications."}, {"name": "Synthesis of Incremental Linear Algebra Programs", "url": "https://dl.acm.org/doi/abs/10.1145/3385398", "description": "***ACM Transactions on Database Systems***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=18222415331047706008)]. This article targets the Incremental View Maintenance (IVM) of sophisticated analytics (such as statistical models, machine learning programs, and graph algorithms) expressed as linear algebra programs. This work presents LAGO, a unified framework for linear algebra that automatically synthesizes efficient incremental trigger programs, thereby freeing the user from error-prone manual derivations, performance tuning, and low-level implementation details. The key technique underlying the framework is abstract interpretation, which is used to infer various properties of analytical programs. These properties give the reasoning power required for the automatic synthesis of efficient incremental triggers. The authors evaluate the effectiveness of the framework on a wide range of applications from regression models to graph computations."}, {"name": "Enhancing Robot Program Synthesis Through Environmental Context", "url": "https://proceedings.neurips.cc/paper_files/paper/2023/hash/0c1e94af650f5c74b1f3da467c2308c2-Abstract-Conference.html", "description": "***NeurIPS'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=17630134586050451683)]. Program synthesis aims to automatically generate an executable program that conforms to the given specification. Recent advancements have demonstrated that deep neural methodologies and large-scale pretrained language models are highly proficient in capturing program semantics. For robot programming, prior works have facilitated program synthesis by incorporating global environments. However, the assumption of acquiring a comprehensive understanding of the entire environment is often excessively challenging to achieve. This work presents a framework that learns to synthesize a program by rectifying potentially erroneous code segments, with the aid of partially observed environments. To tackle the issue of inadequate attention to partial observations, the authors propose to first learn an environment embedding space that can implicitly evaluate the impacts of each program token based on the precondition. Furthermore, by employing a graph structure, the model can aggregate both environmental and syntactic information flow and furnish smooth program rectification guidance. Extensive experimental evaluations and ablation studies on the partially observed VizDoom domain authenticate that the method offers superior generalization capability across various tasks and greater robustness when encountering noises."}, {"name": "On the Effectiveness of Large Language Models in Domain-Specific Code Generation", "url": "https://dl.acm.org/doi/full/10.1145/3697012", "description": "***ACM Transactions on Software Engineering and Methodology***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=9022735489715766344)]. Large language models (LLMs) such as ChatGPT have shown remarkable capabilities in code generation. Despite significant achievements, they rely on enormous training data to acquire a broad spectrum of open-domain knowledge. Besides, their evaluation revolves around open-domain benchmarks like HumanEval, which primarily consist of programming contests. Therefore, it is hard to fully characterize the intricacies and challenges associated with particular domains (e.g., Web, game, and math). This work conducts an in-depth study of the LLMs in domain-specific code generation. The results demonstrate that LLMs exhibit sub-optimal performance in generating domain-specific code, due to their limited proficiency in utilizing domain-specific libraries. The authors further observe that incorporating API knowledge as prompts can empower LLMs to generate more professional code. Based on these findings, the authors further investigate how to effectively incorporate API knowledge into the code generation process. The authors experiment with three strategies for incorporating domain knowledge, namely, external knowledge inquirer, chain-of-thought prompting, and chain-of-thought fine-tuning. The authors refer to these strategies as a new code generation approach called DomCoder. Experimental results show that all strategies of DomCoder improve the effectiveness of domain-specific code generation under certain settings."}, {"name": "The Child as Hacker", "url": "https://www.cell.com/trends/cognitive-sciences/fulltext/S1364-6613\\(20\\", "description": ""}, {"name": "How laypeople evaluate scientific explanations containing jargon", "url": "https://www.nature.com/articles/s41562-025-02227-0", "description": "***Nature Human Behavior***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=6467855047925175367)]. Individuals rely on others\u2019 expertise to achieve a basic understanding of the world. But how can non-experts achieve understanding from explanations that, by definition, they are ill-equipped to assess? Across 9 experiments with 6,698 participants (Study 1A\u2009=\u2009737; 1B\u2009=\u2009734; 1C\u2009=\u2009733; 2A\u2009=\u20091,014; 2B\u2009=\u2009509; 2C\u2009=\u20091,012; 3A\u2009=\u20091,026; 3B\u2009=\u2009512; 4\u2009=\u2009421), this work addresses this puzzle by focusing on scientific explanations with jargon. The authors identify \u2018when\u2019 and \u2018why\u2019 the inclusion of jargon makes explanations more satisfying, despite decreasing their comprehensibility. The authors find that jargon increases satisfaction because laypeople assume the jargon fills gaps in explanations that are otherwise incomplete. The authors also identify strategies for debiasing these judgements: when people attempt to generate their own explanations, inflated judgements of poor explanations with jargon are reduced, and people become better calibrated in their assessments of their own ability to explain."}, {"name": "Communicating Natural Programs to Humans and Machines", "url": "https://proceedings.neurips.cc/paper_files/paper/2022/hash/182aed0379591ebd1d655b2bdc152075-Abstract-Datasets_and_Benchmarks.html", "description": "***NeurIPS'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=13381039702346039142)]. While humans readily generate and interpret instructions in a general language, computer systems are shackled to a narrow domain-specific language that they can precisely execute. This makes building intelligent systems that can generalize to novel situations such as ARC difficult. Human-generated instructions are referred as \u201cnatural programs\u201d. While they resemble computer programs, they are distinct in two ways: First, they contain a wide range of primitives; Second, they frequently leverage communicative strategies beyond directly executable codes."}, {"name": "Symbolic metaprogram search improves learning efficiency and explains rule learning in humans", "url": "https://www.nature.com/articles/s41467-024-50966-x", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=7670274141609367282)]. Symbolic models based on program learning successfully explain rule-learning in many domains, but performance degrades quickly as program complexity increases. It remains unclear how to scale symbolic rule-learning methods to model human performance in challenging domains. This work shows that symbolic search over the space of metaprograms\u2014programs that revise programs\u2014dramatically improves learning efficiency. On a behavioral benchmark of 100 algorithmically rich rules, this approach fits human learning more accurately than alternative models while also using orders of magnitude less search. The computation required to match median human performance is consistent with conservative estimates of human thinking time. The results suggest that metaprogram-like representations may help human learners to efficiently acquire rules."}], "notes": []}, {"name": "Agi Cocosci \u2014 Problem Solving", "entries": [{"name": "Elements of a theory of human problem solving", "url": "https://psycnet.apa.org/record/1959-07883-001", "description": "***Psychological Review***, 1958. \\[[All Versions](https://scholar.google.com/scholar?cluster=6226995019045187501)]. Herbert Simon's original idea on human problem solving."}, {"name": "Human Problem Solving", "url": "https://psycnet.apa.org/record/1973-10478-000", "description": "***Englewood Cliffs, NJ: Prentice-hall***, 1972. \\[[All Versions](https://scholar.google.com/scholar?cluster=3996229083126262536\\&hl=en\\&as_sdt=0,5)]. Herbert Simon's classic idea of human problem solving as search."}, {"name": "Learning to Solve Problems: A Handbook for Designing Problem-Solving Learning Environments", "url": "http://196.223.158.148/bitstream/handle/123456789/2978/596.pdf?sequence=1\\&isAllowed=y", "description": "***Taylorfrancis***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=13262690779319271809\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Judgment under Uncertainty: Heuristics and Biases: Biases in judgments reveal some heuristics of thinking under uncertainty", "url": "https://www.science.org/doi/abs/10.1126/science.185.4157.1124", "description": "***Science***, 1974. \\[[All Versions](https://scholar.google.com/scholar?cluster=17040257859216791312\\&hl=en\\&as_sdt=0,5)]. Daniel Kahneman's classic idea of prospective theory."}, {"name": "Computational evidence for hierarchically structured reinforcement learning in humans", "url": "https://www.pnas.org/content/117/47/29381.short", "description": "***Proceedings of the National Academy of Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5731363475904675608\\&hl=en\\&as_sdt=0,5)]. A piece of evidence on hierarchical human planning."}, {"name": "Hierarchical reasoning by neural circuits in the frontal cortex", "url": "https://www.cnbc.cmu.edu/braingroup/papers/sarafyazd_jazayeri_2019.pdf", "description": "***Science***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=9875733886908769773\\&hl=en\\&as_sdt=0,5)]. Neuroscience evidence supporting rule switch."}, {"name": "The importance of mixed selectivity in complex cognitive tasks", "url": "https://oar.princeton.edu/rt4ds/file/11875/2161", "description": "***Nature***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=2707751672275136220\\&hl=en\\&as_sdt=0,5)]. The original paper introducing mixed selectivity with high-dimensional neural representations."}, {"name": "People construct simplified mental representations to plan", "url": "https://www.nature.com/articles/s41586-022-04743-9", "description": "***Nature***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=12068944400080889789\\&hl=en\\&as_sdt=0,5)]. A computational account on rational problem representation in human planning."}, {"name": "Goals, usefulness and abstraction in value-based choice", "url": "https://www.sciencedirect.com/science/article/pii/S1364661322002819", "description": "***Trends in Cognitive Sciences***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=6256990098976657651\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. A review that outlines the computational and biological principles that enable the brain to compute the usefulness of an option or action by creating abstractions that flexibly adapt to changing goals."}, {"name": "Value signals guide abstraction during learning", "url": "https://elifesciences.org/articles/68943", "description": "***eLife***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=10324834842795908439\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning to perceive and act by trial and error", "url": "https://link.springer.com/article/10.1007/BF00058926", "description": "***Machine Learning***, 1991. \\[[All Versions](https://scholar.google.com/scholar?cluster=1987606770603964473\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Representations in distributed cognitive tasks", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1207/s15516709cog1801_3", "description": "***Cognitive Science***, 1994. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=14781266698447195483)]."}, {"name": "The nature of external representations in problem solving", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0364021399800226", "description": "***Cognitive Science***, 1997. \\[[All Versions](https://scholar.google.com/scholar?cluster=10698887231200401430\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Rapid trail-and-error learning with simulation supports flexible tool use and physical reasoning.", "url": "https://www.pnas.org/content/pnas/117/47/29302.full.pdf", "description": "***Proceedings of the National Academy of Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=14400178089019636923)]. \\[[Project](https://sites.google.com/view/virtualtoolsgame/home)]. \\[[Appendix](https://www.pnas.org/content/pnas/suppl/2020/11/20/1912341117.DCSupplemental/pnas.1912341117.sapp.pdf)]. Many animals, and an increasing number of artificial agents, display sophisticated capabilities to perceive and manipulate objects. But human beings remain distinctive in their capacity for flexible, creative tool use\u2014using objects in new ways to act on the world, achieve a goal, or solve a problem. To study this type of general physical problem solving, this work introduces the Virtual Tools game. In this game, people solve a large range of challenging physical puzzles in just a handful of attempts. This work proposes that the flexibility of human physical problem solving rests on an ability to imagine the effects of hypothesized actions, while the efficiency of human search arises from rich action priors which are updated via observations of the world. The authors instantiate these components in the \u201csample, simulate, update\u201d (SSUP) model and show that it captures human performance across 30 levels of the Virtual Tools game. More broadly, this model provides a mechanism for explaining how people condense general physical knowledge into actionable, task-specific plans to achieve flexible and efficient physical problem solving."}, {"name": "Abstract strategy learning underlies flexible transfer in physical problem solving", "url": "https://cognitivesciencesociety.org/cogsci20/papers/0765/0765.pdf", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Abstract+strategy+learning+underlies+flexible+transfer+in+physical+problem+solving.\\&btnG=)]."}, {"name": "Physion: Evaluating Physical Prediction from Vision in Humans and Machines", "url": "https://openreview.net/forum?id=CXyZrKPz4CU", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=8733318111076645893\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Exploration: from machines to humans", "url": "https://www.sciencedirect.com/science/article/pii/S2352154620301236", "description": "***Current Opinion in Behavioral Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=8015078432419172621\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Balancing exploration and exploitation with information and randomization", "url": "https://www.sciencedirect.com/science/article/pii/S2352154620301467", "description": "***Current Opinion in Behavioral Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=8164388137243077863\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Hippocampal neurons construct a map of an abstract value space", "url": "https://www.sciencedirect.com/science/article/pii/S0092867421008369", "description": "***Cell***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=12658820581876003172\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Insightful problem solving and creative tool modification by captive nontool-using rooks", "url": "https://www.pnas.org/content/106/25/10370.short", "description": "***Proceedings of the National Academy of Sciences***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=6776471679661065229\\&hl=en\\&as_sdt=0,5)]. \\[[Supplementary Material](https://www.pnas.org/content/suppl/2009/05/28/0901008106.DCSupplemental)]. A piece of evidence on creative tool use in intelligent animals."}, {"name": "Learning to act by integrating mental simulations and physical experiments", "url": "https://cpilab.org/pubs/Dasgupta2018Learning.pdf", "description": "***CogSci'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=7342920174595829739\\&hl=en\\&as_sdt=0,5)]. \\[[Code (\u2b501)](https://github.com/ishita-dg/SimulationVSAction)]."}, {"name": "The successor representation in human reinforcement learning", "url": "https://gershmanlab.com/pubs/Momennejad17.pdf", "description": "***Nature Human Behavior***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=7317529612823134939\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Beyond imitation: Zero-shot task transfer on robots by learning concepts as cognitive programs", "url": "https://www.science.org/doi/abs/10.1126/scirobotics.aav3150", "description": "***Science Robotics***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7451223471302689228)]. Humans can infer concepts from image pairs and apply those in the physical world in a completely different setting, enabling tasks like IKEA assembly from diagrams. If robots could represent and infer high-level concepts, then it would notably improve their ability to understand our intent and to transfer tasks between different environments. To that end, the authors introduce a computational framework that replicates aspects of human concept learning. Concepts are represented as programs on a computer architecture consisting of a visual perception system, working memory, and action controller. The instruction set of this cognitive computer has commands for parsing a visual scene, directing gaze and attention, imagining new objects, manipulating the contents of a visual working memory, and controlling arm movement. Inferring a concept corresponds to inducing a program that can transform the input to the output. Some concepts require the use of imagination and recursion. Previously learned concepts simplify the learning of subsequent, more elaborate concepts and create a hierarchy of abstractions. The authors demonstrate how a robot can use these abstractions to interpret novel concepts presented to it as schematic images and then apply those concepts in very different situations. By bringing cognitive science ideas on mental imagery, perceptual symbols, embodied cognition, and deictic mechanisms into the realm of machine learning, this work brings researchers closer to the goal of building robots that have interpretable representations and common sense."}, {"name": "From Skills to Symbols: Learning Symbolic Representations for Abstract High-Level Planning", "url": "https://jair.org/index.php/jair/article/view/11175", "description": "***Journal of Artificial Intelligence Research***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=17962480659445514879)]. This work considers the problem of constructing abstract representations for planning in high-dimensional, continuous environments. The authors assume an agent equipped with a collection of high-level actions, and construct representations provably capable of evaluating plans composed of sequences of those actions. The authors first consider the deterministic planning case, and show that the relevant computation involves set operations performed over sets of states. The authors then consider probabilistic planning, which they show requires generalizing from sets of states to distributions over states. Finally, the authors apply these techniques to create a physical robot system that autonomously learns its own symbolic representation of a mobile manipulation task directly from sensorimotor data---point clouds, map locations, and joint angles---and then plans using that representation."}, {"name": "Integrated Task and Motion Planning", "url": "https://www.annualreviews.org/doi/abs/10.1146/annurev-control-091420-084139", "description": "***Annual Review of Control, Robotics, and Autonomous Systems***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=478421650694199529)]. The problem of planning for a robot that operates in environments containing a large number of objects, taking actions to move itself through the world as well as to change the state of the objects, is known as task and motion planning (TAMP). TAMP problems contain elements of discrete task planning, discrete\u2013continuous mathematical programming, and continuous motion planning and thus cannot be effectively addressed by any of these fields directly. In this article, the authors define a class of TAMP problems and survey algorithms for solving them, characterizing the solution methods in terms of their strategies for solving the continuous-space subproblems and their techniques for integrating the discrete and continuous components of the search."}, {"name": "Differentiable Physics and Stable Modes for Tool-Use and Manipulation Planning", "url": "https://dspace.mit.edu/handle/1721.1/126626", "description": "***Robotics: Science and Systems***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=10342169019935480143\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning to act by integrating mental simulations and physical experiments", "url": "https://gershmanlab.com/pubs/Dasgupta18_simulation.pdf", "description": "***CogSci'21***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=7342920174595829739\\&hl=en\\&as_sdt=0,5)]."}, {"name": "What Is the Model in Model-Based Planning?", "url": "https://onlinelibrary.wiley.com/doi/ftr/10.1111/cogs.12928", "description": "***Cognitive Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=10598397017491369972\\&hl=en\\&scisbd=1\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Discovering State and Action Abstractions for Generalized Task and Motion Planning", "url": "https://arxiv.org/pdf/2109.11082.pdf", "description": "***AAAI'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=1054368060554971920)]."}, {"name": "Intrinsically Motivated Reinforcement Learning", "url": "https://proceedings.neurips.cc/paper/2004/hash/4be5a36cbaca8ab9d2066debfe4e65c1-Abstract.html", "description": "***NeurIPS'04***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=9736217847061704054\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on intrinsic reward functions in classic reinforcement learning."}, {"name": "What is intrinsic motivation? A typology of computational approaches", "url": "https://www.frontiersin.org/articles/10.3389/neuro.12.006.2007/full", "description": "***Frontiers in Neurorobotics***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=11901343819872275353\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Adapting Behavior via Intrinsic Reward: A Survey and Empirical Study", "url": "https://www.jair.org/index.php/jair/article/view/12087", "description": "***Journal of Artificial Intelligence Research***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5309595875334344707\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Curiosity-driven Exploration by Self-supervised Prediction", "url": "https://proceedings.mlr.press/v70/pathak17a.html", "description": "***ICML'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=9379743003299559904\\&hl=en\\&as_sdt=0,5)]. The original paper on curiosity as intrinsic motivation."}, {"name": "UCB Exploration via Q-Ensembles", "url": "https://arxiv.org/abs/1706.01502", "description": "2017. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=13260404166621290240)]."}, {"name": "Causal Curiosity: RL Agents Discovering Self-supervised Experiments for Causal Representation Learning", "url": "https://arxiv.org/abs/2010.03110", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=4880520597219138666\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Variational Information Maximisation for Intrinsically Motivated Reinforcement Learning", "url": "https://proceedings.neurips.cc/paper/2015/hash/e00406144c1e7e35240afed70f34166a-Abstract.html", "description": "***NeurIPS'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=9262504233068870193\\&hl=en\\&as_sdt=0,5)]. The original paper on empowerment as intrinsic motivation."}, {"name": "Intrinsic Exploration as Empowerment in a Richly Structured Online Game", "url": "https://psyarxiv.com/ybs7g/", "description": "2022. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=12321757821600526668)]."}, {"name": "Multi-task reinforcement learning in humans", "url": "https://gershmanlab.com/pubs/Tomov21.pdf", "description": "***Nature Human Behavior***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=14589018692074515644\\&hl=en\\&as_sdt=0,5)]."}, {"name": "JARVIS-1: Open-World Multi-Task Agents With Memory-Augmented Multimodal Language Models", "url": "https://ieeexplore.ieee.org/abstract/document/10778628", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***. \\[[All Versions](https://scholar.google.com/scholar?cluster=12845806504666245406)]. Achieving human-like planning and control with multimodal observations in an open world is a key milestone for more functional generalist agents. Existing approaches can handle certain long-horizon tasks in an open world. However, they still struggle when the number of open-world tasks could potentially be infinite and lack the capability to progressively enhance task completion as game time progresses. This work introduces JARVIS-1, an open-world agent that can perceive multimodal input (visual observations and human instructions), generate sophisticated plans, and perform embodied control, all within the popular yet challenging open-world Minecraft universe. Specifically, the authors develop JARVIS-1 on top of pre-trained multimodal language models, which map visual observations and textual instructions to plans. The plans will be ultimately dispatched to the goal-conditioned controllers. JARVIS-1 is outfitted with a multimodal memory, which facilitates planning using both pre-trained knowledge and its actual game survival experiences. JARVIS-1 is the existing most general agent in Minecraft, capable of completing over 200 different tasks using control and observation space similar to humans."}, {"name": "Reinforcement learning: An introduction", "url": "https://www.andrew.cmu.edu/user/rmorina/papers/SuttonBook.pdf", "description": "***MIT Press***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=8821915215029978039\\&hl=en\\&as_sdt=0,5)]. Richard Sutton's comprehensive book on reinforcement learning."}, {"name": "Reinforcement learning: A survey", "url": "https://www.jair.org/index.php/jair/article/view/10166", "description": "***Journal of Artificial Intelligence Research***, 1996. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=4983604491168613713)]. Leslie Kaelbling's review on reinforcement learning."}, {"name": "An overview of multi-agent reinforcement learning from game theoretical perspective", "url": "https://arxiv.org/pdf/2011.00583.pdf", "description": "2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16197919002723407603\\&hl=en\\&as_sdt=0,5)]. Yaodong Yang's review on multi-agent reinforcement learning from the perspective of game theory."}, {"name": "Human-level control through deep reinforcement learning", "url": "https://klab.tch.harvard.edu/academia/classes/Neuro230/ReadingAssignments/MnihEtAlHassibis15NatureControlDeepRL.pdf", "description": "***Nature***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=12439121588427761338\\&hl=en\\&as_sdt=0,5)]. The original paper on solving Atari games via Deep Q-Network."}, {"name": "Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning", "url": "https://www.sciencedirect.com/science/article/pii/S0004370299000521", "description": "***Artificial Intelligence***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=1471968208408231068\\&hl=en\\&as_sdt=0,5)]. The original paper on operation reinforcement learning."}, {"name": "On Monte Carlo Tree Search and Reinforcement Learning", "url": "http://oucsace.cs.ohio.edu/~chelberg/classes/680/paperPresentations/NathanPaperToPresent.pdf", "description": "***Journal of Artificial Intelligence Research***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=5805718077259491860\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Review", "url": "https://arxiv.org/abs/1805.00909", "description": "2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=16437288987337534404\\&hl=en\\&as_sdt=0,5)]. \\[[Slides](http://rail.eecs.berkeley.edu/deeprlcourse-fa18/static/slides/lec-15.pdf)]. Sergey Levine's tutorial on treating reinforcement learning probabilisticly."}, {"name": "A Generalized Algorithm for Multi-Objective Reinforcement Learning and Policy Adaptation", "url": "https://proceedings.neurips.cc/paper/2019/hash/4a46fbfca3f1465a27b210f4bdfe6ab3-Abstract.html", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7721047641895252765\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Solving Compositional Reinforcement Learning Problems via Task Reduction", "url": "https://openreview.net/forum?id=9SS69KwomAM", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15628616147808752058\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Neural Task Programming: Learning to Generalize Across Hierarchical Tasks", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=8460689", "description": "***ICRA'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=7155333517647976638\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning to act: qualitative learning of deterministic action models", "url": "https://academic.oup.com/logcom/article-abstract/28/2/337/4695480", "description": "***Journal of Logic and Computation***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=14570482854600886953\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning to Act and Observe in Partially Observable Domains", "url": "https://arxiv.org/abs/2109.06076", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=2258600434630687063\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Why Generalization in RL is Difficult: Epistemic POMDPs and Implicit Partial Observability", "url": "https://arxiv.org/abs/2107.06277", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9640851185758072663\\&hl=en\\&as_sdt=0,5)]. A formal treatment on the generalization problem in reinforcement learning."}, {"name": "Learning to Perform Physics Experiments via Deep Reinforcement Learning", "url": "https://openreview.net/forum?id=r1nTpv9eg", "description": "***ICLR'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=13142558595749186250\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Data-Efficient Learning for Complex and Real-Time Physical Problem Solving Using Augmented Simulation", "url": "https://ieeexplore.ieee.org/abstract/document/9387127", "description": "***Robotics and Automation Letters***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=3140653562829320759\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A Survey of Preference-Based Reinforcement Learning Methods", "url": "https://www.jmlr.org/papers/volume18/16-634/16-634.pdf", "description": "***Journal of Machine Learning Research***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=13278778479251450967\\&hl=en\\&as_sdt=0,5)]."}, {"name": "On the Expressivity of Markov Reward", "url": "https://papers.NeurIPS.cc/paper/2021/file/4079016d940210b4ae9ae7d41c4a2065-Paper.pdf", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=4524686816939437211\\&hl=en\\&as_sdt=0,5)]. A formal treatment of tasks and rewards in reinforcement learning modeling."}, {"name": "Trust Region Policy Optimization", "url": "https://proceedings.mlr.press/v37/schulman15.html", "description": "***ICML'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=4215501129336400677\\&hl=en\\&as_sdt=0,5)]. The original paper introducing TRPO, a method for optimizing control policies, with guaranteed monotonic improvement."}, {"name": "Constrained Policy Optimization", "url": "http://proceedings.mlr.press/v70/achiam17a/achiam17a.pdf", "description": "***ICML'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=6114366704163518185\\&hl=en\\&as_sdt=0,5)]. The original paper on constrained reinforcement learning (safe reinforcement learning)."}, {"name": "When to Trust Your Model: Model-Based Policy Optimization", "url": "https://proceedings.neurips.cc/paper_files/paper/2019/hash/5faf461eff3099671ad63c6f3f094f7f-Abstract.html", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4248859125840907707\\&hl=en\\&as_sdt=0,5)]. \\[[Post](https://bair.berkeley.edu/blog/2019/12/12/mbpo/)]."}, {"name": "SUNRISE: A Simple Unified Framework for Ensemble Learning in Deep Reinforcement Learning", "url": "http://proceedings.mlr.press/v139/lee21g.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=8840831494454574191\\&hl=en\\&as_sdt=0,5)]. \\[[Code (\u2b50131)](https://github.com/pokaxpoka/sunrise)]."}, {"name": "The Quest for a Common Model of the Intelligent Decision Maker", "url": "https://arxiv.org/abs/2202.13252", "description": "***Multi-disciplinary Conference on Reinforcement Learning and Decision Making'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=7652784232757502910\\&hl=en\\&as_sdt=0,5)]. Richard Sutton's perspective on the future directions of reinforcement learning research."}, {"name": "Automatic curriculum learning for deep RL: a short survey", "url": "https://dl.acm.org/doi/abs/10.5555/3491440.3492111", "description": "***IJCAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=10660055557098312214\\&hl=en\\&as_sdt=0,5)]."}, {"name": "TeachMyAgent: a Benchmark for Automatic Curriculum Learning in Deep RL", "url": "http://proceedings.mlr.press/v139/romac21a.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=11016662361926634008\\&hl=en\\&as_sdt=0,5)]. \\[[Project (\u2b5076)](https://github.com/flowersteam/TeachMyAgent)]."}, {"name": "Apprenticeship Learning via Inverse Reinforcement Learning", "url": "https://dl.acm.org/doi/pdf/10.1145/1015330.1015430", "description": "***ICML'04***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=10260011060619377707\\&hl=en\\&as_sdt=0,5)]. Pieter Abbeel and Andrew Ng's original paper on inverse reinforcement learning (IRL)."}, {"name": "Bayesian Inverse Reinforcement Learning", "url": "https://www.ijcai.org/Proceedings/07/Papers/416.pdf", "description": "***IJCAI'07***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=4154724070362583557\\&hl=en\\&as_sdt=0,5)]. A Bayesian account on classic inverse reinforcement learning."}, {"name": "From Language to Goals: Inverse Reinforcement Learning for Vision-Based Instruction Following", "url": "https://arxiv.org/abs/1902.07742", "description": "***ICLR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=9128320307925997063\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Few-shot Bayesian imitation learning with logical program policies.", "url": "https://arxiv.org/pdf/1904.06317.pdf", "description": "***AAAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5103854692762145813\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Generalized Inverse Planning: Learning Lifted non-Markovian Utility for Generalizable Task Representation", "url": "http://export.arxiv.org/pdf/2011.09854", "description": "2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=18369106870663956780\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Inverse Constrained Reinforcement Learning", "url": "https://proceedings.mlr.press/v139/malik21a.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Inverse+Constrained+Reinforcement+Learning+S+Malik\\&btnG=)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 System 1 & System 2", "entries": [{"name": "Mental Representations: A Dual Coding Approach", "url": "https://zh.pb1lib.org/book/1004349/825277", "description": "***Oxford University Press***, 1990. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0,5\\&q=mental+representations:+a+dual+coding+approach)]. The original book on dual coding theory, in the neuroscience account of mental representation."}, {"name": "Dual coding of knowledge in the human brain", "url": "https://www.sciencedirect.com/science/article/pii/S1364661321001765", "description": "***Trends in Cognitive Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=11751507203561842501\\&hl=en\\&as_sdt=0,5)]. Yanchao Bi's review on neuroscience experiments on dual coding theory."}, {"name": "Two Forms of Knowledge Representations in the Human Brain", "url": "https://www.sciencedirect.com/science/article/pii/S0896627320302798", "description": "***Neuron***, 2020. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=16941965185680116049)]. Illustrating language-derived and sensory-derived knowledge."}, {"name": "Organizational Principles of Abstract Words in the Human Brain", "url": "http://bilab.bnu.edu.cn/paper/2018/Wang_2018_Cerebral_Cortex.pdf", "description": "***Cerebral Cortex***, 2018. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=15272192531353715481)]."}, {"name": "Different computational relations in language are captured by distinct brain systems", "url": "http://bilab.bnu.edu.cn/paper/2022/Fu_2022_CC.pdf", "description": "***Cerebral Cortex***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=720215181903530260\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Deese-Roediger-McDermott (DRM) task: A simple cognitive paradigm to investigate false memories in the laboratory", "url": "https://europepmc.org/article/med/28190038", "description": "***Journal of Visualized Experiments***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=10880194606861797581\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A continuous semantic space describes the representation of thousands of object and action categories across the human brain", "url": "https://mri-q.com/uploads/3/4/5/7/34572113/gallant_piis0896627312009348.pdf", "description": "***Neuron***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=10348115268396987731\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Rational arbitration between statistics and rules in human sequence processing", "url": "https://www.nature.com/articles/s41562-021-01259-6", "description": "***Nature Human Behavior***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=9856085207409198966\\&hl=en\\&as_sdt=0,5)]."}, {"name": "How large language models need symbolism", "url": "https://academic.oup.com/nsr/article/12/10/nwaf339/8237444", "description": "***National Science Review***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=9866048591424428891)]. Advances in artificial intelligence (AI), particularly large language models (LLMs), have achieved remarkable success. This progress stems from \u2018scaling laws\u2019---performance improves with greater computation, data and model size. However, this paradigm has a crucial vulnerability: scaling laws are effective only when data are abundant. A foundational process for this is the human ability of \u2018quotienting\u2019: creating a compact symbolic space from a vast problem space, in a process akin to forming a mathematical quotient space via equivalence classes. The new strategy uses symbols as vessels for compressed human wisdom, creating maps that guide the powerful statistical intuition of LLMs, which is especially critical for tackling complex problems where usable data are, by nature, sparse. The next frontier for AI will not be conquered by scaling alone. The art of symbolization itself\u2014the crafting of powerful abstractions\u2014is therefore the central task ahead. If scaling laws have given models their powerful intuition, it is the art of the symbol that will provide the compass for genuine discovery."}, {"name": "Regression Analysis for Interval-Valued Data", "url": "https://link.springer.com/chapter/10.1007/978-3-642-59789-3_58", "description": "***Data Analysis, Classification, and Related Methods***, 2000. \\[[All Versions](https://scholar.google.com/scholar?cluster=9407097855380377791\\&hl=en\\&as_sdt=0,5)]. The original paper on symbolic regression."}, {"name": "Symbolic data analysis: what is it?", "url": "https://link.springer.com/chapter/10.1007/978-3-7908-1709-6_20", "description": "***Proceedings in Computational Statistics***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=3730437602749399283\\&hl=en\\&as_sdt=0,5)]."}, {"name": "DeepProbLog: Neural Probabilistic Logic Programming", "url": "https://arxiv.org/abs/1805.10872", "description": "***NeurIPS'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=6079567413300944995\\&hl=en\\&as_sdt=0,5)]. The original paper on neuro-symbolic probabilistic programming."}, {"name": "Learning Explanatory Rules from Noisy Data", "url": "https://www.jair.org/index.php/jair/article/view/11172", "description": "***Journal of Artificial Intelligence Research***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=2553893814364678772\\&hl=en\\&as_sdt=0,5)]. The original paper for differential Inductive Logic Programming."}, {"name": "Combining Logical Abduction and Statistical Induction: Discovering Written Primitives with Human Knowledge", "url": "https://cs.nju.edu.cn/zhouzh/zhouzh.files/publication/aaai17lasin.pdf", "description": "***AAAI'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=14477085725208589393\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Neural Logic Reinforcement Learning", "url": "https://arxiv.org/pdf/1904.10729.pdf", "description": "***ICML'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=18074632043038701502\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Bridging Machine Learning and Logical Reasoning by Abductive Learning.", "url": "http://papers.NeurIPS.cc/paper/8548-bridging-machine-learning-and-logical-reasoning-by-abductive-learning", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=1518342375288126288\\&hl=en\\&as_sdt=0,5)]. \\[[Slides](https://daiwz.net/org/slides/ABL-meetup.html#/slide-title)]. \\[[Code (\u2b50100)](https://github.com/AbductiveLearning/ABL-HED)]. The original paper on Abductive Learning, a derivative-free approach for neuro-symbolic learning."}, {"name": "Abductive learning: towards bridging machine learning and logical reasoning", "url": "https://link.springer.com/article/10.1007/s11432-018-9801-4", "description": "***Science China Information Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=8541635351775190855\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Abductive Knowledge Induction From Raw Data", "url": "https://arxiv.org/pdf/2010.03514.pdf", "description": "***IJCAI'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=7027142960863064076\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Fast Abductive Learning by Similarity-based Consistency Optimization", "url": "https://proceedings.neurips.cc/paper/2021/hash/df7e148cabfd9b608090fa5ee3348bfe-Abstract.html", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=8539963460239876225\\&hl=en\\&as_sdt=0,5)]. An approach for accelerating the convergence of Abductive Learning."}, {"name": "Learning by Abstraction: The Neural State Machine", "url": "https://proceedings.neurips.cc/paper/2019/file/c20a7ce2a627ba838cfbff082db35197-Paper.pdf", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7361406080192630148\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Making sense of sensory input", "url": "https://www.sciencedirect.com/science/article/pii/S0004370220301855", "description": "***Artificial Intelligence***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=11875529139573472578\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Abstract Spatial-Temporal Reasoning via Probabilistic Abduction and Execution", "url": "https://arxiv.org/pdf/2103.14230v1.pdf", "description": "***CVPR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=4172146500538799638\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learn to explain ef\ufb01ciently via neural logic inductive learning", "url": "https://openreview.net/pdf?id=SJlh8CEYDB", "description": "***ICLR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=4550874980727321525\\&hl=en\\&as_sdt=0,5)]. \\[[Project (\u2b5044)](https://github.com/gblackout/NLIL)]."}, {"name": "Closed Loop Neural-Symbolic Learning via Integrating Neural Perception, Grammar Parsing, and Symbolic Reasoning", "url": "https://arxiv.org/abs/2006.06649", "description": "***ICML'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9257372000778020812\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Generating new concepts with hybrid neuro-symbolic models.", "url": "https://arxiv.org/abs/2003.08978", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=1912020791698331044)]."}, {"name": "Learning Task-General Representations with Generative Neuro-Symbolic Modeling", "url": "https://arxiv.org/abs/2006.14448", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=1335404082385789329)]."}, {"name": "Hybrid computing using a neural network with dynamic external memory", "url": "http://clgiles.ist.psu.edu/IST597/materials/slides/papers-memory/2016-graves.pdf", "description": "***Nature***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=8100274942961380405\\&hl=en\\&as_sdt=0,5)]."}, {"name": "AI Feynman: A physics-inspired method for symbolic regression", "url": "https://www.science.org/doi/full/10.1126/sciadv.aay2631", "description": "***Science Advances***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=3655502646441210453)]. A core challenge for both physics and artificial intelligence (AI) is symbolic regression: finding a symbolic expression that matches data from an unknown function. Although this problem is likely to be NP-hard in principle, functions of practical interest often exhibit symmetries, separability, compositionality, and other simplifying properties. In this spirit, the authors develop a recursive multidimensional symbolic regression algorithm that combines neural network fitting with a suite of physics-inspired techniques. The authors apply it to 100 equations from the Feynman Lectures on Physics, and it discovers all of them, while previous publicly available software cracks only 71; for a more difficult physics-based test set, this work improves the state-of-the-art success rate from 15 to 90%."}, {"name": "Classification-by-Components: Probabilistic Modeling of Reasoning over a Set of Components", "url": "http://papers.NeurIPS.cc/paper/8546-classification-by-components-probabilistic-modeling-of-reasoning-over-a-set-of-components.pdf", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=12691103404451941071\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Neuro-Symbolic Visual Reasoning: Disentangling \u201cVisual\u201d from \u201cReasoning\u201d", "url": "https://arxiv.org/pdf/2006.11524.pdf", "description": "***ICML'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=13160160974887139307\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Understanding Deep Architectures with Reasoning Layer", "url": "https://proceedings.neurips.cc/paper/2020/file/0d82627e10660af39ea7eb69c3568955-Paper.pdf", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=937882599430270789\\&hl=en\\&as_sdt=0,5)]."}, {"name": "An Explicitly Relational Neural Network Architecture", "url": "https://arxiv.org/pdf/1905.10307.pdf", "description": "***ICML'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=37732747764322837\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Neural Production Systems", "url": "https://arxiv.org/pdf/2103.01937.pdf", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15299280949648915581\\&hl=en\\&as_sdt=0,5)]. Yoshua Bengio's perspective on slot attention model as a general production system."}, {"name": "Compositional Generalization via Neural-Symbolic Stack Machines", "url": "https://arxiv.org/pdf/2008.06662.pdf", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=15612498612943317331\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Stochastic Optimization of Sorting Networks via Continuous Relaxations", "url": "https://openreview.net/pdf?id=H1eSS3CcKX", "description": "***ICLR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=10619362619006891050\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Program Guided Agent", "url": "https://openreview.net/pdf?id=BkxUvnEYDH", "description": "***ICLR'20***, 2020. \\[[All Versions](https://openreview.net/forum?id=BkxUvnEYDH)]."}, {"name": "Learning Compositional Rules via Neural Program Synthesis", "url": "https://proceedings.neurips.cc/paper/2020/hash/7a685d9edd95508471a9d3d6fcace432-Abstract.html", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=3160670555314650508\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Discovering Symbolic Models from Deep Learning with Inductive Biases", "url": "https://arxiv.org/abs/2006.11287", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9452091824686227240\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Neural Logic Machines", "url": "https://arxiv.org/pdf/1904.11694.pdf", "description": "***ICLR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4525183211642569463\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervision", "url": "https://arxiv.org/pdf/1904.12584.pdf", "description": "***ICLR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=8837128214653317831\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Visual Concept-Metaconcept Learning", "url": "https://papers.NeurIPS.cc/paper/2019/file/98d8a23fd60826a2a474c5b4f5811707-Paper.pdf", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=1888051343232298875\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Grounding Physical Concepts of Objects and Events Through Dynamic Visual Reasoning", "url": "https://arxiv.org/abs/2103.16564", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=16735976343684307244\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Temporal and Object Quantification Networks", "url": "https://jiajunwu.com/papers/toqnet_ijcai.pdf", "description": "***IJCAI'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=17251222943638414124\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Grounded Language Learning Fast and Slow", "url": "https://arxiv.org/pdf/2009.01719.pdf", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=17735027444431750346\\&hl=en\\&as_sdt=0,5)]. \\[[Project (\u2b5054)](https://github.com/deepmind/dm_fast_mapping?s=05)]."}, {"name": "Detect, Understand, Act: A Neuro-symbolic Hierarchical Reinforcement Learning Framework", "url": "https://link.springer.com/article/10.1007/s10994-022-06142-7", "description": "***Machine Learning***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=10321228117236432485\\&hl=en\\&as_sdt=0,5)]. A neuro-symbolic framework that integrates meta-policy learning in inductive logic programming."}, {"name": "Visual Programming: Compositional Visual Reasoning Without Training", "url": "https://openaccess.thecvf.com/content/CVPR2023/html/Gupta_Visual_Programming_Compositional_Visual_Reasoning_Without_Training_CVPR_2023_paper.html", "description": "***CVPR'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=16156060658942400125\\&hl=en\\&as_sdt=0,5)]. VISPROG, a neuro-symbolic approach to solving complex and compositional visual tasks given natural language instructions, using the in-context learning ability of large language models to generate python-like modular programs, which are then executed to get both the solution and a comprehensive and interpretable rationale."}, {"name": "Semi-Supervised Abductive Learning and Its Application to Theft Judicial Sentencing", "url": "https://ieeexplore.ieee.org/abstract/document/9338352", "description": "***ICDM'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16646246740380524224)]. \\[[Preprint](https://www.lamda.nju.edu.cn/huangyx/src/ICDM20-SSABL.pdf)]. In many practical tasks, there are usually two kinds of common information: cheap unlabeled data and domain knowledge in the form of symbols. There are some attempts using one single information source, such as semi-supervised learning and abductive learning. However, there is little work to use these two kinds of information sources at the same time, because it is very difficult to combine symbolic logical representation and numerical model optimization effectively. The learning becomes even more challenging when the domain knowledge is insufficient. This paper presents an attempt-Semi-Supervised ABductive Learning (SS-ABL) framework. In this framework, semi-supervised learning is trained via pseudo labels of unlabeled data generated by abductive learning, and the background knowledge is refined via the label distribution predicted by semi-supervised learning. The above framework can be optimized iteratively and can be naturally interpretable. The effectiveness of the framework has been fully verified in the theft judicial sentencing of real legal documents. In the case of missing sentencing elements and mixed legal rules, the framework is apparently superior to many existing baseline practices, and provides explanatory assistance to judicial sentencing."}], "notes": []}, {"name": "Agi Cocosci \u2014 Explainability", "entries": [{"name": "Bayesian modeling of human\u2013AI complementarity", "url": "https://www.pnas.org/doi/full/10.1073/pnas.2111547119", "description": "***Proceedings of the National Academy of Sciences***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=15735143859968841009\\&hl=en\\&as_sdt=0,5)]. A Bayesian framework for combining the predictions and different types of confidence scores from humans and machines."}, {"name": "A tale of two explanations: Enhancing human trust by explaining robot behavior", "url": "https://www.science.org/doi/10.1126/scirobotics.aay4663", "description": "***Science Robotics***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=3985046411399524590)]. \\[[Preprint](https://yzhu.io/publication/openbottle2019scirob/paper.pdf)]. The ability to provide comprehensive explanations of chosen actions is a hallmark of intelligence. Lack of this ability impedes the general acceptance of AI and robot systems in critical tasks. This paper examines what forms of explanations best foster human trust in machines and proposes a framework in which explanations are generated from both functional and mechanistic perspectives. The robot system learns from human demonstrations to open medicine bottles using (i) an embodied haptic prediction model to extract knowledge from sensory feedback, (ii) a stochastic grammar model induced to capture the compositional structure of a multistep task, and (iii) an improved Earley parsing algorithm to jointly leverage both the haptic and grammar models. The robot system not only shows the ability to learn from human demonstrators but also succeeds in opening new, unseen bottles. Using different forms of explanations generated by the robot system, we conducted a psychological experiment to examine what forms of explanations best foster human trust in the robot. The authors found that comprehensive and real-time visualizations of the robot\u2019s internal decisions were more effective in promoting human trust than explanations based on summary text descriptions. In addition, forms of explanation that are best suited to foster trust do not necessarily correspond to the model components contributing to the best task performance. This divergence shows a need for the robotics community to integrate model components to enhance both task execution and human trust in machines."}, {"name": "X-ToM: Explaining with Theory-of-Mind for Gaining Justified Human Trust", "url": "https://arxiv.org/abs/1909.06907", "description": "***CVPR XAI Workshop'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7751326666821697923)]. This work presents a new explainable AI (XAI) framework aimed at increasing justified human trust and reliance in the AI machine through explanations. The authors pose explanation as an iterative communication process, i.e. dialog, between the machine and human user. More concretely, the machine generates sequence of explanations in a dialog which takes into account three important aspects at each dialog turn: (a) human's intention (or curiosity); (b) human's understanding of the machine; and (c) machine's understanding of the human user. To do this, the authors use Theory of Mind (ToM) which helps us in explicitly modeling human's intention, machine's mind as inferred by the human as well as human's mind as inferred by the machine. In other words, these explicit mental representations in ToM are incorporated to learn an optimal explanation policy that takes into account human's perception and beliefs. Furthermore, the authors also show that ToM facilitates in quantitatively measuring justified human trust in the machine by comparing all the three mental representations."}, {"name": "CoCoX: Generating Conceptual and Counterfactual Explanations via Fault-Lines", "url": "https://ojs.aaai.org/index.php/AAAI/article/view/5643", "description": "***AAAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=17443137068166403183\\&hl=en\\&as_sdt=0,5)]."}, {"name": "CX-ToM: Counterfactual explanations with theory-of-mind for enhancing human trust in image recognition models", "url": "https://www.sciencedirect.com/science/article/pii/S2589004221015510", "description": "***iScience***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=17526041764295337444)]. This work proposes CX-ToM, short for counterfactual explanations with theory-of-mind, a new explainable AI (XAI) framework for explaining decisions made by a deep convolutional neural network (CNN). In contrast to the current methods in XAI that generate explanations as a single shot response, the authors pose explanation as an iterative communication process, i.e., dialogue between the machine and human user. More concretely, this CX-ToM framework generates a sequence of explanations in a dialogue by mediating the differences between the minds of the machine and human user. To do this, the authors use Theory of Mind (ToM) which helps us in explicitly modeling the human\u2019s intention, the machine\u2019s mind as inferred by the human, as well as human's mind as inferred by the machine. Moreover, most state-of-the-art XAI frameworks provide attention (or heat map) based explanations. In this work, the authors show that these attention-based explanations are not sufficient for increasing human trust in the underlying CNN model. In CX-ToM, the authors instead use counterfactual explanations called fault-lines which are defined as follows: given an input image I for which a CNN classification model M predicts class cpred, a fault-line identifies the minimal semantic-level features (e.g., stripes on zebra), referred to as explainable concepts, that need to be added to or deleted from I to alter the classification category of I by M to another specified class calt. Extensive experiments verify the hypotheses, demonstrating that CX-ToM significantly outperforms the state-of-the-art XAI models."}, {"name": "Explaining machine learning models with interactive natural language conversations using TalkToModel", "url": "https://www.nature.com/articles/s42256-023-00692-8", "description": "***Nature Machine Intelligence***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=7044008493489695982)]. Practitioners increasingly use machine learning (ML) models, yet models have become more complex and harder to understand. To understand complex models, researchers have proposed techniques to explain model predictions. However, practitioners struggle to use explainability methods because they do not know which explanation to choose and how to interpret the explanation. This work addresses the challenge of using explainability methods by proposing TalkToModel: an interactive dialogue system that explains ML models through natural language conversations. TalkToModel consists of three components: an adaptive dialogue engine that interprets natural language and generates meaningful responses; an execution component that constructs the explanations used in the conversation; and a conversational interface. In real-world evaluations, 73% of healthcare workers agreed they would use TalkToModel over existing systems for understanding a disease prediction model, and 85% of ML professionals agreed TalkToModel was easier to use, demonstrating that TalkToModel is highly effective for model explainability."}, {"name": "Ultra-Strong Machine Learning: comprehensibility of programs learned with ILP", "url": "https://link.springer.com/article/10.1007/s10994-018-5707-3", "description": "***Machine Learning***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=17551060457946144913)]. During the 1980s Michie defined Machine Learning in terms of two orthogonal axes of performance: predictive accuracy and comprehensibility of generated hypotheses. Since predictive accuracy was readily measurable and comprehensibility not so, later definitions in the 1990s, such as Mitchell\u2019s, tended to use a one-dimensional approach to Machine Learning based solely on predictive accuracy, ultimately favouring statistical over symbolic Machine Learning approaches. In this paper the authors provide a definition of comprehensibility of hypotheses which can be estimated using human participant trials. The authors present two sets of experiments testing human comprehensibility of logic programs. In the first experiment we test human comprehensibility with and without predicate invention. Results indicate comprehensibility is affected not only by the complexity of the presented program but also by the existence of anonymous predicate symbols. In the second experiment the authors directly test whether any state-of-the-art ILP systems are ultra-strong learners in Michie\u2019s sense, and select the Metagol system for use in humans trials. Results show participants were not able to learn the relational concept on their own from a set of examples but they were able to apply the relational definition provided by the ILP system correctly. This implies the existence of a class of relational concepts which are hard to acquire for humans, though easy to understand given an abstract explanation. The authors believe improved understanding of this class could have potential relevance to contexts involving human learning, teaching and verbal interaction."}, {"name": "Beneficial and harmful explanatory machine learning", "url": "https://link.springer.com/article/10.1007%2Fs10994-020-05941-0", "description": "***Machine Learning***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=16983722694047294963)]. Given the recent successes of Deep Learning in AI there has been increased interest in the role and need for explanations in machine learned theories. A distinct notion in this context is that of Michie\u2019s definition of ultra-strong machine learning (USML). USML is demonstrated by a measurable increase in human performance of a task following provision to the human of a symbolic machine learned theory for task performance. A recent paper demonstrates the beneficial effect of a machine learned logic theory for a classification task, yet no existing work has examined the potential harmfulness of machine\u2019s involvement for human comprehension during learning. This paper investigates the explanatory effects of a machine learned theory in the context of simple two person games and proposes a framework for identifying the harmfulness of machine explanations based on the Cognitive Science literature. The approach involves a cognitive window consisting of two quantifiable bounds and it is supported by empirical evidence collected from human trials. The quantitative and qualitative results indicate that human learning aided by a symbolic machine learned theory which satisfies a cognitive window has achieved significantly higher performance than human self learning. Results also demonstrate that human learning aided by a symbolic machine learned theory that fails to satisfy this window leads to significantly worse performance than unaided human learning."}, {"name": "Deep Forest: Towards An Alternative to Deep Neural Networks", "url": "https://www.ijcai.org/Proceedings/2017/497", "description": "***IJCAI'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=7391596872731517007)]. \\[[Project (\u2b50962)](https://github.com/LAMDA-NJU/Deep-Forest)]. This paper proposes gcForest, a decision tree ensemble approach with performance highly competitive to deep neural networks in a broad range of tasks. In contrast to deep neural networks which require great effort in hyper-parameter tuning, gcForest is much easier to train; even when it is applied to different data across different domains in the experiments, excellent performance can be achieved by almost same settings of hyper-parameters. The training process of gcForest is efficient, and users can control training cost according to computational resource available. The efficiency may be further enhanced because gcForest is naturally apt to parallel implementation. Furthermore, in contrast to deep neural networks which require large-scale training data, gcForest can work well even when there are only small-scale training data."}, {"name": "NBDT: Neural-Backed Decision Trees", "url": "https://openreview.net/forum?id=mCLVeEpplNE", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1902399007162005819)]. \\[[Code (\u2b50624)](https://github.com/alvinwan/neural-backed-decision-trees)]. Machine learning applications such as finance and medicine demand accurate and justifiable predictions, barring most deep learning methods from use. In response, previous work combines decision trees with deep learning, yielding models that (1) sacrifice interpretability for accuracy or (2) sacrifice accuracy for interpretability. This work forgoes this dilemma by jointly improving accuracy and interpretability using Neural-Backed Decision Trees (NBDTs). NBDTs replace a neural network's final linear layer with a differentiable sequence of decisions and a surrogate loss. This forces the model to learn high-level concepts and lessens reliance on highly-uncertain decisions, yielding (1) accuracy: NBDTs match or outperform modern neural networks on CIFAR, ImageNet and better generalize to unseen classes by up to 16%. Furthermore, the surrogate loss improves the original model's accuracy by up to 2%. NBDTs also afford (2) interpretability: improving human trustby clearly identifying model mistakes and assisting in dataset debugging."}, {"name": "pytorch-grad-cam", "url": "https://github.com/jacobgil/pytorch-grad-cam", "description": "2021. Class Activation Map methods implemented in Pytorch, with many elegant features.", "stars": "13k"}, {"name": "Network dissection: Quantifying interpretability of deep visual representations", "url": "https://ieeexplore.ieee.org/document/8099837", "description": "***CVPR'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=18069685615852396783\\&hl=en\\&as_sdt=0,5)]. \\[[Project](http://netdissect.csail.mit.edu/)]. \\[[Dataset: Places365](http://places2.csail.mit.edu/index.html)]. The original paper on visualizing the class activation maps to explain convolutional neural networks."}, {"name": "Understanding the role of Individual Units in a Deep Neural Network", "url": "https://www.pnas.org/content/pnas/early/2020/08/31/1907375117.full.pdf", "description": "***Proceedings of the National Academy of Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=11996680970579301810\\&hl=en\\&as_sdt=0,5)]. David Bau's review on network dissection for discriminative and generative models."}, {"name": "Zoom In: An Introduction to Circuits", "url": "https://distill.pub/2020/circuits/zoom-in/", "description": "***Distill***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9053581372570691569\\&hl=en\\&as_sdt=0,5)]. A perspective on treating neural networks as circuits."}, {"name": "Compositional Explanations of Neurons", "url": "https://proceedings.neurips.cc/paper/2020/hash/c74956ffb38ba48ed6ce977af6727275-Abstract.html", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=15725346730266402738\\&hl=en\\&as_sdt=0,5)]. \\[[Project (\u2b5025)](https://github.com/jayelm/compexp)]. A concept-composition version of network dissection."}, {"name": "This Looks Like That: Deep Learning for Interpretable Image Recognition", "url": "http://papers.NeurIPS.cc/paper/9095-this-looks-like-that-deep-learning-for-interpretable-image-recognition.pdf", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=9461838581952136719\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Unsupervised learning by competing hidden units", "url": "https://www.pnas.org/content/pnas/116/16/7723.full.pdf", "description": "***Proceedings of the National Academy of Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=1228003598355915526\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Noise or Signal: The Role of Backgrounds in Image Classification", "url": "https://arxiv.org/pdf/2006.09994.pdf", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=14729938011425134088\\&hl=en\\&as_sdt=0,5)]. \\[[Code & Data (\u2b50143)](https://github.com/MadryLab/backgrounds_challenge)]. \\[[Project](https://gradientscience.org/background/)]. A perspective on image background provides strong clue for foreground classification."}, {"name": "Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation", "url": "https://proceedings.neurips.cc/paper/2018/hash/5fc34ed307aac159a30d81181c99847e-Abstract.html", "description": "***NeurIPS'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=401428033641216502\\&hl=en\\&as_sdt=0,5)]. Maching the learned pattern of neurons in different neural networks."}, {"name": "Individual differences among deep neural network models", "url": "https://kriegeskortelab.zuckermaninstitute.columbia.edu/sites/default/files/content/MehrerKietzmann_2020_NatureComms.pdf", "description": "***Nature Communications***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=8259893575188417318\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Embodied Intelligence", "entries": [{"name": "Embodied Cognition", "url": "https://plato.stanford.edu/entries/embodied-cognition/", "description": "***Plato Stanford***. A computational philosophy account on Embodied Cognition, which emphasizes the significance of an agent's physical body in cognitive abilities."}, {"name": "Externalism About the Mind", "url": "https://plato.stanford.edu/entries/content-externalism/", "description": "***Plato Stanford***. A computational philosophy account on mind externalism, a long-term debate about the boundary of embodied intelligence."}, {"name": "Cognitive engineering: Human problem solving with tools", "url": "https://www.researchgate.net/profile/David-Woods-19/publication/242545872_Cognitive_Engineering_Human_Problem_Solving_with_Tools/links/542becf70cf29bbc126ac097/Cognitive-Engineering-Human-Problem-Solving-with-Tools.pdf", "description": "***Human Factors***, 1988. \\[[All Versions](https://scholar.google.com/scholar?cluster=14194840995416222723\\&hl=en\\&as_sdt=0,5)]. The original idea of investigating huamn tool use in problem solving."}, {"name": "Tools, language and cognition in human evolution", "url": "https://psycnet.apa.org/record/1993-97340-000", "description": "***Cambridge University Press***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=6046350461147957220\\&hl=en\\&as_sdt=0,5)]. A classic perspective correlating human tool use with the evolution of civilization."}, {"name": "The Extended Mind", "url": "https://icds.uoregon.edu/wp-content/uploads/2014/06/Clark-and-Chalmers-The-Extended-Mind.pdf", "description": "***Analysis***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=9546561188261943866\\&hl=en\\&as_sdt=0,5)]. The original paper on the debate of mind externalism."}, {"name": "The neural bases of complex tool use in humans", "url": "https://www.sciencedirect.com/science/article/pii/S1364661303003231", "description": "***Trends in Cognitive Sciences***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=3612212926196611828\\&hl=en\\&as_sdt=0,5)]. A neuroscience account of human tool use."}, {"name": "Spontaneous Metatool Use by New Caledonian Crows", "url": "https://www.sciencedirect.com/science/article/pii/S0960982207017708", "description": "***Current Biology***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=9263531730425342443\\&hl=en\\&as_sdt=0,5)]. A piece of evidence that intelligent animals can take advantage of matatools to make tools for problem solving."}, {"name": "Rapid Assimilation of External Objects Into the Body Schema", "url": "https://journals.sagepub.com/doi/abs/10.1177/0956797610371962", "description": "***Psychological Science***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=854636910326733489\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The cognitive bases of human tool use", "url": "https://www.eva.mpg.de/documents/Cambridge/Tennie_Cultural_BehBrainSci_2012_1566208.pdf", "description": "***Behavioral and Brain Sciences***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=4648150119820414671\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The embodied mind extended: using words as social tools", "url": "https://www.frontiersin.org/articles/10.3389/fpsyg.2013.00214/full", "description": "***Frontiers in Psychology***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=14719988081062606352\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Tool use as adaptation", "url": "https://royalsocietypublishing.org/doi/10.1098/rstb.2012.0408", "description": "***Philosophical Transactions of the Royal Society B: Biological Sciences***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=8060841461200774807\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Intensive tool-practice and skillfulness facilitate the extension of body representations in humans", "url": "https://www.sciencedirect.com/science/article/pii/S0028393214000232", "description": "***Neuropsychologia***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=10578024091098127929\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Tool use and affordance: Manipulation-based versus reasoning-based approaches", "url": "https://psycnet.apa.org/doiLanding?doi=10.1037%2Frev0000027", "description": "***Psychological Review***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=3284942486402374505\\&hl=en\\&as_sdt=0,5)]. A classic review on human tool use and affordance."}, {"name": "Meta-strategy learning in physical problem-solving: the effect of embodied experience", "url": "https://escholarship.org/uc/item/5gf0m7x3", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=9713842177532954702)]."}, {"name": "Understanding Tools: Task-Oriented Object Modeling, Learning and Recognition", "url": "https://yzhu.io/publication/tool2015cvpr/paper.pdf", "description": "***CVPR'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=4609926671953500969\\&hl=en\\&as_sdt=0,5)]. \\[[Project](https://yzhu.io/publication/tool2015cvpr/)]. The original paper introducing affordance and physically-grounded tool use into computer vision."}, {"name": "Robotic hand augmentation drives changes in neural body representation", "url": "https://robotics.sciencemag.org/content/6/54/eabd7935.abstract", "description": "***Science Robotics***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1622125726197763917\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Expert Tool Users Show Increased Differentiation between Visual Representations of Hands and Tools", "url": "https://www.jneurosci.org/content/jneuro/41/13/2980.full.pdf", "description": "***Journal of Neuroscience***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=13454164767827515188\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Visual scoping operations for physical assembly", "url": "https://arxiv.org/pdf/2106.05654.pdf", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=7238090583833839\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Behavior-grounded representation of tool affordances", "url": "https://www.cc.gatech.edu/ai/robot-lab/online-publications/StoytchevICRA2005.pdf", "description": "***ICRA'05***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=6115815663915603675\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A Relational Approach to Tool-Use Learning in Robots", "url": "https://link.springer.com/chapter/10.1007/978-3-642-38812-5_1", "description": "***ILP'12***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=18374178227592386332\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Relational affordances for multiple-object manipulation", "url": "https://link.springer.com/article/10.1007/s10514-017-9637-x", "description": "***Autonomous Robots***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=6357646940615855682\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Improvisation through Physical Understanding: Using Novel Objects as Tools with Visual Foresight", "url": "http://m.roboticsproceedings.org/rss15/p01.pdf", "description": "***RSS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4316276917607326251\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Meta-strategy learning in physical problem-solving: the effect of embodied experience", "url": "https://escholarship.org/uc/item/5gf0m7x3", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9713842177532954702)]. This paper focuses on how natural embodied experience affects what kinds of abstract physical problem-solving strategies people use in a virtual task. The findings suggest that differences in embodied experience drive the acquisition of different meta-strategies for balancing acting with thinking, deciding what kinds of actions to try, and deciding how persistent to be with a current action plan."}, {"name": "Humanoid robotics\u2014History, current state of the art, and challenges", "url": "https://www.science.org/doi/full/10.1126/scirobotics.aar4043", "description": "***Science Robotics***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=10429657872677563981)]. Humanoids represent one of the ultimate goals of robotics: to synthesize advances from many disciplines."}, {"name": "3D dynamic scene graphs: Actionable spatial perception with places, objects, and humans", "url": "https://arxiv.org/abs/2002.06289", "description": "***RSS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=4428742298455436054)]. This paper presents a unified representation for actionable spatial perception: 3D Dynamic Scene Graphs. Scene graphs are directed graphs where nodes represent entities in the scene (e.g. objects, walls, rooms), and edges represent relations (e.g. inclusion, adjacency) among nodes. Dynamic scene graphs (DSGs) extend this notion to represent dynamic scenes with moving agents (e.g. humans, robots), and to include actionable information that supports planning and decision-making (e.g. spatio-temporal relations, topology at different levels of abstraction). The second contribution is to provide the first fully automatic Spatial PerceptIon eNgine(SPIN) to build a DSG from visual-inertial data. The authors integrate state-of-the-art techniques for object and human detection and pose estimation, and we describe how to robustly infer object, robot, and human nodes in crowded scenes. This is the first paper that reconciles visual-inertial SLAM and dense human mesh tracking. Moreover, the authors provide algorithms to obtain hierarchical representations of indoor environments (e.g. places, structures, rooms) and their relations. The third contribution is to demonstrate the proposed spatial perception engine in a photo-realistic Unity-based simulator, where the authors assess its robustness and expressiveness. Finally, the authors discuss the implications of their proposal on modern robotics applications. 3D Dynamic Scene Graphs can have a profound impact on planning and decision-making, human-robot interaction, long-term autonomy, and scene prediction."}, {"name": "Embodied large language models enable robots to complete complex tasks in unpredictable environments", "url": "https://www.nature.com/articles/s42256-025-01005-x", "description": "***Nature Machine Intelligence***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=4507358987058849097)]. Completing complex tasks in unpredictable settings challenges robotic systems, requiring a step change in machine intelligence. Sensorimotor abilities are considered integral to human intelligence. Thus, biologically inspired machine intelligence might usefully combine artificial intelligence with robotic sensorimotor capabilities. This work reports an embodied large-language-model-enabled robot (ELLMER) framework, utilizing GPT-4 and a retrieval-augmented generation infrastructure, to enable robots to complete long-horizon tasks in unpredictable settings. The method extracts contextually relevant examples from a knowledge base, producing action plans that incorporate force and visual feedback and enabling adaptation to changing conditions. The authors tested ELLMER on a robot tasked with coffee making and plate decoration; these tasks consist of a sequence of sub-tasks from drawer opening to pouring, each benefiting from distinct feedback types and methods. The authors show that the ELLMER framework allows the robot to complete the tasks. This demonstration marks progress towards scalable, efficient and \u2018intelligent robots\u2019 able to complete complex tasks in uncertain environments."}, {"name": "The Design, Education and Evolution of a Robotic Baby", "url": "https://ieeexplore.ieee.org/abstract/document/10056320", "description": "***IEEE Transactions on Robotics***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=16298301812039402477)]. Inspired by Alan Turing's idea of a child machine, this article introduces the formal definition of a robotic baby, an integrated system with minimal world knowledge at birth, capable of learning incrementally and interactively, and adapting to the world. Within the definition, fundamental capabilities and system characteristics of the robotic baby are identified and presented as the system-level requirements. As a minimal viable prototype, the Baby architecture is proposed with a systems engineering design approach to satisfy the system-level requirements, which has been verified and validated with simulations and experiments on a robotic system. The authors demonstrate the capabilities of the robotic baby in natural language acquisition and semantic parsing in English and Chinese, as well as in natural language grounding, natural language reinforcement learning, natural language programming, and system introspection for explainability. The education and evolution of the robotic baby are illustrated with real-world robotic demonstrations. Inspired by the genetic inheritance in human beings, knowledge inheritance in robotic babies and its benefits regarding evolution are discussed."}], "notes": []}, {"name": "Agi Cocosci \u2014 Evolutionary Intelligence", "entries": [{"name": "Evolutionary trade-offs, Pareto optimality, and the geometry of phenotype space", "url": "http://websites.umich.edu/~zhanglab/clubPaper/06_08_2012.pdf", "description": "***Science***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=16162252507845975080\\&hl=en\\&as_sdt=0,5)]. A classic paper correlating biological trade-offs with the evolution of pareto optimality."}, {"name": "Pareto optimality in multiobjective problems", "url": "https://link.springer.com/article/10.1007/BF01442131", "description": "***Applied Mathematics and Optimization***, 1977. \\[[All Versions](https://scholar.google.com/scholar?cluster=11305142600366783354\\&hl=en\\&as_sdt=0,5)]. The original paper on the pareto optimality in multiobjective problems."}, {"name": "Pareto-Based Multiobjective Machine Learning: An Overview and Case Studies", "url": "http://www.soft-computing.de/SMC0805.pdf", "description": "***IEEE Transactions on Systems, Man, and Cybernetics***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=11308312498510305429\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on the application of pareto optimality to multiobjective machine learning."}, {"name": "Phylogenetic evidence for Sino-Tibetan origin in northern China in the Late Neolithic", "url": "https://www.nature.com/articles/s41586-019-1153-z", "description": "***Nature***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=13913123623752818925\\&hl=en\\&as_sdt=0,5)]. A Bayesian phylogenetic analysis on two competing hypotheses of the origin of the Sino-Tibetan language family suggests that the initial expansion of Sino-Tibetan languages occurred approximately 4,000\u20136,000 years before present (BP; taken as AD 1950) in the Yellow River basin of northern China, and that this expansion is associated with the development of the Yangshao and/or Majiayao Neolithic cultures."}, {"name": "Triangulation supports agricultural spread of the Transeurasian languages", "url": "https://www.nature.com/articles/s41586-021-04108-8", "description": "***Nature***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1183005894965630508\\&hl=en\\&as_sdt=0,5)]. \\[[Nature News](https://www.nature.com/articles/d41586-021-03037-w)]. A triangulation of linguistic, archaeological and genetic data suggests that the Transeurasian language family originated in a population of grain farmers in China around 9,000 years ago, and that agriculture underpinned its spread."}, {"name": "From language development to language evolution: A unified view of human lexical creativity", "url": "https://www.science.org/doi/abs/10.1126/science.ade7981", "description": "***Science***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=15871163761816546924\\&hl=en\\&as_sdt=0,5)]. \\[[Preprint](https://brochhagen.github.io/content/ms/accepted-lexical-creativity.pdf)]. This work supports a unified foundation for human lexical creativity underlying both the fleeting products of individual ontogeny and the evolutionary products of phylogeny across languages."}], "notes": []}, {"name": "Agi Cocosci \u2014 Methodologies for Experiments", "entries": [{"name": "Identification of Causal Effects Using Instrumental Variables", "url": "http://www.jakebowers.org/ITVExperiments/angristimbensrubin96.pdf", "description": "***Journal of the American Statistical Association***, 1996. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=17166265099721941605)]. The original paper on Instrumental Variables for natural sociology studies."}, {"name": "Experiments with More Than One Random Factor: Designs, Analytic Models, and Statistical Power", "url": "https://www.annualreviews.org/doi/abs/10.1146/annurev-psych-122414-033702", "description": "***Annual Review of Psychology***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=6652444619934494760\\&hl=en\\&as_sdt=0,5)]. A comprehensive review of the quantitative analysis techniques for behavioral studies."}, {"name": "With or Without U? The Appropriate Test for a U-Shaped Relationship", "url": "https://mpra.ub.uni-muenchen.de/4823/1/MPRA_paper_4823.pdf", "description": "***Oxford Bulletin of Economics and Statistics***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=1574723532506536904\\&hl=en\\&as_sdt=0,5)]. The original method for testing U-shape relation from the data, which is distinctive from the quadratic regression test."}, {"name": "Two lines: A valid alternative to the invalid testing of U-shaped relationships with quadratic regressions", "url": "https://journals.sagepub.com/doi/pdf/10.1177/2515245918805755", "description": "***Advances in Methods and Practices in Psychological Science***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=12010185803500406162\\&hl=en\\&as_sdt=0,5)]. An alternative method to test the statistical significance of U-shaped relationships."}, {"name": "Scaling up experimental social, behavioral, and economic science", "url": "https://osf.io/wksv8", "description": "***Open Science Foundation Preprints***. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Scaling+up+experimental+social%2C+behavioral%2C+and+economic+science\\&btnG=)]. A white paper on scaling up social, behavioral, and econimic experiments."}, {"name": "The weirdest people in the world?", "url": "https://scholar.harvard.edu/files/henrich/files/henrich_heine_norenzayan_2010-2.pdf", "description": "***Brain and Behavioral Sciences***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=3129419557801277936\\&hl=en\\&as_sdt=0,5)]. The original paper on rethinking and tackling the sample bias in behaivoral studies, where most subjects are drawn from Western, Educated, Industrialized, Rich, and Democratic (WEIRD) societies."}, {"name": "Scaling up psychology via Scientific Regret Minimization", "url": "https://www.pnas.org/doi/10.1073/pnas.1915841117", "description": "***Proceedings of the National Academy of Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=8011895688226766944\\&hl=en\\&as_sdt=0,5)]. The statistical and ecological basis for scaling up behavioral studies."}, {"name": "Machine-generated theories of human decision-making", "url": "https://cpb-us-w2.wpmucdn.com/web.sas.upenn.edu/dist/a/511/files/2021/06/Bhatia-He-Science.pdf", "description": "***Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=7065547001880027350\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Using large-scale experiments and machine learning to discover theories of human decision-making", "url": "https://cocosci.princeton.edu/jpeterson/papers/peterson2021-science.pdf", "description": "***Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=7456250222852859810\\&hl=en\\&as_sdt=0,5)]. A piece of evidence for the merits brought by large-scale behavioral studies in social science."}, {"name": "Integrating explanation and prediction in computational social science", "url": "http://jakehofman.com/pdfs/integrating-prediction-and-explanation.pdf", "description": "***Nature***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=288245575125750925\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Exploring human cognition using large image databases", "url": "https://cocosci.princeton.edu/josh/papers/griffiths-largeimagedatabases-topics2016.pdf", "description": "***Topics in Cognitive Sciences***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=3629906005701226294\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Visual Search at Pinterest", "url": "https://web.archive.org/web/20170809024454id_/http://www.kevinjing.com/visual_search_at_pinterest.pdf", "description": "***KDD'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=2051024301293529405\\&hl=en\\&as_sdt=0,5)]. Large scale user study in the development of the recommendations system by Pinterest."}, {"name": "A computational process-tracing method for measuring people\u2019s planning strategies and how they change over time", "url": "https://link.springer.com/article/10.3758/s13428-022-01789-5", "description": "***Behavior Research Methods***, 2022. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=10405935000926098041)]. Model-based strategy identification."}, {"name": "Searching large hypothesis spaces by asking questions", "url": "https://cogsci.mindmodeling.org/2016/papers/0122/paper0122.pdf", "description": "***CogSci'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=3398849603439166012\\&hl=en\\&as_sdt=0,5)]. A behavioral study for the 20 questions game."}, {"name": "Asking and evaluating natural language questions", "url": "https://gureckislab.org/papers/RotheLakeGureckis-2016cogsci.pdf", "description": "***CogSci'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=34641833161282231\\&hl=en\\&as_sdt=0,5)]. A behavioral study for the battleship game."}, {"name": "Do People Ask Good Questions?", "url": "https://link.springer.com/article/10.1007/s42113-018-0005-5", "description": "***Computational Brain & Behavior***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=14595996621617337270\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Asking goal-oriented questions and learning from answers", "url": "http://nyuccl.org/papers/Rothe-Lake-Gureckis-2019-Cogsci.pdf", "description": "***CogSci'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=14185546187726917682\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Elimination by aspects: A theory of choice", "url": "https://psycnet.apa.org/record/1973-00249-001", "description": "***Psychological Review***, 1972. \\[[All Versions](https://scholar.google.com/scholar?cluster=1633792484482810297\\&hl=en\\&as_sdt=0,5)]. Herbert Simon's early experiments on computer aided behavioral studies."}, {"name": "Problem Solving and Rule Induction: A Unified View", "url": "https://stacks.stanford.edu/file/druid:qv796fc9687/qv796fc9687.pdf", "description": "***Knowledge and cognition***, 1974. \\[[All Versions](https://scholar.google.com/scholar?cluster=12943734683291006234\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Evidence integration in model-based tree search", "url": "https://www.pnas.org/content/112/37/11708.short", "description": "***Proceedings of the National Academy of Sciences***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=11085043350027609187\\&hl=en\\&as_sdt=0,5)]."}, {"name": "People Infer Recursive Visual Concepts from Just a Few Examples", "url": "https://link.springer.com/content/pdf/10.1007/s42113-019-00053-y.pdf", "description": "***Computational Brain & Behavior***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=3871396883970734141\\&hl=en\\&as_sdt=0,5)]."}, {"name": "One-shot learning of generative speech concepts", "url": "https://escholarship.org/content/qt3xf2n3vc/qt3xf2n3vc.pdf", "description": "***CogSci'14***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=15482292457660075957\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Human few-shot learning of compositional instructions", "url": "https://arxiv.org/abs/1901.04587", "description": "***CogSci'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=12841163907815018136\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Fast and flexible: Human program induction in abstract reasoning tasks", "url": "https://arxiv.org/pdf/2103.05823.pdf", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=5294483826040237516\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Investigating Human Priors for Playing Video Games", "url": "http://proceedings.mlr.press/v80/dubey18a.html", "description": "***ICML'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=2202192690517876762\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Tasks for aligning human and machine planning", "url": "https://www.sciencedirect.com/science/article/pii/S2352154619300622", "description": "***Current Opinion in Behavioral Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=8308872468787875598\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Humans can decipher adversarial images", "url": "https://perception.jhu.edu/files/PDFs/19_Adversarial_Deciphering/ZhouFirestone-AdversarialDeciphering.pdf", "description": "***Nature Communications***. 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4423950118844131054\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Shared computational principles for language processing in humans and deep language models", "url": "https://www.nature.com/articles/s41593-022-01026-4.pdf", "description": "***Nature Neuroscience***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=16078004657063602593\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Implicit Association Test", "url": "https://en.wikipedia.org/wiki/Implicit-association_test", "description": "***Wikipedia***. Wikipedia on the Implicit Association Test, a controversial assessment intended to detect subconscious associations between mental representations of objects (concepts) in memory."}, {"name": "Measuring Individual Differences in Implicit Cognition: The Implicit Association Test", "url": "http://faculty.fortlewis.edu/burke_b/Senior/BLINK%20replication/IAT.pdf", "description": "***Journal of Personality and Social Psychology***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=302378224541015580\\&hl=en\\&as_sdt=0,5)]. The original paper introducing the Implicit Association Test."}, {"name": "Health of the Implicit Association Test at age 3", "url": "http://faculty.washington.edu/agg/pdf/Gwald_Nosek_ZEITSCHR_2001.OCR.pdf", "description": "***Zeitschrift f\u00fcr Experimentelle Psychologie***, 2001. \\[[All Versions](https://scholar.google.com/scholar?cluster=10868478693422595588\\&hl=en\\&as_sdt=0,5)]. The 3rd year review for the IAT."}, {"name": "The Implicit Association Test at Age 7: A Methodological and Conceptual Review", "url": "https://faculty.washington.edu/agg/pdf/Nosek%20&%20al.IATatage7.2007.pdf", "description": "***Social psychology and the unconscious: The automaticity of higher mental processes (pp. 265\u2013292), Psychology Press***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=16189750920013376566\\&hl=en\\&as_sdt=0,5)]. The 7th year review for the IAT."}, {"name": "A Meta-Analysis on the Correlation Between the Implicit Association Test and Explicit Self-Report Measures", "url": "http://faculty.washington.edu/agg/IATmaterials/PDFs/Hofmann%20&%20al%20\\(PSPB,2005\\", "description": ""}, {"name": "Virtual reality in behavioral neuroscience and beyond", "url": "https://www.nature.com/articles/nn948", "description": "***Nature Neuroscience***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=12168354203281280346\\&hl=en\\&as_sdt=0,5)]. A classic review on the early applications of Virtual Reality to behavioral studies."}, {"name": "Virtual reality: A survival guide for the social scientist", "url": "https://stanfordvr.com/mm/2009/fox-jmp-vr-survival.pdf", "description": "***Journal of Media Psychology***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=17318470193315023264\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The psychology of virtual reality", "url": "https://psycnet.apa.org/record/2022-60836-006", "description": "***The psychology of technology: Social science research in the age of Big Data (pp. 155\u2013193), American Psychological Association***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=11535480055596209683\\&hl=en\\&as_sdt=0,5\\&as_ylo=2021)]. Jeremy Bailenson's review on the applications of Virtual Reality to behavioral studies."}, {"name": "How Immersive Is Enough? A Meta-Analysis of the Effect of Immersive Technology on User Presence", "url": "https://stanfordvr.com/mm/2015/cummings-mp-how-immersive.pdf", "description": "***Media Psychology***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=9218122072360464558\\&hl=en\\&as_sdt=0,5)]. A meta-analysis on the extent to which technologies need to be immersive in order to generate a sense of presence."}, {"name": "Towards an Understanding of Distributed Asymmetric Collaborative Visualization on Problem-solving", "url": "https://ieeexplore.ieee.org/document/10108427", "description": "***VR'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11228377215337222005\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Agent: automatic generation of experimental protocol runtime", "url": "https://dl.acm.org/doi/abs/10.1145/3139131.3139152", "description": "***VRST'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=3511549412244980073)]. This paper proposes the use of Domain-Specific Languages (DSLs) to ease the description and generation of VR experiments, thus letting experiment designers focus on their core tasks: designing, conducting, and reporting experiments."}, {"name": "What's the Game, then? Opportunities and Challenges for Runtime Behavior Generation", "url": "https://dl.acm.org/doi/abs/10.1145/3654777.3676358", "description": "***UIST'24***, 2024. \\[[All Versions](https://github.com/SHI-Yu-Zhe/awesome-agi-cocosci/blob/master/README.md/)]. Procedural content generation (PCG), the process of algorithmically creating game components instead of manually, has been a common tool of game development for decades. Recent advances in large language models (LLMs) enable the generation of game behaviors based on player input at runtime. Such code generation brings with it the possibility of entirely new gameplay interactions that may be difficult to integrate with typical game development workflows. This work explores these implications through GROMIT, a novel LLM-based runtime behavior generation system for Unity. When triggered by a player action, GROMIT generates a relevant behavior which is compiled without developer intervention and incorporated into the game."}], "notes": []}, {"name": "Agi Cocosci \u2014 Meta-Level Considerations", "entries": [{"name": "Automated Reinforcement Learning (AutoRL): A Survey and Open Problems", "url": "https://arxiv.org/pdf/2201.03916.pdf", "description": "2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=9025378857688824887\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on AutoRL."}, {"name": "Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks", "url": "https://proceedings.mlr.press/v70/finn17a/finn17a.pdf", "description": "***ICML'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=17278604844873996878)]. \\[[Post](https://bair.berkeley.edu/blog/2017/07/18/learning-to-learn/)]. Chelsea Finn's original paper on Model-Agnostic Meta-Learning (MAML)."}, {"name": "Bayesian Model-Agnostic Meta-Learning", "url": "https://proceedings.neurips.cc/paper/2018/hash/e1021d43911ca2c1845910d84f40aeae-Abstract.html", "description": "***NeurIPS'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=7370333111335795917\\&hl=en\\&as_sdt=0,5)]. A Bayesian account on MAML."}, {"name": "Meta-Q-Learning", "url": "https://openreview.net/forum?id=SJeD3CEFPH", "description": "***ICLR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=2865388954464396222\\&hl=en\\&as_sdt=0,5)]. The milestone paper on context Meta-RL."}, {"name": "Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variables", "url": "http://proceedings.mlr.press/v97/rakelly19a.html", "description": "***ICML'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15379570585451726919\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Balancing Constraints and Rewards with Meta-Gradient D4PG", "url": "https://openreview.net/forum?id=TQt98Ya7UMP", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=2805226315118298313\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Metacontrol for Adaptive Imagination-Based Optimization", "url": "https://openreview.net/forum?id=Bk8BvDqex", "description": "***ICLR'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=16728474512617398730\\&hl=en\\&as_sdt=0,5)]."}, {"name": "On Effective Scheduling of Model-based Reinforcement Learning", "url": "https://proceedings.neurips.cc/paper/2021/hash/1e4d36177d71bbb3558e43af9577d70e-Abstract.html", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=11128521607771619105\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Vision: A Computational Investigation into the Human Representation and Processing of Visual Information", "url": "https://usa1lib.org/book/1223444/8e5ca8", "description": "***MIT Press***, 1982. \\[[All Versions](https://scholar.google.com/scholar?cluster=14386368570811483142\\&hl=en\\&as_sdt=0,44)]. David Marr's original book on the levels of analysis."}, {"name": "From understanding computation to understanding neural circuitry", "url": "https://dspace.mit.edu/bitstream/handle/1721.1/5782/AIM-357.pdf?sequence=2", "description": "***Neuroscience Research Program Bulletin***, 1979. \\[[All Versions](https://scholar.google.com/scholar?start=0\\&hl=en\\&as_sdt=0,5\\&cluster=11150567121969913334)]."}, {"name": "Bridging Levels of Analysis for Probabilistic Models of Cognition", "url": "https://cocosci.princeton.edu/tom/papers/LabPublications/BridgingLevelsAnalysis.pdf", "description": "***Current Directions in Psychological Science***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=5063382112136991296\\&hl=en\\&as_sdt=0,5)]. A Marr's paradigm account on probabilistic models."}, {"name": "Levels of Analysis in Computational Social Science", "url": "https://people.csail.mit.edu/pkrafft/papers/krafft-griffiths-levels-css.pdf", "description": "***CogSci'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=10178929388985626844\\&hl=en\\&as_sdt=0,5)]. A Marr's paradigm account on computational social science."}, {"name": "Levels of Analysis for Machine Learning", "url": "https://baicsworkshop.github.io/pdf/BAICS_6.pdf", "description": "***ICLR'20 Bridging AI and Cognitive Science Workshop***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=13819038971626384115\\&hl=en\\&as_sdt=0,5)]. A Marr's paradigm account on machine learning."}, {"name": "Gestalt theory", "url": "https://psycnet.apa.org/record/2007-10344-001", "description": "***A source book of Gestalt psychology***, 1938. \\[[All Versions](https://scholar.google.com/scholar?cluster=18133275659218646817\\&hl=en\\&as_sdt=0,5)]. The original book on Gestalt psychology."}, {"name": "Gestalt Psychology", "url": "https://link.springer.com/article/10.1007/BF00422382", "description": "***Psychologische Forschung***, 1967. \\[[All Versions](https://scholar.google.com/scholar?cluster=16023098380090751616\\&hl=en\\&as_sdt=0,5)]. Wolfgang K\u00f6hler's review on Gestalt psychology."}, {"name": "Restructuring revisited I. Summary and critique of the Gestalt theory of problem solving", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-9450.1984.tb01001.x", "description": "***Scandinavian Journal of Psychology***, 1984. \\[[All Versions](https://scholar.google.com/scholar?cluster=1540079499182933565\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Restructuring revisited II. An information processing theory of restructuring and insight", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-9450.1984.tb01005.x", "description": "***Scandinavian Journal of Psychology***, 1984. \\[[All Versions](https://scholar.google.com/scholar?cluster=1821980539002417470\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Thoughts beyond words: When language overshadows insight", "url": "https://psycnet.apa.org/record/1993-36184-001", "description": "***Journal of Experimental Psychology***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=13773440938721955384\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Deep Learning: How the Mind Overrides Experience", "url": "https://hk1lib.org/book/1244721/20ddc5", "description": "***Cambridge University Press***, 2011. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=231021877034210140)]."}, {"name": "Eureka Effect", "url": "https://en.wikipedia.org/wiki/Eureka_effect", "description": "***Wikipedia***. Wikipedia on Eureka effect (a.k.a. Aha! moment, insight, and epiphany), the common human experience of suddenly understanding a previously incomprehensible problem or concept."}, {"name": "Insight", "url": "https://en.wikipedia.org/wiki/Insight", "description": "***Wikipedia***. Wikipedia on insight."}, {"name": "Epiphany", "url": "https://en.wikipedia.org/wiki/Epiphany_\\(feeling\\", "description": ""}, {"name": "A computational model of scientific insight", "url": "https://escholarship.org/uc/item/54x8v354", "description": "***The nature of creativity: Contemporary psychological perspectives***, 1988. \\[[All Versions](https://scholar.google.com/scholar?cluster=13633357571064621019\\&hl=en\\&as_sdt=0,5)]. A computational account on insights for scientific discovery."}, {"name": "What Makes an Insight Problem? The Roles of Heuristics, Goal Conception, and Solution Recoding in Knowledge-Lean Problems", "url": "https://www.researchgate.net/profile/Thomas-Ormerod/publication/8909475_What_Makes_an_Insight_Problem_The_Roles_of_Heuristics_Goal_Conception_and_Solution_Recoding_in_Knowledge-Lean_Problems/links/00b7d5159f3c057eb5000000/What-Makes-an-Insight-Problem-The-Roles-of-Heuristics-Goal-Conception-and-Solution-Recoding-in-Knowledge-Lean-Problems.pdf", "description": "***Journal of Experimental Psychology***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=17529631069707671285\\&hl=en\\&as_sdt=0,5)]. \\[[APA](https://psycnet.apa.org/record/2003-10949-002)]."}, {"name": "Constraint relaxation and chunk decomposition in insight problem solving", "url": "https://www.hf.uni-koeln.de/data/fgpsych/File/Haider/Knoblich_etal_1999.pdf", "description": "***Journal of Experimental Psychology***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=8057214169831054227\\&hl=en\\&as_sdt=0,5)]. \\[[APA](https://psycnet.apa.org/record/1999-01477-011)]."}, {"name": "Dynamics and constraints in insight problem solving", "url": "https://citeseerx.ist.psu.edu/document?repid=rep1\\&type=pdf\\&doi=818fec7c896ea3716eeb637da095293e9e6d1806", "description": "***Journal of Experimental Psychology***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=12067671710370549516\\&hl=en\\&as_sdt=0,5)]. \\[[APA](https://psycnet.apa.org/record/2002-01361-014)]."}, {"name": "Insight solutions are correct more often than analytic solutions", "url": "https://bpb-us-e1.wpmucdn.com/sites.northwestern.edu/dist/a/699/files/2015/11/Salvi_etal_Insight-is-right_TR2016-2n3ns9l.pdf", "description": "***Thinking & Reasoning***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=883561570778414219\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Human Performance on Insight Problem Solving: A Review", "url": "https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1094\\&context=jps", "description": "***The Journal of Problem Solving***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=15913242870565808883\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Insight Is Not in the Problem: Investigating Insight in Problem Solving across Task Types", "url": "https://www.frontiersin.org/articles/10.3389/fpsyg.2016.01424/full", "description": "***Frontiers in Psychology***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=4564128114316001308\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Multiple Causes of Difficulty in Insight: The Case of the Nine-Dot Problem", "url": "https://www.researchgate.net/profile/Trina-Kershaw/publication/8909474_Multiple_Causes_of_Difficulty_in_Insight_The_Case_of_the_Nine-Dot_Problem/links/55dca27e08aeb38e8a8d23b6/Multiple-Causes-of-Difficulty-in-Insight-The-Case-of-the-Nine-Dot-Problem.pdf", "description": "***Journal of Experimental Psychology***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=15600199808825346018\\&hl=en\\&as_sdt=0,5)]. \\[[APA](https://psycnet.apa.org/record/2003-10949-001)]."}, {"name": "Investigating the effect of Mental Set on Insight Problem Solving", "url": "https://www.researchgate.net/profile/Gary-Jones-14/publication/23152585_Investigating_the_Effect_of_Mental_Set_on_Insight_Problem_Solving/links/0fcfd50abb767b1102000000/Investigating-the-Effect-of-Mental-Set-on-Insight-Problem-Solving.pdf", "description": "***Experimental Psychology***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=11054712671934144981\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Bounded Rationality", "url": "https://plato.stanford.edu/entries/bounded-rationality/", "description": "***Plato Stanford***. A computational philosophy account on Bounded Rationality, an elementary hypothesis of human intelligence in psychology and ecology."}, {"name": "Instrumental Rationality", "url": "https://plato.stanford.edu/entries/rationality-instrumental/", "description": "***Plato Stanford***. A computational philosophy account on Instrumental Rationality, a dabate on whether an agent's decision is made intentionally or out of rational coherence."}, {"name": "A Study of Thinking", "url": "https://www.taylorfrancis.com/books/mono/10.4324/9781315083223/study-thinking-jerome-bruner-jacqueline-goodnow-george-austin", "description": "***Routledge***, 1956. \\[[All Versions](https://scholar.google.com/scholar?cluster=17466297915128086930)]. This book is a pioneering account of how human beings achieve a measure of rationality in spite of the constraints imposed by time and ignorance."}, {"name": "The Adaptive Nature of Human Categorization Behavior", "url": "http://act-r.psy.cmu.edu/wordpress/wp-content/uploads/2012/12/89AdaptiveNature.pdf", "description": "***Psychological Review***, 1991. \\[[All Versions](https://scholar.google.com/scholar?cluster=7349048316173616836\\&hl=en\\&as_sdt=0,5)]. The original paper that relates cognitive resource limitation with Bayesian rational analysis, in the case of categorization behavior."}, {"name": "Task switching", "url": "https://www.cell.com/trends/cognitive-sciences/fulltext/S1364-6613\\(03\\", "description": ""}, {"name": "Computational Rationality: Linking Mechanism and Behavior Through Bounded Utility Maximization", "url": "https://onlinelibrary.wiley.com/doi/full/10.1111/tops.12086", "description": "***Topics in Cognitive Science***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=15813211310327194798\\&hl=en\\&as_sdt=0,5)]. Introducing the computational rationality framework for including information-processing bounds in rational analyses, which emphasizes the incorporation of computational mechanism into the definition of rational action."}, {"name": "Computational rationality: A converging paradigm for intelligence in brains, minds, and machines", "url": "https://gershmanlab.com/pubs/GershmanHorvitzTenenbaum15.pdf", "description": "***Science***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=7744057022238735461\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on the rationality of Bayesian computational models."}, {"name": "Resource-rational analysis: Understanding human cognition as the optimal use of limited computational resources", "url": "https://cocosci.princeton.edu/papers/lieder_resource.pdf", "description": "***Behavioral and Brain Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=1642626865293965288\\&hl=en\\&as_sdt=0,5)]. A resource-rational account on interpreting human intelligence."}, {"name": "Rational Use of Cognitive Resources: Levels of Analysis Between the Computational and the Algorithmic", "url": "https://onlinelibrary.wiley.com/doi/full/10.1111/tops.12142", "description": "***Topics in Cognitive Science***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=16305499937147933368\\&hl=en\\&as_sdt=0,5)]. An earlier version of the paper above."}, {"name": "Understanding Human Intelligence through Human Limitations", "url": "https://www.cell.com/trends/cognitive-sciences/fulltext/S1364-6613\\(20\\", "description": ""}, {"name": "Foundations of intuitive power analyses in children and adults", "url": "https://eccl.mit.edu/s/Pelz_Foundations-of-intuitive-power-analyses-in-children-and-adults.pdf", "description": "***Nature Human Behavior***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=4370839893505978405\\&hl=en\\&as_sdt=0,5)]. Evidences support that people have some of the foundations for 'intuitive power analyses', which help people use intuitive statistical reasoning and metacognitive strategies to estimate how much information they might need to solve different discrimination problems."}, {"name": "Cognitive Science as a Source of Forward and Inverse Models of Human Decisions for Robotics and Control", "url": "https://cocosci.princeton.edu/papers/ho2022cognitive.pdf", "description": "***Annual Review of Control, Robotics, and Autonomous Systems***, 2022. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&cluster=14055765901243029337)]. The review focuses on how cognitive science can provide forward models of human decision-making and inverse models of how humans think about others\u2019 decision-making. The authors highlight relevant recent developments, including approaches that synthesize black box and theory-driven modeling, accounts that recast heuristics and biases as forms of bounded optimality, and models that characterize human theory of mind and communication in decision-theoretic terms."}, {"name": "Epistemology", "url": "https://plato.stanford.edu/entries/epistemology/", "description": "***Plato Stanford***."}, {"name": "The secret life of predictive brains: what's spontaneous activity for?", "url": "https://www.sciencedirect.com/science/article/pii/S1364661321001285", "description": "***Trends in Cognitive Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=719229834892860829\\&hl=en\\&as_sdt=0,5)]. A neuroscience account on brain as a generative model."}, {"name": "SOAR: An architecture for general intelligence", "url": "https://www.sciencedirect.com/science/article/abs/pii/0004370287900506", "description": "***Artificial Intelligence***, 1987. \\[[All Versions](https://scholar.google.com/scholar?cluster=10873259207109132615\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Is human cognition adaptive?", "url": "http://act-r.psy.cmu.edu/wordpress/wp-content/uploads/2013/09/Anderson91.pdf", "description": "***Behavioral and Brain Sciences***, 1991. \\[[All Versions](https://scholar.google.com/scholar?cluster=3639936076538071052\\&hl=en\\&as_sdt=0,5)]. The original paper introducing the adaptation perspective of human intelligence, the theoretical basis of the ACT cognitive architecture."}, {"name": "Metacognition in computation: A selected research review", "url": "https://www.sciencedirect.com/science/article/pii/S0004370205001530", "description": "***Artificial Intelligence***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=4240334051245008914\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Basic functional trade-offs in cognition: An integrative framework", "url": "https://www.sciencedirect.com/science/article/pii/S0010027718301604", "description": "***Cognition***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=11475742130443069967\\&hl=en\\&as_sdt=0,5)]."}, {"name": "What is consciousness, and could machines have it?", "url": "https://doi.org/10.1126/SCIENCE.AAN8871", "description": "***Science***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=6932714857132107942\\&hl=en\\&as_sdt=0,5)]. A perspective on the two levels of consciousness in machine intelligence."}, {"name": "A Theoretical Computer Science Perspective on Consciousness", "url": "https://www.worldscientific.com/doi/abs/10.1142/S2705078521500028", "description": "***Journal of Artificial Intelligence and Consciousness***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16430561748075101972\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Science Logology", "entries": [{"name": "The structure of scientific revolutions", "url": "https://www-inst.eecs.berkeley.edu/~cs298-7/fa20/readings/kuhn.pdf", "description": "***University of Chicago Press: Chicago***, 1970. \\[[All Versions](https://scholar.google.com/scholar?cluster=8909475038284903063\\&hl=en\\&as_sdt=0,5)]. Thomas Kuhn's original book on the emergence and the shift of scientific paradigms."}, {"name": "The Meaning of \"Theory\"", "url": "https://jamacoartney.net/Abend%20\\(2008\\", "description": ""}, {"name": "The blind men and the elephant: A metaphor to illuminate the role of researchers and reviewers in social science", "url": "https://journals.sagepub.com/doi/pdf/10.4256/mio.2013.015", "description": "***Methodological Innovations Online***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=1654629562068006152\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A Computational Inflection for Scientific Discovery", "url": "https://dl.acm.org/doi/abs/10.1145/3576896", "description": "***Communications of the ACM***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=1756108647531090189\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Metascience", "url": "https://en.wikipedia.org/wiki/Metascience", "description": "***Wikipedia***."}, {"name": "Science of Science", "url": "http://ctbergstrom.com/publications/pdfs/2018Science.pdf", "description": "***Science***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=6471468823556848055\\&hl=en\\&as_sdt=0,5)]. A comprehensive large-scale review on the science of science."}, {"name": "Finding Scientific Topics", "url": "https://www.pnas.org/doi/abs/10.1073/pnas.0307752101", "description": "***Proceedings of the National Academy of Sciences***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=17382767110929995134\\&hl=zh-CN\\&as_sdt=0,5)]. Thomas L. Griffiths's analysis of scientific topics using Bayesian model."}, {"name": "Meta-assessment of Bias in Science", "url": "https://www.pnas.org/doi/10.1073/pnas.1618569114", "description": "***Proceedings of the National Academy of Sciences***, 2017. \\[[All Verisions](https://scholar.google.com/scholar?cluster=14575889060982308028\\&hl=zh-CN\\&as_sdt=0,5)]. An analysis of bias patterns and risk factors in science."}, {"name": "Slowed Canonical Progress in Large Fields of Science", "url": "https://www.pnas.org/doi/10.1073/pnas.2021636118", "description": "***Proceedings of the National Academy of Sciences***, 2021. \\[[All Verisions](https://scholar.google.com/scholar?cluster=7541922918797308487\\&hl=zh-CN\\&as_sdt=0,5)]. An analysis of why too many papers published each year in a field can lead to stagnation rather than advance."}, {"name": "HCI Research as Problem-Solving", "url": "https://dl.acm.org/doi/10.1145/2858036.2858283", "description": "***ACM SIGCHI'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=3206201064123443333\\&as_sdt=0,5)]. This essay contributes a meta-scientific account of human-computer interaction (HCI) research as problem-solving. We build on the philosophy of Larry Laudan, who develops problem and solution as the foundational concepts of science. We argue that most HCI research is about three main types of problem: empirical, conceptual, and constructive."}, {"name": "Structured information extraction from scientific text with large language models", "url": "https://www.nature.com/articles/s41467-024-45563-x", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=13694008040033857249)]. This paper presents a simple approach to joint named entity recognition and relation extraction and demonstrate how pretrained large language models can be fine-tuned to extract useful records of complex scientific knowledge. The authors test three representative tasks in materials chemistry: linking dopants and host materials, cataloging metal-organic frameworks, and general composition/phase/morphology/application information extraction."}, {"name": "Automated extraction of chemical synthesis actions from experimental procedures", "url": "https://www.nature.com/articles/s41467-020-17266-6", "description": "***Nature Communications***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=1626689948540815082)]. This paper presents a method to convert unstructured experimental procedures written in English to structured synthetic steps (action sequences) reflecting all the operations needed to successfully conduct the corresponding chemical reactions."}, {"name": "Inferring experimental procedures from text-based representations of chemical reactions", "url": "https://www.nature.com/articles/s41467-021-22951-1", "description": "***Nature Communications***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15772647675166217556)]. This paper presents data-driven models for predicting the entire sequence of synthesis steps starting from a textual representation of a chemical equation, for application in batch organic chemistry."}, {"name": "Language models and protocol standardization guidelines for accelerating synthesis planning in heterogeneous catalysis", "url": "https://www.nature.com/articles/s41467-023-43836-5", "description": "***Nature Communications***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=8186755371438552520)]. This paper introduces a transformer model for automated synthesis protocol analysis in catalyst discovery, exemplified using single-atom heterogeneous catalysts (SACs), a rapidly expanding catalyst family. The model adeptly converts SAC protocols into action sequences, and this output is used to facilitate statistical inference of their synthesis trends and applications, potentially expediting literature review and analysis."}, {"name": "An intelligent guided troubleshooting method for aircraft based on HybirdRAG", "url": "https://www.nature.com/articles/s41598-025-02643-2", "description": "***Scientific Reports***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=4924119792997395046)]. To enhance aircraft fault diagnosis efficiency, this paper proposes HybridRAG, an intelligent-guided troubleshooting framework that integrates knowledge graphs and large language models (LLMs). Unlike conventional retrieval-augmented generation (RAG) methods that rely on single-modal retrieval, HybridRAG adopts a multi-dimensional retrieval strategy, combining graph-based reasoning with both vector-based and BM25-based text retrieval techniques. This hybrid approach ensures comprehensive extraction of relevant information from both unstructured text and structured fault graphs, enhancing diagnostic precision, relevance, and robustness. Experimental results demonstrate that HybridRAG achieves an F1 score improvement of at least 4% and reduces hallucination rates by over 7% compared to mainstream RAG baselines. These advancements, combined with its unique integration of multi-modal retrieval, position HybridRAG as a novel framework for addressing complex aircraft maintenance challenges. Additionally, the paper presents an agent-based intelligent troubleshooting assistant that supports more interactive, adaptive, and flexible diagnostic Q\\&A, providing maintenance personnel with a significant advanced intelligent, context-aware diagnostic tool."}, {"name": "Dual retrieving and ranking medical large language model with retrieval augmented generation", "url": "https://www.nature.com/articles/s41598-025-00724-w", "description": "***Scientific Reports***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=9572966919397577345)]. Recent advancements in large language models (LLMs) have significantly enhanced text generation across various sectors; however, their medical application faces critical challenges regarding both accuracy and real-time responsiveness. To address these dual challenges, this work proposes a novel two-step retrieval and ranking retrieval-augmented generation (RAG) framework that synergistically combines embedding search with Elasticsearch technology. Built upon a dynamically updated medical knowledge base incorporating expert-reviewed documents from leading healthcare institutions, the hybrid architecture employs ColBERTv2 for context-aware result ranking while maintaining computational efficiency. Experimental results show a 10% improvement in accuracy for complex medical queries compared to standalone LLM and single-search RAG variants, while acknowledging that latency challenges remain in emergency situations requiring sub-second responses in an experimental setting, which can be achieved in real-time using more powerful hardware in real-world deployments. This work establishes a new paradigm for reliable medical AI assistants that successfully balances accuracy and practical deployment considerations."}, {"name": "Galactica: A Large Language Model for Science", "url": "https://galactica.org/static/paper.pdf", "description": "***Meta AI***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=15782429788006956926\\&hl=en\\&as_sdt=0,5)]. A large language model trained on large-scale scientific corpus."}, {"name": "CORWA: A Citation-Oriented Related Work Annotation Dataset", "url": "https://arxiv.org/abs/2205.03512", "description": "***NAACL'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=14605899782190710454\\&hl=en\\&as_sdt=0,5)]."}, {"name": "ESRA: Explainable Scientific Research Assistant", "url": "https://aclanthology.org/2021.acl-demo.14/", "description": "***ACL'21 Demo Track***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=4387915912582172679\\&hl=en\\&as_sdt=0,5)]. A tool for constructing and visualizing the knowledge graph of a query keyword in literature retrieving."}, {"name": "cite2vec: Citation-Driven Document Exploration via Word Embeddings", "url": "https://matthewberger.github.io/papers/cite2vec.pdf", "description": "***IEEE Transactions on Visualization and Computer Graphics***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=6949650208780085923\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Galex: Exploring the evolution and intersection of disciplines", "url": "http://cic.tju.edu.cn/faculty/zhangjiawan/Jiawan_Zhang_files/paper/zeyuli2020.pdf", "description": "***IEEE Transactions on Visualization and Computer Graphics***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=13313104491218225635\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The uses of argument", "url": "http://library.lol/main/8036CBB1CCC448CA7E036774D810EBC0", "description": "***Cambridge University Press***, 1958. \\[[All Versions](https://scholar.google.com/scholar?cluster=12052408655432810103\\&hl=en\\&as_sdt=0,5)]. Stephen Toulmin's introduction to the Toulmin argument pattern, which is generally consist of a claim, a justification, and a rebuttal."}, {"name": "A tagmemic approach to paragraph analysis", "url": "https://www.jstor.org/stable/355200", "description": "***College Composition and Communication***, 1965. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=A+Tagmemic+Approach+to+Paragraph+Analysis+AL+Becker\\&btnG=)]. The original paper on analyzing the structure of expository paragraphs, with the two patterns---the Topic-Restriction-Illustration pattern and the Problem-Solution pattern."}, {"name": "The uses and complexity of argument structures in expert and student persuasive writing", "url": "https://journals.sagepub.com/doi/abs/10.1177/0741088398015002004", "description": "***Written Communication***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=3218190258774062869\\&hl=en\\&as_sdt=0,5)]. A behaviorial study revealing the argument structures exploited by people in argumentative writing."}, {"name": "Towards an argument interchange format", "url": "https://pure.mpg.de/rest/items/item_3020351/component/file_3045811/content", "description": "***The Knowledge Engineering Review***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=11123720528835823517\\&hl=en\\&as_sdt=0,5)]. The original paper introducing the Argument Interchange Format (AIF) framework for argumentation analysis."}, {"name": "Speech Acts of Argumentation: Inference Anchors and Peripheral Cues in Dialogue", "url": "https://www.aaai.org/ocs/index.php/WS/AAAIW11/paper/viewFile/3940/4244", "description": "***AAAI'12***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=9761955212933152906\\&hl=en\\&as_sdt=0,5)]. The original paper introducing the Information Anchoring Theory (IAT) as an alternate for AIF."}, {"name": "Cognitive Science and Science Education", "url": "https://www.harvardlds.org/wp-content/uploads/2018/05/Carey-Cognitive-science-and-science-education.-American-Psychologist.pdf", "description": "***American Psychologist***, 1986. \\[[All Versions](https://scholar.google.com/scholar?cluster=6627805813997387166\\&hl=en\\&as_sdt=0,5)]. Susan Carey's review on cognitive-science-based methodologies for science education research."}, {"name": "PersLEARN: Research Training through the Lens of Perspective Cultivation", "url": "https://aclanthology.org/2023.acl-demo.2/", "description": "***ACL'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=6242389165210232890)]. Scientific research is inherently shaped by its authors\u2019 perspectives, influenced by various factors such as their personality, community, or society. Junior researchers often face challenges in identifying the perspectives reflected in the existing literature and struggle to develop their own viewpoints. To address the problem, this paper introduces PersLEARN, a tool designed to facilitate the cultivation of scientific perspectives, starting from a basic seed idea and progressing to a well-articulated framework."}, {"name": "Reproducibility", "url": "https://www.science.org/doi/full/10.1126/science.1250475", "description": "***Science***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=676974831306442279\\&hl=en\\&as_sdt=0,10)]."}, {"name": "Bridging the information gap in organic chemical reactions", "url": "https://www.nature.com/articles/s41557-024-01470-8", "description": "***Nature Chemistry***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=5365091261196953334)]. This perspective article formulates eight principles to improve data management in scientific publications relating to data standardization, reproducibility and evaluation, and encourage scientists to go beyond current publication standards."}, {"name": "A manifesto for reproducible science", "url": "https://www.nature.com/articles/s41562-016-0021", "description": "***Nature Human Behavior***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=9515807942859203900\\&hl=en\\&as_sdt=0,10)]."}, {"name": "1,500 scientists lift the lid on reproducibility", "url": "https://www.nature.com/articles/533452a", "description": "***Nature***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=11479406257389837824\\&hl=en\\&as_sdt=0,5)]."}, {"name": "How to Make More Published Research True", "url": "https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4204808/", "description": "***PLoS Medicine***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=10945341175996677908)]."}, {"name": "Six factors affecting reproducibility in life science research and how to handle them", "url": "https://www.nature.com/articles/d42473-019-00004-y", "description": "***Nature Advertisement***."}, {"name": "Five keys to writing a reproducible lab protocol", "url": "https://www.nature.com/articles/d41586-021-02428-3", "description": "***Nature***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=13259206850261301938)]. This interviewing paper introduces five ways to increase the reproducibility of experimental protocols: (i) documenting protocols as the experiment goes; (ii) providing video illustrations in addition to written protocols; (iii) using electronic lab notebooks (ELNs) for managing experimental resources digitally; (iv) depositing and documenting reagents with understanding the rationale behind every step; and (v) exploiting online platforms to share tips, extensions, methods, and data among researchers."}, {"name": "The Experimental Design Assistant", "url": "https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.2003779", "description": "***PLoS Biology***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=12481490526120919925)]. \\[[Nature Methods Correspondence](https://www.nature.com/articles/nmeth.4462)]. \\[[EDA Website](https://eda.nc3rs.org.uk/)]. The EDA is a web-based tool that guides the in vivo researcher through the experimental design and analysis process, providing automated feedback on the proposed design and generating a graphical summary that aids communication with colleagues, funders, regulatory authorities, and the wider scientific community."}, {"name": "Reconfigurable system for automated optimization of diverse chemical reactions", "url": "https://www.science.org/doi/full/10.1126/science.aat0650", "description": "***Science***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=3076614068291119943)]. \\[[Preprint](https://www.science.org/doi/pdf/10.1126/science.aat0650)]. This paper describes a plug-and-play, continuous-flow chemical synthesis system that mitigates this challenge with an integrated combination of hardware, software, and analytics. The system software controls the user-selected reagents and unit operations (reactors and separators), processes reaction analytics (high-performance liquid chromatography, mass spectrometry, vibrational spectroscopy), and conducts automated optimizations."}, {"name": "A universal system for digitization and automatic execution of the chemical synthesis literature", "url": "https://www.science.org/doi/full/10.1126/science.abc2986", "description": "***Science***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=13909991218383718512)]. \\[[Preprint](https://www.chem.gla.ac.uk/cronin/images/pubs/Mehr-ScienceOct2020.pdf)]. \\[[XDL Documentation](https://croningroup.gitlab.io/chemputer/xdl/index.html)]. \\[[XDL Schema Database](https://zenodo.org/records/3955107)]. This paper reports a software platform that uses natural language processing to translate the organic chemistry literature directly into editable code, which in turn can be compiled to drive automated synthesis of the compound in the laboratory."}, {"name": "Digitization and validation of a chemical synthesis literature database in the ChemPU", "url": "https://www.science.org/doi/full/10.1126/science.abo0058", "description": "***Science***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=17368503277308594977)]. \\[[Preprint](https://www.researchgate.net/profile/Aamir-Khan/publication/361857872_Digitization_and_validation_of_a_chemical_synthesis_literature_database_in_the_ChemPU/links/62cd356d00d0b451104cbfe9/Digitization-and-validation-of-a-chemical-synthesis-literature-database-in-the-ChemPU.pdf)]. This paper presents an automatically executable chemical reaction database of 100 molecules representative of the range of reactions found in contemporary organic synthesis. The chemical reaction codes or \u03c7DLs for the reactions have been stored in a database for version control, validation, collaboration, and data mining. Of these syntheses, more than 50 entries from the database have been downloaded and robotically run in seven modular chemputers with yields and purities comparable to those achieved by an expert chemist."}, {"name": "Chemputation and the Standardization of Chemical Informatics", "url": "https://pubs.acs.org/doi/full/10.1021/jacsau.1c00303", "description": "***Journal of the American Chemical Society (Au)***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=3884902150148113559)]. This paper describes a standard hardware (the chemical processing programming architecture --- the ChemPU) to encompass all chemical synthesis, an approach which unifies all chemistry automation strategies, from solid-phase peptide synthesis, to HTE flow chemistry platforms, while at the same time establishing a publication standard so that researchers can exchange chemical code (\u03c7DL) to ensure reproducibility and interoperability."}, {"name": "An autonomous portable platform for universal chemical synthesis", "url": "https://www.nature.com/articles/s41557-022-01016-w", "description": "***Nature Chemistry***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=4484997534431409967)]. \\[[Preprint](https://eprints.gla.ac.uk/275574/)]. This paper presents a portable suitcase-sized chemical synthesis platform containing all the modules required for synthesis and purification. The system uses a chemical programming language coupled to a digital reactor generator to produce reactors and executable protocols based on text-based literature syntheses. Simultaneously, the platform generates a reaction pressure fingerprint, used to monitor processes within the reactors and remotely perform a protocol quality control."}, {"name": "A mobile robotic chemist", "url": "https://www.nature.com/articles/s41586-020-2442-2", "description": "***Nature***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=13216902493789027324\\&hl=en\\&as_sdt=0,5)]. \\[[Preprint](https://strathprints.strath.ac.uk/74759/1/Burger_etal_Nature_2020_A_mobile_robotic.pdf)]. This work uses a mobile robot to search for improved photocatalysts for hydrogen production from water. The robot operated autonomously over eight days, performing 688 experiments within a ten-variable experimental space, driven by a batched Bayesian search algorithm. This autonomous search identified photocatalyst mixtures that were six times more active than the initial formulations, selecting beneficial components and deselecting negative ones."}, {"name": "An autonomous laboratory for the accelerated synthesis of novel materials", "url": "https://www.nature.com/articles/s41586-023-06734-w", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=17944003281308189532)]. This paper introduces the A-Lab, an autonomous laboratory for the solid-state synthesis of inorganic powders. This platform uses computations, historical data from the literature, machine learning (ML) and active learning to plan and interpret the outcomes of experiments performed using robotics. Over 17\u2009days of continuous operation, the A-Lab realized 41 novel compounds from a set of 58 targets including a variety of oxides and phosphates that were identified using large-scale ab initio phase-stability data from the Materials Project and Google DeepMind."}, {"name": "The Internet of Things comes to the lab", "url": "https://www.nature.com/articles/542125a", "description": "***Nature***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=7747117198956166976\\&hl=en\\&as_sdt=0,5)]. The emergence of connected instruments and equipment promises to untether researchers from the laboratory --- letting them fine-tune experiments and analyse data remotely."}, {"name": "A dynamic knowledge graph approach to distributed self-driving laboratories", "url": "https://www.nature.com/articles/s41467-023-44599-9", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=7070798385652764751)]. This work employs ontologies to capture data and material flows in design-make-test-analyse cycles, utilising autonomous agents as executable knowledge components to carry out the experimentation workflow. Data provenance is recorded to ensure its findability, accessibility, interoperability, and reusability. The architecture is built upon the World Avatar project, which seeks to create an all-encompassing digital twin based on a dynamic knowledge graph."}, {"name": "Automation isn't automatic", "url": "https://pubs.rsc.org/en/content/articlehtml/2021/sc/d1sc04588a", "description": "***Chemical Science***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=14176714971050097971)]. This perspective provides an overview of the current state of automation of synthetic chemistry at the benchtop scale with a particular emphasis on core considerations and the ensuing challenges of deploying a system. The authors aim to reframe automation as decidedly not automatic but rather an iterative process that involves a series of careful decisions (both human and computational) and constant adjustment."}, {"name": "Balancing act: when to flex and when to stay fixed", "url": "https://www.cell.com/trends/chemistry/fulltext/S2589-5974\\(23\\", "description": ""}, {"name": "What is a minimal working example for a self-driving laboratory?", "url": "https://www.sciencedirect.com/science/article/pii/S2590238522006385", "description": "***Matter***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=1612804023616680548)]. This paper proposes SDL-Demo: a low-cost \u201cHello, World!\u201d for self-driving laboratories that combines \u201cHello, World!\u201d tasks from electronics, physics-based simulations, and optimization. SDL-Demo is modular and extensible, making it an ideal candidate for low-cost teaching and prototyping of self-driving laboratory concepts."}, {"name": "Robotic search for optimal cell culture in regenerative medicine", "url": "https://elifesciences.org/articles/77007", "description": "***eLife***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=1330075145723138159)]. This paper develops a robotic AI system with a batch Bayesian optimization algorithm that autonomously induces the differentiation of induced pluripotent stem cell-derived retinal pigment epithelial (iPSC-RPE) cells. From 200 million possible parameter combinations, the system performed cell culture in 143 different conditions in 111 days, resulting in 88% better iPSC-RPE production than that obtained by the pre-optimized culture in terms of the pigmentation scores."}, {"name": "Balancing autonomy and expertise in autonomous synthesis laboratories", "url": "https://www.nature.com/articles/s43588-025-00769-x", "description": "***Nature Computational Science***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=2487456887760587329)]. Autonomous synthesis laboratories promise to streamline the plan\u2013make\u2013measure\u2013analyze iteration loop. Here, the authors comment on the barriers in the field, the promise of a human on-the-loop approach, and strategies for optimizing accessibility, accuracy, and efficiency of autonomous laboratories."}, {"name": "AlphaFlow: autonomous discovery and optimization of multi-step chemistry using a self-driven fluidic lab guided by reinforcement learning", "url": "https://www.nature.com/articles/s41467-023-37139-y", "description": "***Nature Communications***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=14092546584501434626)]. Closed-loop, autonomous experimentation enables accelerated and material-efficient exploration of large reaction spaces without the need for user intervention. However, autonomous exploration of advanced materials with complex, multi-step processes and data sparse environments remains a challenge. In this work, the authors present AlphaFlow, a self-driven fluidic lab capable of autonomous discovery of complex multi-step chemistries. AlphaFlow uses reinforcement learning integrated with a modular microdroplet reactor capable of performing reaction steps with variable sequence, phase separation, washing, and continuous in-situ spectral monitoring. To demonstrate the power of reinforcement learning toward high dimensionality multi-step chemistries, the authors use AlphaFlow to discover and optimize synthetic routes for shell-growth of core-shell semiconductor nanoparticles, inspired by colloidal atomic layer deposition (cALD). Without prior knowledge of conventional cALD parameters, AlphaFlow successfully identified and optimized a novel multi-step reaction route, with up to 40 parameters, that outperformed conventional sequences. Through this work, the authors demonstrate the capabilities of closed-loop, reinforcement learning-guided systems in exploring and solving challenges in multi-step nanoparticle syntheses, while relying solely on in-house generated data from a miniaturized microfluidic platform. Further application of AlphaFlow in multi-step chemistries beyond cALD can lead to accelerated fundamental knowledge generation as well as synthetic route discoveries and optimization."}, {"name": "Scientific discovery in the age of artificial intelligence", "url": "https://www.nature.com/articles/s41586-023-06221-2", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11962817646389491592)]. A review article that examines breakthroughs over the past decade that include self-supervised learning, which allows models to be trained on vast amounts of unlabelled data, and geometric deep learning, which leverages knowledge about the structure of scientific data to enhance model accuracy and efficiency."}, {"name": "Artificial Intelligence for Retrosynthetic Planning Needs Both Data and Expert Knowledge", "url": "https://pubs.acs.org/doi/full/10.1021/jacs.4c00338", "description": "***Journal of the American Chemical Society***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=10595951443492961310)]. The development of AI synthesis planners trained solely on reaction-example-data has stagnated and is not on par with the performance of \u201chybrid\u201d algorithms combining AI with expert knowledge. This Perspective examines possible causes of these shortcomings, extending beyond the established reasoning of insufficient quantities of reaction data. Drawing attention to the intricacies and data biases that are specific to the domain of synthetic chemistry, the authors advocate augmenting the unique capabilities of AI with the knowledge base and the reasoning strategies of domain experts. By actively involving synthetic chemists, who are the end users of any synthesis planning software, into the development process, the authors envision to bridge the gap between computer algorithms and the intricate nature of chemical synthesis."}, {"name": "The Impact of Large Language Models on Scientific Discovery: a Preliminary Study using GPT-4", "url": "https://arxiv.org/abs/2311.07361", "description": "***Microsoft Research AI4Science***, 2023. \\[[All Versions](https://scholar.google.com/scholar?%2C5\\&q=The+Impact+of+Large+Language+Models+on+Scientific+Discovery%3A+a+Preliminary+Study+using+GPT-4\\&btnG=)]. \\[[Project (\u2b5077)](https://github.com/microsoft/LLM4ScientificDiscovery)]. A survey on the performance of LLMs within the context of scientific discovery, focusing on GPT-4."}, {"name": "An agentic system for rare disease diagnosis with traceable reasoning", "url": "https://www.nature.com/articles/s41586-025-10097-9", "description": "***Nature***, 2026. \\[[All Versions](https://scholar.google.com/scholar?cluster=586452159650802493)]. Rare diseases affect more than 300\u2009million people worldwide, yet timely and accurate diagnosis remains an urgent challenge. Patients often endure a prolonged \u2018diagnostic odyssey\u2019 exceeding 5\u2009years, marked by repeated referrals, misdiagnoses and unnecessary interventions, leading to delayed treatment and substantial emotional and economic burden. This work presents DeepRare---a multi-agent system for rare disease differential diagnosis decision support powered by large language models, integrating more than 40 specialized tools and up-to-date knowledge sources. DeepRare processes heterogeneous clinical inputs, including free-text descriptions, structured human phenotype ontology terms and genetic testing results to generate ranked diagnostic hypotheses with transparent reasoning linked to verifiable medical evidence. Evaluated across nine datasets from literature, case reports and clinical centres across Asia, North America and Europe spanning 14 medical specialties, DeepRare demonstrates exceptional performance on 2,919 diseases. In human-phenotype-ontology-based tasks, it achieves an average Recall\\@1 of 57.18%, outperforming the next best method by 23.79%; in multi-modal tests, it reaches 69.1% compared with Exomiser\u2019s 55.9% on 168 cases. Expert review achieved 95.4% agreement on its reasoning chains, confirming their validity and traceability. This work not only advances rare disease diagnosis but also demonstrates how the latest powerful large-language-model-driven agentic systems can reshape current clinical workflows."}, {"name": "Machine learning-assisted molecular design and efficiency prediction for high-performance organic photovoltaic materials", "url": "https://www.science.org/doi/full/10.1126/sciadv.aay4275", "description": "***Science Advances***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=12392230644945701722)]. In the process of finding high-performance materials for organic photovoltaics (OPVs), it is meaningful if one can establish the relationship between chemical structures and photovoltaic properties even before synthesizing them. This work first establishes a database containing over 1700 donor materials reported in the literature. Through supervised learning, our machine learning (ML) models can build up the structure-property relationship and, thus, implement fast screening of OPV materials. The authors explore several expressions for molecule structures, i.e., images, ASCII strings, descriptors, and fingerprints, as inputs for various ML algorithms. It is found that fingerprints with length over 1000 bits can obtain high prediction accuracy. The reliability of the approach is further verified by screening 10 newly designed donor materials. Good consistency between model predictions and experimental outcomes is obtained. The result indicates that ML is a powerful tool to prescreen new OPV materials, thus accelerating the development of the OPV field."}, {"name": "Design of metalloproteins and novel protein folds using variational autoencoders", "url": "https://www.nature.com/articles/s41598-018-34533-1", "description": "***Scientific Reports***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=18126187509308242959)]. The design of novel proteins has many applications but remains an attritional process with success in isolated cases. Meanwhile, deep learning technologies have exploded in popularity in recent years and are increasingly applicable to biology due to the rise in available data. This work attempts to link protein design and deep learning by using variational autoencoders to generate protein sequences conditioned on desired properties. Potential copper and calcium binding sites are added to non-metal binding proteins without human intervention and compared to a hidden Markov model. In another use case, a grammar of protein structures is developed and used to produce sequences for a novel protein topology. One candidate structure is found to be stable by molecular dynamics simulation. The ability of the model to confine the vast search space of protein sequences and to scale easily has the potential to assist in a variety of protein design tasks."}, {"name": "Highly accurate protein structure prediction with AlphaFold", "url": "https://www.nature.com/articles/s41586-021-03819-2", "description": "***Nature***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=6286436358625670901)]. This paper provides the first computational method that can regularly predict protein structures with atomic accuracy even in cases in which no similar structure is known. This approach is a canonical application of observation- and explanation- based method for protein structure prediction instead of first-principle-based methods."}, {"name": "Human\u2013machine collaboration for improving semiconductor process development", "url": "https://www.nature.com/articles/s41586-023-05773-7", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=10295771969614897767)]. \\[[Nature News](https://www.nature.com/articles/d41586-023-01353-x)]. This work studies Bayesian optimization algorithms to investigate how artificial intelligence (AI) might decrease the cost of developing complex semiconductor chip processes. In particular, this work create a controlled virtual process game to systematically benchmark the performance of humans and computers for the design of a semiconductor fabrication process. The authors find that human engineers excel in the early stages of development, whereas the algorithms are far more cost-efficient near the tight tolerances of the target."}, {"name": "A foundation model for generalizable disease detection from retinal images", "url": "https://www.nature.com/articles/s41586-023-06555-x", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=3139988207343394501)]. This paper presents RETFound, a foundation model for retinal images that learns generalizable representations from unlabelled retinal images and provides a basis for label-efficient model adaptation in several applications. Specifically, RETFound is trained on 1.6\u2009million unlabelled retinal images by means of self-supervised learning and then adapted to disease detection tasks with explicit labels."}, {"name": "Accurate medium-range global weather forecasting with 3D neural networks", "url": "https://www.nature.com/articles/s41586-023-06185-3", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=7198604620204619820)]. This paer introduces an artificial-intelligence-based method for accurate, medium-range global weather forecasting. It shows that three-dimensional deep networks equipped with Earth-specific priors are effective at dealing with complex patterns in weather data, and that a hierarchical temporal aggregation strategy reduces accumulation errors in medium-range forecasting. Trained on 39\u2009years of global data, the program, Pangu-Weather, obtains stronger deterministic forecast results on reanalysis data in all tested variables when compared with the world\u2019s best NWP system, the operational integrated forecasting system of the European Centre for Medium-Range Weather Forecasts."}, {"name": "Learning skillful medium-range global weather forecasting", "url": "https://www.science.org/doi/10.1126/science.adi2336", "description": "***Science***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=269756601245477923\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Skilful nowcasting of extreme precipitation with NowcastNet", "url": "https://www.nature.com/articles/s41586-023-06184-4", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=17837864391812838009\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Autonomous chemical research with large language models", "url": "https://www.nature.com/articles/s41586-023-06792-0", "description": "***Nature***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=8097577445064259203)]. An artificial intelligence system driven by GPT-4 that autonomously designs, plans and performs complex experiments by incorporating large language models empowered by tools such as internet and documentation search, code execution and experimental automation."}, {"name": "Augmenting large language models with chemistry tools", "url": "https://www.nature.com/articles/s42256-024-00832-8", "description": "***Nature Machine Intelligence***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=9291969834799338362)]. \\[[Preprint](https://arxiv.org/abs/2304.05376)]. This paper introduces ChemCrow, an LLM chemistry agent designed to accomplish tasks across organic synthesis, drug discovery and materials design. By integrating 18 expert-designed tools and using GPT-4 as the LLM, ChemCrow augments the LLM performance in chemistry, and new capabilities emerge. The agent autonomously planned and executed the syntheses of an insect repellent and three organocatalysts and guided the discovery of a novel chromophore."}, {"name": "Empowering biomedical discovery with AI agents", "url": "https://www.cell.com/cell/fulltext/S0092-8674\\(24\\", "description": ""}, {"name": "DrBioRight 2.0: an LLM-powered bioinformatics chatbot for large-scale cancer functional proteomics analysis", "url": "https://www.nature.com/articles/s41467-025-57430-4", "description": "***Nature Communications***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=4899547492027803190)]. \\[[Project](https://drbioright.org)]. Functional proteomics provides critical insights into cancer mechanisms, facilitating the discovery of novel biomarkers and therapeutic targets. The authors have developed a comprehensive cancer functional proteomics resource using reverse phase protein arrays, incorporating data from nearly 8000 patient samples from The Cancer Genome Atlas and approximately 900 samples from the Cancer Cell Line Encyclopedia. The dataset includes a curated panel of nearly 500 high-quality antibodies, covering all major cancer hallmark pathways. To enhance the accessibility and analytic power of this resource, this work introduces DrBioRight 2.0, an intuitive bioinformatic platform powered by state-of-the-art large language models. DrBioRight enables researchers to explore protein-centric cancer omics data, perform advanced analyses, visualize results, and engage in interactive discussions using natural language. By streamlining complex proteogenomic analyses, this tool accelerates the translation of large-scale functional proteomics data into meaningful biomedical insights."}, {"name": "The Virtual Lab of AI agents designs new SARS-CoV-2 nanobodies", "url": "https://www.nature.com/articles/s41586-025-09442-9", "description": "***Nature***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=9384650162839457416)]. Science frequently benefits from teams of interdisciplinary researchers, but many scientists do not have easy access to experts from multiple fields. Although large language models (LLMs) have shown an impressive ability to aid researchers across diverse domains, their uses have been largely limited to answering specific scientific questions rather than performing open-ended research. Here the authors expand the capabilities of LLMs for science by introducing the Virtual Lab, an artificial intelligence (AI)\u2013human research collaboration to perform sophisticated, interdisciplinary science research. The Virtual Lab consists of an LLM Principal Investigator agent guiding a team of LLM scientist agents through a series of research meetings, with a human researcher providing high-level feedback. The authors applied the Virtual Lab to design nanobody binders to recent variants of SARS-CoV-2. The Virtual Lab created a novel computational nanobody design pipeline that incorporates the protein language model ESM, the protein folding model AlphaFold-Multimer and the computational biology software Rosetta and designed 92 new nanobodies. Experimental validation reveals a range of functional nanobodies with promising binding profiles across SARS-CoV-2 variants. In particular, two new nanobodies exhibit improved binding to the recent JN.1 or KP.3 variants while maintaining strong binding to the ancestral viral spike protein, suggesting that these are suitable candidates for further investigation. This work demonstrates how the Virtual Lab can rapidly make an impactful, real-world scientific discovery."}, {"name": "BioPlanner: Automatic Evaluation of LLMs on Protocol Planning in Biology", "url": "https://aclanthology.org/2023.emnlp-main.162/", "description": "***EMNLP'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=1222312709622462659)]. \\[[Project (\u2b5028)](https://github.com/bioplanner/bioplanner)]. This paper presents an automatic evaluation framework for the task of planning experimental protocols, and introduces BioProt: a dataset of biology protocols with corresponding pseudocode representations."}, {"name": "From intention to implementation: automating biomedical research via LLMs", "url": "https://link.springer.com/article/10.1007/s11432-024-4485-0", "description": "***Science China Information Sciences***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=15681173257674232428)]. Conventional biomedical research is increasingly labor-intensive due to the exponential growth of scientific literature and datasets. Artificial intelligence (AI), particularly large language models (LLMs), has the potential to revolutionize this process by automating various steps. Still, significant challenges remain, including the need for multidisciplinary expertise, logicality of experimental design, and performance measurements. This paper introduces BioResearcher, the first end-to-end automated system designed to streamline the entire biomedical research process involving dry lab experiments. BioResearcher employs a modular multi-agent architecture, integrating specialized agents for search, literature processing, experimental design, and programming. By decomposing complex tasks into logically related sub-tasks and utilizing a hierarchical learning approach, BioResearcher effectively addresses the challenges of multidisciplinary requirements and logical complexity. Furthermore, BioResearcher incorporates an LLM-based reviewer for in-process quality control and introduces novel evaluation metrics to assess the quality and automation of experimental protocols. BioResearcher successfully achieves an average execution success rate of 63.07% across eight previously unmet research objectives. The generated protocols, on average, outperform typical agent systems by 22.0% on five quality metrics. The system demonstrates significant potential to reduce researchers\u2019 workloads and accelerate biomedical discoveries, paving the way for future innovations in automated research systems."}, {"name": "A human-machine interface for automatic exploration of chemical reaction networks", "url": "https://www.nature.com/articles/s41467-024-47997-9", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=13306522324804014261)]. Autonomous reaction network exploration algorithms offer a systematic approach to explore mechanisms of complex chemical processes. However, the resulting reaction networks are so vast that an exploration of all potentially accessible intermediates is computationally too demanding. This paper introduces a STEERING WHEEL to guide an otherwise unbiased automated exploration. The STEERING WHEEL algorithm is intuitive, generally applicable, and enables one to focus on specific regions of an emerging network. It also allows for guiding automated data generation in the context of mechanism exploration, catalyst design, and other chemical optimization challenges."}, {"name": "Active learning accelerates electrolyte solvent screening for anode-free lithium metal batteries", "url": "https://www.nature.com/articles/s41467-025-63303-7", "description": "***Nature Communications***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=3974490115470252870)]. Anode-free or \u2018zero-excess\u2019 lithium metal batteries offer high energy density compared to current lithium-ion batteries but require electrolyte innovation to extend cycle life. Due to the lack of universal design principles, electrolyte development for anode-free lithium metal batteries is slow and incremental and mainly driven by trial-and-error. This work demonstrates the use of active learning as an alternative approach to accelerate electrolyte discovery for anode-free lithium metal batteries. Unlike conventional data-intensive frequentist machine learning techniques, the active learning framework employs sequential Bayesian experimental design with Bayesian model averaging to efficiently identify optimal candidates in typical data-scarce and noisy label settings. Using capacity retention in real Cu||LiFePO4 cells as the target property, the approach integrates experimental feedback to iteratively refine predictions. Starting with just 58 data points from an in-house cycling dataset, the active learning framework explored a virtual search space of 1 million electrolytes, rapidly converging on optimal candidates. After seven active learning campaigns with about ten electrolytes tested in each, four distinct electrolyte solvents are identified that rival state-of-the-art electrolytes in performance. This work showcases the promise of active learning approaches in navigating large electrolyte chemical spaces for next-generation batteries."}, {"name": "PatCID: an open-access dataset of chemical structures in patent documents", "url": "https://www.nature.com/articles/s41467-024-50779-y", "description": "***Nature Communications***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=329287456191953845)]. The automatic analysis of patent publications has potential to accelerate research across various domains, including drug discovery and material science. Within patent documents, crucial information often resides in visual depictions of molecule structures. PatCID (Patent-extracted Chemical-structure Images database for Discovery) allows to access such information at scale. It enables users to search which molecules are displayed in which documents. PatCID contains 81M chemical-structure images and 14M unique chemical structures. This work compares PatCID with state-of-the-art chemical patent-databases. On a random set, PatCID retrieves 56.0% of molecules, which is higher than automatically-created databases, Google Patents (41.5%) and SureChEMBL (23.5%), as well as manually-created databases, Reaxys (53.5%) and SciFinder (49.5%). Leveraging state-of-the-art methods of document understanding, PatCID high-quality data outperforms currently available automatically-generated patent-databases. PatCID even competes with proprietary manually-created patent-databases. This enables promising applications for automatic literature review and learning-based molecular generation methods."}, {"name": "Large language models for scientific discovery in molecular property prediction", "url": "https://www.nature.com/articles/s42256-025-00994-z", "description": "***Nature Machine Intelligence***, 2025. \\[[All Versions](https://scholar.google.com/scholar?cluster=12679596096313341977)]. Large language models (LLMs) are a form of artificial intelligence system encapsulating vast knowledge in the form of natural language. These systems are adept at numerous complex tasks including creative writing, storytelling, translation, question-answering, summarization and computer code generation. Although LLMs have seen initial applications in natural sciences, their potential for driving scientific discovery remains largely unexplored. This work introduces LLM4SD, a framework designed to harness LLMs for driving scientific discovery in molecular property prediction by synthesizing knowledge from literature and inferring knowledge from scientific data. LLMs synthesize knowledge by extracting established information from scientific literature, such as molecular weight being key to predicting solubility. For inference, LLMs identify patterns in molecular data, particularly in Simplified Molecular Input Line Entry System-encoded structures, such as halogen-containing molecules being more likely to cross the blood\u2013brain barrier. This information is presented as interpretable knowledge, enabling the transformation of molecules into feature vectors. By using these features with interpretable models such as random forest, LLM4SD can outperform the current state of the art across a range of benchmark tasks for predicting molecular properties. The authors foresee it providing interpretable and potentially new insights, aiding scientific discovery in molecular property prediction."}, {"name": "Retrosynthesis prediction using an end-to-end graph generative architecture for molecular graph editing", "url": "https://www.nature.com/articles/s41467-023-38851-5", "description": "***Nature Communications***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=8204732491203332966)]. Retrosynthesis planning, the process of identifying a set of available reactions to synthesize the target molecules, remains a major challenge in organic synthesis. Recently, computer-aided synthesis planning has gained renewed interest and various retrosynthesis prediction algorithms based on deep learning have been proposed. However, most existing methods are limited to the applicability and interpretability of model predictions, and further improvement of predictive accuracy to a more practical level is still required. In this work, inspired by the arrow-pushing formalism in chemical reaction mechanisms, the authors present an end-to-end architecture for retrosynthesis prediction called Graph2Edits. Specifically, Graph2Edits is based on graph neural network to predict the edits of the product graph in an auto-regressive manner, and sequentially generates transformation intermediates and final reactants according to the predicted edits sequence. This strategy combines the two-stage processes of semi-template-based methods into one-pot learning, improving the applicability in some complicated reactions, and also making its predictions more interpretable. Evaluated on the standard benchmark dataset USPTO-50k, the model achieves the state-of-the-art performance for semi-template-based retrosynthesis with a promising 55.1% top-1 accuracy."}, {"name": "ChipNeMo: Domain-Adapted LLMs for Chip Design", "url": "https://arxiv.org/abs/2311.00176", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=5962372610489019326)]. ChipNeMo aims to explore the applications of large language models (LLMs) for industrial chip design. Instead of directly deploying off-the-shelf commercial or open-source LLMs, the authors instead adopt the following domain adaptation techniques: domain-adaptive tokenization, domain-adaptive continued pretraining, model alignment with domain-specific instructions, and domain-adapted retrieval models. The authors evaluate these methods on three selected LLM applications for chip design: an engineering assistant chatbot, EDA script generation, and bug summarization and analysis. Evaluations demonstrate that domain-adaptive pretraining of language models, can lead to superior performance in domain related downstream tasks compared to their base LLaMA2 counterparts, without degradations in generic capabilities. In particular, the largest model, ChipNeMo-70B, outperforms the highly capable GPT-4 on two of the use cases, namely engineering assistant chatbot and EDA scripts generation, while exhibiting competitive performance on bug summarization and analysis. These results underscore the potential of domain-specific customization for enhancing the effectiveness of large language models in specialized applications."}, {"name": "Single-atom alloy catalysts designed by first-principles calculations and artificial intelligence", "url": "https://www.nature.com/articles/s41467-021-22048-9", "description": "***Nature Communications***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=6593978922251447907)]. This paper addresses the problem of new Single-atom-alloy catalysts (SAACs) discovery by applying a compressed-sensing data-analytics approach parameterized with density-functional inputs."}, {"name": "Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences", "url": "https://www.pnas.org/doi/abs/10.1073/pnas.2016239118", "description": "***Proceedings of the National Academy of Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15181490380139888639\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Comparability of automated human induced pluripotent stem cell culture: a pilot study", "url": "https://link.springer.com/article/10.1007/s00449-016-1659-9", "description": "***Bioprocess and Biosystems Engineering***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=14666375402220991095\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Virtual and augmented reality for biomedical applications", "url": "https://www.cell.com/cell-reports-medicine/fulltext/S2666-3791\\(21\\", "description": ""}, {"name": "An augmented reality microscope with real-time artificial intelligence integration for cancer diagnosis", "url": "https://www.nature.com/articles/s41591-019-0539-7", "description": "***Nature Medicine***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=3280260879383275625)]. The microscopic assessment of tissue samples is instrumental for the diagnosis and staging of cancer, and thus guides therapy. However, these assessments demonstrate considerable variability and many regions of the world lack access to trained pathologists. Though artificial intelligence (AI) promises to improve the access and quality of healthcare, the costs of image digitization in pathology and difficulties in deploying AI solutions remain as barriers to real-world use. This work proposes a cost-effective solution: the augmented reality microscope (ARM). The ARM overlays AI-based information onto the current view of the sample in real time, enabling seamless integration of AI into routine workflows."}, {"name": "Optimizing Spaced Repetition Schedule by Capturing the Dynamics of Memory", "url": "https://ieeexplore.ieee.org/abstract/document/10059206", "description": "***IEEE Transactions on Knowledge and Data Engineering***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=949715967083833369\\&hl=en\\&as_sdt=0,10)]."}, {"name": "LEGAL-BERT: The Muppets straight out of Law School", "url": "https://aclanthology.org/2020.findings-emnlp.261/", "description": "***EMNLP'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=11254432523766039890\\&hl=en\\&as_sdt=0,5)]. Generating answers to legal questions, analyze contracts, and summarizing legal documents, making legal knowledge more accessible to non-experts."}, {"name": "BioBERT: a pre-trained biomedical language representation model for biomedical text mining", "url": "https://academic.oup.com/bioinformatics/article/36/4/1234/5566506", "description": "***Bioinformatics***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=2783127196632783403\\&hl=en\\&as_sdt=0,5)]. Answering medical questions, identifying relevant clinical trials, and diagnosing diseases based on symptoms, making medical information more accessible to the general public."}, {"name": "Finbert: A pre-trained financial language representation model for financial text mining", "url": "https://dl.acm.org/doi/abs/10.5555/3491440.3492062", "description": "***IJCAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=17844713837232165872\\&hl=en\\&as_sdt=0,5)]. Predicting stock market trends, analyzing financial documents, and generating summaries of economic news articles, helping to disseminate financial knowledge."}, {"name": "SciBERT: A Pretrained Language Model for Scientific Text", "url": "https://aclanthology.org/D19-1371/", "description": "***EMNLP'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7377999893003631695\\&hl=en\\&as_sdt=0,5)]. Searching and synthesizing scientific literature, aiding researchers in hypothesis generation, and assisting with experimental design, making scientific knowledge more accessible."}, {"name": "CodeBERT: A Pre-Trained Model for Programming and Natural Languages", "url": "https://aclanthology.org/2020.findings-emnlp.139/", "description": "***EMNLP'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9055786889913621082\\&hl=en\\&as_sdt=0,5)]. Completing code, generating programming documentation, and providing technical support, making programming knowledge more accessible to non-experts."}], "notes": []}, {"name": "Agi Cocosci \u2014 Theory of Mind", "entries": [{"name": "Theory of Mind", "url": "https://en.wikipedia.org/wiki/Theory_of_mind", "description": "***Wikipedia***. Wikipedia on Theory of Mind (ToM), a cognitive capability that estimating others' goal, belief, and desire."}, {"name": "Intentionality", "url": "https://plato.stanford.edu/entries/intentionality/", "description": "***Plato Stanford***."}, {"name": "Mental Imagery", "url": "https://plato.stanford.edu/entries/mental-imagery/", "description": "***Plato Stanford***."}, {"name": "The Mind/Brain Identity Theory", "url": "https://plato.stanford.edu/entries/mind-identity/", "description": "***Plato Stanford***."}, {"name": "Mental Representation", "url": "https://plato.stanford.edu/entries/mental-representation/", "description": "***Plato Stanford***."}, {"name": "Temporal Consciousness", "url": "https://plato.stanford.edu/entries/consciousness-temporal/", "description": "***Plato Stanford***."}, {"name": "The Experience and Perception of Time", "url": "https://plato.stanford.edu/entries/time-experience/", "description": "***Plato Stanford***."}, {"name": "Practical Reason", "url": "https://plato.stanford.edu/entries/practical-reason/", "description": "***Plato Stanford***."}, {"name": "Memory", "url": "https://plato.stanford.edu/entries/memory/", "description": "***Plato Stanford***.-->"}, {"name": "The na\u00efve utility calculus: Computational principles underlying commonsense psychology", "url": "https://www.cell.com/trends/cognitive-sciences/fulltext/S1364-6613\\(16\\", "description": ""}, {"name": "Planning with theory of mind", "url": "https://www.cell.com/trends/cognitive-sciences/fulltext/S1364-6613\\(22\\", "description": ""}, {"name": "Action Understanding as Inverse Planning", "url": "https://www.sciencedirect.com/science/article/pii/S0010027709001607", "description": "***Cognition***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=11478704181983566675)]. \\[[Appendix](https://ars.els-cdn.com/content/image/1-s2.0-S0010027709001607-mmc1.pdf)]. The original paper on Inverse Planning, a computational implementation of Theory of Mind. Humans are adept at inferring the mental states underlying other agents\u2019 actions, such as goals, beliefs, desires, emotions and other thoughts. This paper proposes a computational framework based on Bayesian inverse planning for modeling human action understanding. The framework represents an intuitive theory of intentional agents\u2019 behavior based on the principle of rationality: the expectation that agents will plan approximately rationally to achieve their goals, given their beliefs about the world. The mental states that caused an agent's behavior are inferred by inverting this model of rational planning using Bayesian inference, integrating the likelihood of the observed actions with the prior over mental states."}, {"name": "Bayesian Theory of Mind: Modeling Joint Belief-Desire Attribution", "url": "https://escholarship.org/content/qt5rk7z59q/qt5rk7z59q.pdf", "description": "***CogSci'11***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=7454981153033683025)]. \\[[Preprint](http://web.mit.edu/9.s915/www/classes/theoryOfMind.pdf)]. This paper presents a computational framework for understanding Theory of Mind (ToM): the human capacity for reasoning about agents\u2019 mental states such as beliefs and desires. The proposed Bayesian model of ToM (or BToM) expresses the predictive model of belief- and desire-dependent action at the heart of ToM as a partially observable Markov decision process (POMDP), and reconstructs an agent\u2019s joint belief state and reward function using Bayesian inference, conditioned on observations of the agent\u2019s behavior in some environmental context."}, {"name": "The Signature of All Things: Children Infer Knowledge States from Static Images", "url": "https://psyarxiv.com/f692k/", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=12380982112592086477\\&hl=en\\&as_sdt=0,5\\&as_ylo=2017)]."}, {"name": "Bayesian Brains without Probabilities", "url": "https://www.sciencedirect.com/science/article/pii/S1364661316301565?via%3Dihub", "description": "***Trends in Cognitive Sciences***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=13076510377612067772\\&hl=en\\&as_sdt=0,5)]. A perspective on human probabilistic modeling without explicit probabilistic computation."}, {"name": "Rational quantitative attribution of beliefs, desires and percepts in human mentalizing", "url": "https://www.nature.com/articles/s41562-017-0064", "description": "***Nature Human Behavior***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=9377509910551057835)]. \\[[Preprint](https://cbmm.mit.edu/sites/default/files/publications/article.pdf)]. This paper presents a model of core mentalizing computations: inferring jointly an actor\u2019s beliefs, desires and percepts from how they move in the local spatial environment. The proposed Bayesian theory of mind (BToM) model is based on probabilistically inverting artificial-intelligence approaches to rational planning and state estimation, which extend classical expected-utility agent models to sequential actions in complex, partially observable domains."}, {"name": "Machine theory of mind", "url": "http://proceedings.mlr.press/v80/rabinowitz18a.html", "description": "***ICML'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=6267278380616425333)]. Theory of mind (ToM) broadly refers to humans\u2019 ability to represent the mental states of others, including their desires, beliefs, and intentions. This work proposes a Theory of Mind neural network --- a ToMnet --- which uses meta-learning to build such models of the agents it encounters. The ToMnet learns a strong prior model for agents\u2019 future behaviour, and, using only a small number of behavioural observations, can bootstrap to richer predictions about agents\u2019 characteristics and mental states."}, {"name": "Theory of mind as inverse reinforcement learning", "url": "https://www.sciencedirect.com/science/article/pii/S2352154618302055?via%3Dihub", "description": "***Current Opinion in Behavioral Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=14959443239271810913)]. This paper reviews the idea that Theory of Mind --- humans' ability to reason about other people's mental states --- can be formalized as inverse reinforcement learning. Under this framework, expectations about how mental states produce behavior are captured in a reinforcement learning (RL) model. Predicting other people\u2019s actions is achieved by simulating a RL model with the hypothesized beliefs and desires, while mental-state inference is achieved by inverting this model. Although many advances in inverse reinforcement learning (IRL) did not have human Theory of Mind in mind, this paper focuses on what they reveal when conceptualized as cognitive theories."}, {"name": "Computational Models of Emotion Inference in Theory of Mind: A Review and Roadmap", "url": "https://onlinelibrary.wiley.com/doi/full/10.1111/tops.12371", "description": "***Topics in Cognitive Science***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15919410726494658168)]. This paper proposes an intuitive theory framework to studying affective cognition\u2014how humans reason about emotions\u2014and derive a taxonomy of inferences within affective cognition. Using this taxonomy, the authors review formal computational modeling work on such inferences, including causal reasoning about how others react to events, reasoning about unseen causes of emotions, reasoning with multiple cues, as well as reasoning from emotions to other mental states. This framework proposes unifying these various types of reasoning as Bayesian inference within a common \u201cintuitive Theory of Emotion.\u201d"}, {"name": "The Na\u00efve Utility Calculus as a unified, quantitative framework for action understanding", "url": "https://www.sciencedirect.com/science/article/pii/S0010028520300633", "description": "***Cognitive Psychology***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=10366690800692546587)]. \\[[Project](http://www.github.com/julianje/bishop)]. This paper presents a formal theory of the Na\u00efve Utility Calculus as a probabilistic generative model, which highlights the role of cost and reward tradeoffs in a Bayesian framework for action-understanding. The model predicts with quantitative accuracy how people infer agents\u2019 subjective costs and rewards based on their observable actions. By distinguishing between desires, goals, and intentions, the model extends to complex action scenarios unfolding over space and time in scenes with multiple objects and multiple action episodes."}, {"name": "AGENT: A Benchmark for Core Psychological Reasoning", "url": "http://proceedings.mlr.press/v139/shu21a.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9729067071974484204)]. Inspired by cognitive development studies on intuitive psychology, this paper presents a benchmark consisting of a large dataset of procedurally generated 3D animations, AGENT (Action, Goal, Efficiency, coNstraint, uTility), structured around four scenarios (goal preferences, action efficiency, unobserved constraints, and cost-reward trade-offs) that probe key concepts of core intuitive psychology. The results suggest that to pass the designed tests of core intuitive psychology at human levels, a model must acquire or have built-in representations of how agents plan, combining utility computations and core knowledge of objects and physics."}, {"name": "Experimental Games and Social Decision Making", "url": "https://www.annualreviews.org/doi/pdf/10.1146/annurev-psych-081420-110718", "description": "***Annual Review of Psychology***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=4713510112126264116)]. Experimental games model situations in which the future outcomes of individuals and groups depend on their own choices and on those of other (groups of) individuals. Games are a powerful tool to identify the neural and psychological mechanisms underlying interpersonal and group cooperation and coordination. This review article discusses recent developments in how experimental games are used and adapted, with an increased focus on repeated interactions, partner control through sanctioning, and partner (de)selection for future interactions."}, {"name": "Theory of Minds: Understanding Behavior in Groups through Inverse Planning", "url": "https://www.aaai.org/ojs/index.php/AAAI/article/view/4574", "description": "***AAAI'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=6755247312077985817)]. Towards the goal of building machine-learning algorithms with human-like social intelligence, this paper develops a generative model of multiagent action understanding based on a novel representation for these latent relationships called Composable Team Hierarchies (CTH). This representation is grounded in the formalism of stochastic games and multi-agent reinforcement learning. This work uses CTH as a target for Bayesian inference yielding a new algorithm for understanding behavior in groups that can both infer hidden relationships as well as predict future actions for multiple agents interacting together."}, {"name": "Leveraging Facial Expressions and Contextual Information to Investigate Opaque Representations of Emotion", "url": "https://psycnet.apa.org/fulltext/2019-58384-001.pdf?auth_token=0859666184839448b848053cd7bdceb2bdf2745a", "description": "***Emotion***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=9634378462684744548\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Waiting and weighting: Information sampling is a balance between efficiency and error-reduction", "url": "https://linkinghub.elsevier.com/retrieve/pii/S0010027712002235", "description": "***Cognition***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=12787722822882067638\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Natural scene statistics account for the representation of scene categories in human visual cortex", "url": "https://www.sciencedirect.com/science/article/pii/S0896627313005503?via%3Dihub", "description": "***Neuron***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=14030885492052338412\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Using human brain activity to guide machine learning", "url": "https://www.nature.com/articles/s41598-018-23618-6", "description": "***Scientific Report***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=12987955253653036948\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Unit of visual working memory: A Boolean map provides a better account than an object does", "url": "https://psycnet.apa.org/record/2019-27729-001", "description": "***Journal of Experimental Psychology***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=14909735035752892020\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The logic of universalization guides moral judgment", "url": "https://www.pnas.org/content/117/42/26158.short", "description": "***Proceedings of the National Academy of Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=13482051983012049752\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning Triadic Belief Dynamics in Nonverbal Communication from Videos", "url": "https://openaccess.thecvf.com/content/CVPR2021/html/Fan_Learning_Triadic_Belief_Dynamics_in_Nonverbal_Communication_From_Videos_CVPR_2021_paper.html", "description": "***CVPR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15365483338824697316)]. \\[[Preprint](https://arxiv.org/abs/2104.02841)]. This paper incorporates different nonverbal communication cues (e.g., gaze, human poses, and gestures) to represent, model, learn, and infer agents' mental states from pure visual inputs. Crucially, such a mental representation takes the agent's belief into account so that it represents what the true world state is and infers the beliefs in each agent's mental state, which may differ from the true world states. By aggregating different beliefs and true world states, the model essentially forms \"five minds\" during the interactions between two agents. This \"five minds\" model differs from prior works that infer beliefs in an infinite recursion; instead, agents' beliefs are converged into a \"common mind\". Based on this representation, this work further devises a hierarchical energy-based model that jointly tracks and predicts all five minds. From this new perspective, a social event is interpreted by a series of nonverbal communication and belief dynamics, which transcends the classic keyframe video summary."}, {"name": "Ten-month-old infants infer the value of goals from the costs of actions", "url": "https://dspace.mit.edu/bitstream/handle/1721.1/112291/ivc_full_preprint.pdf?sequence=1\\&isAllowed=y", "description": "***Science***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=11862940312128630925\\&hl=en\\&as_sdt=0,5)]. A piece of evidence for children's capability on ToM."}, {"name": "Origins of the concepts cause, cost, and goal in prereaching infants", "url": "https://www.pnas.org/content/116/36/17747", "description": "***Proceedings of the National Academy of Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15973074852436355789\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Baby Intuitions Benchmark (BIB): Discerning the goals, preferences, and actions of others", "url": "https://static1.squarespace.com/static/595a9f155016e1f7ead6edf1/t/61eeb3e7bbc41a23cd288f8a/1643033708945/Gandhi_etal_2021.pdf", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=16514364601966350574)]."}, {"name": "Intentonomy: a Dataset and Study towards Human Intent Understanding", "url": "https://arxiv.org/pdf/2011.05558.pdf", "description": "***CVPR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=5268870345003195142\\&hl=en\\&as_sdt=0,5)]. A large-scale database on human intentionally-posted images on social media."}, {"name": "Adventures in Flatland: Perceiving Social Interactions Under Physical Dynamics", "url": "https://www.tshu.io/HeiderSimmel/CogSci20/Flatland_CogSci20.pdf", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=1928005249823745390\\&hl=en\\&as_sdt=0,5)]."}, {"name": "PHASE: PHysically-grounded Abstract Social Events for Machine Social Perception", "url": "https://ojs.aaai.org/index.php/AAAI/article/view/16167", "description": "***AAAI'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15536873427310696150\\&hl=en\\&as_sdt=0,5)]. \\[[Project](https://tshu.io/PHASE/)]."}, {"name": "Watch-And-Help: A Challenge for Social Perception and Human-AI Collaboration", "url": "https://openreview.net/forum?id=w_7JMpGZRh0", "description": "***ICLR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=16340001407726295133)]."}, {"name": "Evaluating and Modeling Social Intelligence: A Comparative Study of Human and AI Capabilities", "url": "https://escholarship.org/uc/item/2j53v5nv", "description": "***CogSci'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=902767361177896884)]. This work eveloped a comprehensive theoretical framework for social dynamics and introduced two evaluation tasks: Inverse Reasoning (IR) and Inverse Inverse Planning (IIP). The approach also encompassed a computational model based on recursive Bayesian inference, adept at elucidating diverse human behavioral patterns. Extensive experiments and detailed analyses revealed that humans surpassed the latest GPT models in overall performance, zero-shot learning, one-shot generalization, and adaptability to multi-modalities."}], "notes": []}, {"name": "Agi Cocosci \u2014 Analogy", "entries": [{"name": "Metaphor", "url": "https://plato.stanford.edu/entries/metaphor/", "description": "***Plato Stanford***. A computational philosophy account on Metaphor, a poetically or rhetorically ambitious use of words, a figurative as opposed to literal use."}, {"name": "Analogy and Analogical Reasoning", "url": "https://plato.stanford.edu/entries/reasoning-analogy/", "description": "***Plato Stanford***. A computational philosophy account on Analogy, a comparison between two objects, or systems of objects, that highlights respects in which they are thought to be similar."}, {"name": "A Cognitive Theory of Metaphor", "url": "https://1lib.net/book/1165963/e9aa3d", "description": "***MIT Press***, 1985. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=a+cognitive+theory+of+metaphor\\&btnG=)]. A cognitive account on Metaphor."}, {"name": "The structure-mapping engine: Algorithm and examples", "url": "https://www.sciencedirect.com/science/article/abs/pii/0004370289900775", "description": "***Artificial Intelligence***, 1989. \\[[All Versions](https://scholar.google.com/scholar?cluster=16104901325436513899\\&hl=en\\&as_sdt=0,5)]. A computational implementation of analogy."}, {"name": "Structure mapping in analogy and similarity", "url": "https://cogsci.ucsd.edu/~coulson/203/gentner-markman-97.pdf", "description": "***American Psychologist***, 1997. \\[[All Versions](https://scholar.google.com/scholar?cluster=3497411606978611830\\&hl=en\\&as_sdt=0,5)]. A perspective unifying analogy and similarity judgement."}, {"name": "A theory of relation learning and cross-domain generalization", "url": "https://psycnet.apa.org/record/2022-26663-001", "description": "***Psychological Review***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=8559821723107269122\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on the perspective of treating analogy as cross-domain generalization."}, {"name": "Emergence of analogy from relation learning", "url": "https://www.pnas.org/content/pnas/116/10/4176.full.pdf", "description": "***Proceedings of the National Academy of Sciences***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4877125748339538047\\&hl=en\\&as_sdt=0,5)]. Analogy feature in language models."}, {"name": "Analogies Explained: Towards Understanding Word Embeddings", "url": "https://proceedings.mlr.press/v97/allen19a.html", "description": "***ICML'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15445529659618849253\\&hl=en\\&as_sdt=0,5)]. Explaining the analogy capability in word embeddings."}, {"name": "Skip-Gram \u2212 Zipf + Uniform = Vector Additivity", "url": "https://aclanthology.org/P17-1007/", "description": "***ACL'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=11732363456979525246\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Generalize and Blend: Concept Blending Based on Generalization, Analogy, and Amalgams", "url": "https://www.iiia.csic.es/~enric/papers/generalize_and_blend.pdf", "description": "***ICCC'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=11073359237116879862\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Analogy-preserving Semantic Embedding for Visual Object Categorization", "url": "http://proceedings.mlr.press/v28/juhwang13.pdf", "description": "***ICML'13***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=9332855910734484101\\&hl=en\\&as_sdt=0,5)]. The first application of analogy to machine learning."}, {"name": "VISALOGY: Answering Visual Analogy Questions", "url": "https://proceedings.neurips.cc/paper/2015/file/45f31d16b1058d586fc3be7207b58053-Paper.pdf", "description": "***NeurIPS'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=7665427758655324654\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Detecting Unseen Visual Relations Using Analogies", "url": "https://ieeexplore.ieee.org/document/9010418", "description": "***CVPR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=16686853801653819556\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Analogy between concepts", "url": "https://www.sciencedirect.com/science/article/pii/S0004370218301863", "description": "***Artificial Intelligence***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=1397905953174123757\\&hl=en\\&as_sdt=0,5)]. A mathematical account on analogy."}, {"name": "Learning to Make Analogies by Contrasting Abstract Relational Structure", "url": "https://arxiv.org/abs/1902.00120", "description": "***ICLR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15521573039503233138\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Sky + Fire = Sunset. Exploring Parallels between Visually Grounded Metaphors and Image Classifiers", "url": "https://aclanthology.org/2020.figlang-1.pdf#page=140", "description": "***ACL'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5747285277687442001\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Analogy as Nonparametric Bayesian Inference over Relational Systems", "url": "https://arxiv.org/pdf/2006.04156.pdf", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=1798148167130120057\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Visual Analogy: Deep Learning Versus Compositional Models", "url": "https://www.cs.jhu.edu/~alanlab/Pubs21/ichien2021visual.pdf", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1187822306970312749\\&hl=en\\&as_sdt=0,5)]. A human-deep-learning comparison on similarity judgement."}, {"name": "Preschoolers and adults make inferences from novel metaphors", "url": "https://escholarship.org/content/qt3j2576vv/qt3j2576vv.pdf", "description": "***CogSci'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=16038983545360341739\\&hl=en\\&as_sdt=0,44)]. A piece of evidence that understanding metaphors is capable for different cognitive development phases."}, {"name": "Similarity involving attributes and relations: Judgments of similarity and difference are not inverses", "url": "https://pcl.sitehost.iu.edu/rgoldsto/pdfs/simdiff.pdf", "description": "***Psychological Science***, 1990. \\[[All Versions](https://scholar.google.com/scholar?cluster=13205938250772079784\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Causality", "entries": [{"name": "Causality", "url": "https://en.wikipedia.org/wiki/Causality", "description": "***Wikipedia***. Wikipedia on causality, which is influence by which one event, process, state, or object (a cause) contributes to the production of another event, process, state, or object (an effect) where the cause is partly responsible for the effect, and the effect is partly dependent on the cause."}, {"name": "Causal Models", "url": "https://plato.stanford.edu/entries/causal-models/", "description": "***Plato Stanford***. A computational philosophy account on Causal models, which are mathematical models representing causal relationships within an individual system or population."}, {"name": "Causal Theories of Mental Content", "url": "https://plato.stanford.edu/entries/content-causal/", "description": "***Plato Stanford***. A computational philosophy account on causal theories of mental content, which attempts to explain how thoughts can be about things."}, {"name": "Identification of Causal Effects Using Instrumental Variables", "url": "http://www.jakebowers.org/ITVExperiments/angristimbensrubin96.pdf", "description": "***Journal of the American Statistical Association***, 1996. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=17166265099721941605)]."}, {"name": "Predictive and Diagnostic Learning Within Causal Models: Asymmetries in Cue Competition", "url": "https://www.psych.uni-goettingen.de/de/cognition/publikationen-dateien-waldmann/1992_predictive_vs_diagnostic.pdf", "description": "***Journal of Experimental Psychology***, 1992. \\[[All Versions](https://scholar.google.com/scholar?cluster=9614241045842043939\\&hl=en\\&as_sdt=0,5)]. Experimental evidences for distincting causality and association."}, {"name": "Causal Reasoning", "url": "https://www.oxfordhandbooks.com/view/10.1093/oxfordhb/9780195376746.001.0001/oxfordhb-9780195376746-e-46", "description": "***The Oxford Handbook of Cognitive Psychology***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=11361740093816709089\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Reasoning with cause and effect", "url": "https://ftp.cs.ucla.edu/pub/stat_ser/R265.pdf", "description": "1998. Judea Pearl's tutorials on causal reasoning with operations on Bayesian networks."}, {"name": "The Seven Tools of Causal Inference, with Reflections on Machine Learning", "url": "https://dl.acm.org/doi/pdf/10.1145/3241036", "description": "***Communications of the ACM***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=13296019510897277617\\&hl=en\\&as_sdt=0,5)]. Judea Pearl's review on causal inference in probabilistic graph models."}, {"name": "Toward Causal Representation Learning", "url": "https://cardiacmr.hms.harvard.edu/files/cardiacmr/files/toward_causal_representation_learning.pdf", "description": "***Proceedings of the IEEE***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15629454810797806102\\&hl=en\\&as_sdt=0,5)]. Yoshua Bengio's review on the perspective of treating causal inference as a representation learning problem."}, {"name": "Theory-Based Causal Induction", "url": "https://cocosci.princeton.edu/tom/papers/tbci.pdf", "description": "***Psychological Review***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=13980129728092173387\\&hl=en\\&as_sdt=0,5)]. Thomas Griffiths' review on causal Bayesian theory induction."}, {"name": "Theory-Based Causal Transfer: Integrating Instance-Level Induction and Abstract-Level Structure Learning", "url": "https://ojs.aaai.org//index.php/AAAI/article/view/5483", "description": "***AAAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9411622427165139667\\&hl=en\\&as_sdt=0,5)]. A computatinoal account on causal transfer."}, {"name": "Inferring causal networks from observations and interventions", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1207/s15516709cog2703_6", "description": "***Cognitive Science***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=12050301037347772984\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Constraints on Hypothesis Selection in Causal Learning", "url": "https://cogsci.mindmodeling.org/2015/papers/0418/paper0418.pdf", "description": "***CogSci'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=2005\\&sciodt=0%2C5\\&cites=16920774374067505248\\&scipsc=\\&q=Constraints+on+hypothesis+selection+in+causal+learning\\&btnG=)]."}, {"name": "Eye-tracking causality", "url": "http://cocolab.stanford.edu/papers/GerstenbergEtAl17_PsychScience.pdf", "description": "***Psychological Science***, 2017. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=17518200401109470519)]."}, {"name": "What happened? Reconstructing the past through vision and sound", "url": "https://scholar.google.com/citations?view_op=view_citation\\&hl=en\\&user=d0TfP8EAAAAJ\\&sortby=pubdate\\&citation_for_view=d0TfP8EAAAAJ:S16KYo8Pm5AC", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=12975579257004398798)]."}, {"name": "How do people generalize causal relations over objects? A non-parametric Bayesian account", "url": "https://link.springer.com/article/10.1007/s42113-021-00124-z", "description": "***Computational Brain & Behavior***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=3364672295201228487)]. \\[[Preprint](https://psyarxiv.com/x57hf/)]. How do people decide how general a causal relationship is, in terms of the entities or situations it applies to? What features do people use to decide whether a new situation is governed by a new causal law or an old one? How can people make these difficult judgments in a fast, efficient way? This paper addresses these questions in two experiments that ask participants to generalize from one (Experiment 1) or several (Experiment 2) causal interactions between pairs of objects. In each case, participants see an agent object act on a recipient object, causing some changes to the recipient."}, {"name": "Causal Reasoning in Rats", "url": "https://www.psych.uni-goettingen.de/de/cognition/publikationen-dateien-waldmann/2006_science.pdf", "description": "***Science***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=17987039255457850949\\&hl=en\\&as_sdt=0,5)]. A piece of evidence for the capability of causal reasoning in intelligent animals."}, {"name": "Do New Caledonian crows solve physical problems through causal reasoning?", "url": "http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.183.4674\\&rep=rep1\\&type=pdf", "description": "***Proceedings of the Royal Society B: Biological Sciences***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=18374985546068164189\\&hl=en\\&as_sdt=0,5)]. A piece of evidence for the capability of causal reasoning in intelligent animals."}, {"name": "Do six-month-old infants perceive causality?", "url": "http://fitelson.org/woodward/leslie.pdf", "description": "***Cognition***, 1987. \\[[All Versions](https://scholar.google.com/scholar?cluster=14270905342434182186\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Commonsense", "entries": [{"name": "Intuitive Physics Reading List", "url": "https://github.com/lishiqianhugh/Intuitive_Physics_Reading_List", "description": "***GitHub***. A reading list on intuitive physics, maintained actively by Shiqian Li.", "stars": "19"}, {"name": "Intuitive Physics: Current Research and Controversies", "url": "https://www.sciencedirect.com/science/article/pii/S1364661317301262", "description": "***Trends in Cognitive Sciences***, 2018. \\[[All Versions](https://scholar.google.com/scholar?start=0\\&hl=en\\&as_sdt=0,5\\&cluster=12085981794958916203)]. Hongjing Lu's review on intuitive physics."}, {"name": "Simulation as an engine of physical scene understanding", "url": "https://www.pnas.org/content/pnas/110/45/18327.full.pdf", "description": "***Proceedings of the National Academy of Sciences***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=5892822406285231676\\&hl=en\\&as_sdt=0,5)]. \\[[Appendix](https://www.pnas.org/content/pnas/suppl/2013/10/18/1306572110.DCSupplemental/pnas.201306572SI.pdf?targetid=nameddest%3DSTXT)]. The first attempt to computationally simulate intuitive physics."}, {"name": "Functional neuroanatomy of intuitive physical inference", "url": "https://www.pnas.org/doi/pdf/10.1073/pnas.1610344113", "description": "***Proceedings of the National Academy of Sciences***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=1792195093536891402\\&hl=en\\&as_sdt=0,5)]. A piece of evidence for the functional part of intuitive physics in human brain."}, {"name": "Mind Games: Game Engines as an Architecture for Intuitive Physics", "url": "https://www.sciencedirect.com/science/article/pii/S1364661317301134", "description": "***Trends in Cognitive Sciences***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=14527964477161848029\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. Tomer Ullman's review on simulation-based intuitive physics."}, {"name": "Learning physical parameters from dynamic scenes", "url": "https://www.sciencedirect.com/science/article/abs/pii/S0010028517301822", "description": "***Cognitive Psychology***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=5103729321433959736\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Limits on Simulation Approaches in Intuitive Physics", "url": "https://www.sciencedirect.com/science/article/pii/S0010028521000190", "description": "***Cognitive Psychology***, 2021. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=6329029167380621767)]. Ernest Davis's perspective against intuitive physics, that physcial reasoning is logical reasoning instead of intuition."}, {"name": "Partial Mental Simulation Explains Fallacies in Physical Reasoning", "url": "https://psyarxiv.com/y4a8x/download?format=pdf", "description": "***Cognitive Neuropsychology***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=15541954459060383152\\&hl=en\\&as_sdt=2005)]."}, {"name": "Intuitive physics learning in a deep-learning model inspired by developmental psychology", "url": "https://www.nature.com/articles/s41562-022-01394-8", "description": "***Nature Human Behavior***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=13803979681049451699\\&hl=en\\&as_sdt=0,5)]. A machine-learning dataset designed to evaluate conceptual understanding of intuitive physics, adopting the violation-of-expectation (VoE) paradigm from developmental psychology; a deep-learning system that learns intuitive physics directly from visual data, inspired by studies of visual cognition in children."}, {"name": "PHYRE: A New Benchmark for Physical Reasoning", "url": "https://proceedings.neurips.cc/paper/2019/hash/4191ef5f6c1576762869ac49281130c9-Abstract.html", "description": "***NeurIPS'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=9555658528231205655\\&hl=en\\&as_sdt=0,5)]. A benchmark for AI physical reasoning."}, {"name": "Phy-Q as a measure for physical reasoning intelligence", "url": "https://www.nature.com/articles/s42256-022-00583-4", "description": "***Nature Machine Intelligence***, 2023. \\[[NMI Challenge](https://www.nature.com/articles/s42256-019-0072-x)]. An interactive benchmark for AI physical reasoning."}, {"name": "Representations of Commonsense Knowledge", "url": "https://www.sciencedirect.com/book/9781483207704/representations-of-commonsense-knowledge", "description": "***Morgan Kaufmann***, 1990. \\[[All Versions](https://scholar.google.com/scholar?cluster=8861902735724600978)]. A classic book on commonsense knowledge."}, {"name": "Towards a theory of commonsense visual reasoning", "url": "https://link.springer.com/chapter/10.1007%2F3-540-53487-3_59", "description": "***FSTTCS***, 1990. \\[[All Versions](https://scholar.google.com/scholar?cluster=13178231862265713961\\&hl=en\\&as_sdt=0,5)]. The original paper on visual commonsense."}, {"name": "Commonsense reasoning and commonsense knowledge in artificial intelligence", "url": "http://cs.wellesley.edu/~cs125/reading/commonsenseAI.pdf", "description": "***Communications of the ACM***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=13786590180441485203\\&hl=en\\&as_sdt=0,5)]. Gary Marcus's review on commonsense knowledge in AI."}, {"name": "From Recognition to Cognition: Visual Commonsense Reasoning", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=8953217", "description": "***CVPR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=15467433880059136365\\&hl=en\\&as_sdt=0,5)]. \\[[Project](http://visualcommonsense.com/)]."}, {"name": "PIQA: Reasoning about Physical Commonsense in Natural Language", "url": "https://arxiv.org/pdf/1911.11641.pdf", "description": "***AAAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=10110424163152713144\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Visual Commonsense R-CNN", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=9156347", "description": "***CVPR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=6886229776034162585\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Abductive Commonsense Reasoning", "url": "https://openreview.net/pdf?id=Byg1v1HKDB", "description": "***ICLR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16544200144479839958\\&hl=en\\&as_sdt=0,5)]. Abductive commonsense reasoning on large language models."}, {"name": "VisualCOMET: Reasoning About the Dynamic Context of a Still Image", "url": "https://link.springer.com/chapter/10.1007%2F978-3-030-58558-7_30", "description": "***ECCV'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7681600847940772451\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Abduction of Sherlock Holmes: A Dataset for Visual Abductive Reasoning", "url": "https://link.springer.com/chapter/10.1007/978-3-031-20059-5_32", "description": "***ECCV'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=18355807581692234364)]. \\[[Preprint](https://arxiv.org/abs/2202.04800)]. This paper presents Sherlock, an annotated corpus of 103K images for testing machine capacity for abductive reasoning beyond literal image contents. The corpus construction process adopts a free-viewing paradigm: participants first observe and identify salient clues within images (e.g., objects, actions) and then provide a plausible inference about the scene, given the clue."}, {"name": "UNcommonsense Reasoning: Abductive Reasoning about Uncommon Situations", "url": "https://aclanthology.org/2024.naacl-long.469/", "description": "***NAACL'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=470445696014235795)]. This paper explores the task of uncommonsense abductive reasoning. Given a piece of context with an unexpected outcome, this task requires reasoning abductively to generate an explanation that makes the unexpected outcome more likely in the context."}, {"name": "Experience Grounds Language", "url": "https://aclanthology.org/2020.emnlp-main.703.pdf", "description": "***EMNLP'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=3734668471751920487\\&hl=en\\&as_sdt=0,5)]. A perspective on the furture of computational linguistics research---commonsense-driven and embodied language."}, {"name": "Broaden the Vision: Geo-Diverse Visual Commonsense Reasoning", "url": "https://aclanthology.org/2021.emnlp-main.162/", "description": "***EMNLP'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=12305856131717604775\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Human-like property induction is a challenge for large language models", "url": "http://www.charleskemp.com/papers/hanrpk_humanlikepropertyinductionisachallengeforlargelanguagemodels.pdf", "description": "***CogSci'22***, 2022."}, {"name": "SwiftSage: A Generative Agent with Fast and Slow Thinking for Complex Interactive Tasks", "url": "https://arxiv.org/abs/2305.17390", "description": "***NeurIPS'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=3844178012869500706\\&hl=en\\&as_sdt=0,5)]. \\[[Project](https://swiftsage.github.io/)]."}, {"name": "wikiHow", "url": "https://www.wikihow.com/Main-Page", "description": "***wikiHow\\.com***. wikiHow is on website hosting step-by-step \"How-to\" procedural instructions across various domains and topics."}, {"name": "The World Avatar", "url": "https://theworldavatar.io/", "description": "***The World Avatar\u2122***. A large-scale dynamic knowledge graph connecting concepts with relations to digitalize molecules, buildings, cities, and countries."}, {"name": "CYC: A Large-Scale Investment in Knowledge Infrastructure", "url": "https://faculty.cc.gatech.edu/~isbell/classes/reading/papers/lenat95cyc.pdf", "description": "***Communications of the ACM***, 1995. \\[[All Versions](https://scholar.google.com/scholar?cluster=6505009388871605141\\&hl=en\\&as_sdt=0,5)]. The first attempt to build large-scale commonse knoweldgebase from human knowledge."}, {"name": "ConceptNet 5.5: An Open Multilingual Graph of General Knowledge", "url": "https://arxiv.org/pdf/1612.03975.pdf", "description": "***AAAI'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=7089916805257737701\\&hl=en\\&as_sdt=0,5)]. Latest version of ConceptNet."}, {"name": "The Public Acquisition of Commonsense Knowledge", "url": "https://www.aaai.org/Library/Symposia/Spring/2002/ss02-09-011.php", "description": "***Proceedings of AAAI Spring Symposium on Acquiring (and Using) Linguistic (and World) Knowledge for Information Access***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=12533779219524472080\\&hl=en\\&as_sdt=0,5)]. The first attempt for acquring commonsense knowlege from humans' activities on the internet."}, {"name": "Open Mind Common Sense: Knowledge Acquisition from the General Public", "url": "http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.472.914\\&rep=rep1\\&type=pdf", "description": "***OTM Confederated International Conferences'02***, 2002. \\[[All Versions](https://scholar.google.com/scholar?cluster=11431785236825227404\\&hl=en\\&as_sdt=0,5)].."}, {"name": "Verbosity: A Game for Collecting Common-Sense Facts", "url": "http://www.aladdin.cs.cmu.edu/papers/pdfs/y2006/verbosity.pdf", "description": "***CHI'06***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=7793704394155465847\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Designing games with a purpose", "url": "https://dl.acm.org/doi/fullHtml/10.1145/1378704.1378719", "description": "***Communications of the ACM***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=18332117920150730595\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Acquiring Comparative Commonsense Knowledge from the Web", "url": "https://people.mpi-inf.mpg.de/~ntandon/papers/aaai-2014-tandon.pdf", "description": "***AAAI'14***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=16641273554706459553\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Visual Concept Programming: A Visual Analytics Approach to Injecting Human Intelligence at Scale", "url": "https://ieeexplore.ieee.org/abstract/document/9904017", "description": "***IEEE Transactions on Visualization and Computer Graphics***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=10724509334112758172\\&hl=en\\&as_sdt=0,5)]. This paper presents Visual Concept Programming, a first-of-its-kind visual analytics approach of using visual concepts to program image data at scale while requiring a few human efforts."}], "notes": []}, {"name": "Agi Cocosci \u2014 Inductive Logic & Program Synthesis", "entries": [{"name": "Inductive Logic", "url": "https://plato.stanford.edu/entries/logic-inductive/", "description": "***Plato Stanford***. A computational philosophy account on Inductive Logic, which is a logic of evidential support."}, {"name": "First-order Model Theory", "url": "https://plato.stanford.edu/entries/modeltheory-fo/", "description": "***Plato Stanford***. A computational philosophy account on First-order Model Theory, which is a branch of mathematics that deals with the relationships between descriptions in first-order languages and the structures that satisfy these descriptions."}, {"name": "Paraconsistent Logic", "url": "https://plato.stanford.edu/entries/logic-paraconsistent/", "description": "***Plato Stanford***. A computational philosophy account on Paraconsistent Logic, where any logic is paraconsistent as long as it is not explosive."}, {"name": "Logical Consequence", "url": "https://plato.stanford.edu/entries/logical-consequence/", "description": "***Plato Stanford***. A computational philosophy account on Logical Consequence, which is about the relation between premises and conclusions in valid arguments."}, {"name": "Logic Pluralism", "url": "https://plato.stanford.edu/entries/logical-pluralism/", "description": "***Plato Stanford***. A computational philosophy account on Logic Pluralism, which is the view that there is more than one correct logic."}, {"name": "The Emergence of First-Order Logic", "url": "https://plato.stanford.edu/entries/logic-firstorder-emergence/", "description": "***Plato Stanford***. A computational philosophy account on the emergence of first-order logic, mainly about first-order logic is natural retrospect."}, {"name": "Second-order and Higher-order Logic", "url": "https://plato.stanford.edu/entries/logic-higher-order/", "description": "***Plato Stanford***."}, {"name": "Program Synthesis", "url": "https://www.microsoft.com/en-us/research/wp-content/uploads/2017/10/program_synthesis_now.pdf", "description": "***Foundations and Trends in Programming Languages***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=5442933587668978421\\&hl=en\\&as_sdt=0,5)]. Sumit Gulwani's comprehensive review on program synthesis."}, {"name": "The Discovery of the Equator or Concept Driven Learning", "url": "https://www.ijcai.org/Proceedings/83-1/Papers/109.pdf", "description": "***IJCAI'83***, 1983. \\[[All Versions](https://scholar.google.com/scholar?cluster=15712225225140903169\\&hl=en\\&as_sdt=0,5)]. The original paper on second-order metarules."}, {"name": "Towards combining inductive logic programming with Bayesian networks", "url": "https://link.springer.com/chapter/10.1007%2F3-540-44797-0_10", "description": "***ILP'01***, 2001. \\[[All Versions](https://scholar.google.com/scholar?cluster=2904180673047700407\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Meta-interpretive learning: application to grammatical inference", "url": "http://www.doc.ic.ac.uk/~shm/Papers/metagol_gram.pdf", "description": "***Machine Learning***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=17075313112718885592\\&hl=en\\&as_sdt=0,5)]. Stephen Muggleton's original paper on Meta-Interpretive Learning (MIL)."}, {"name": "Learning Efficient Logical Robot Strategies Involving Composable Objects", "url": "http://andrewcropper.com/pubs/ijcai15-metagolo.pdf", "description": "***IJCAI'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=5109851972354087162\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning Higher-Order Logic Programs through Abstraction and Invention", "url": "http://andrewcropper.com/pubs/ijcai16-metafunc.pdf", "description": "***IJCAI'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=10945054943203858325\\&hl=en\\&as_sdt=0,5)]."}, {"name": "How Much Can Experimental Cost Be Reduced in Active Learning of Agent Strategies?", "url": "https://link.springer.com/chapter/10.1007%2F978-3-319-99960-9_3", "description": "***ILP'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=8152380236842970357\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Meta-Interpretive Learning from noisy images", "url": "https://link.springer.com/article/10.1007/s10994-018-5710-8", "description": "***Machine Learning***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=5719375383968868329\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning efficient logic programs", "url": "http://andrewcropper.com/pubs/mlj18-metaopt.pdf", "description": "***Machine Learning***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=17955696870252443734\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning higher-order logic programs", "url": "http://andrewcropper.com/pubs/mlj19-metaho.pdf", "description": "***Machine Learning***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=6723896359456002413\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Logical reduction of metarules", "url": "http://andrewcropper.com/pubs/mlj19-reduce.pdf", "description": "***Machine Learning***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4577603126537024540\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Playgol: Learning Programs Through Play", "url": "http://andrewcropper.com/pubs/ijcai19-playgol.pdf", "description": "***IJCAI'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=556522464212000763\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Machine Discovery of Comprehensible Strategies for Simple Games Using Meta-interpretive Learning", "url": "https://link.springer.com/article/10.1007%2Fs00354-019-00054-2", "description": "***New Generation Computing***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=11019349634035542991\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Forgetting to Learn Logic Programs", "url": "http://andrewcropper.com/pubs/aaai20-forgetgol.pdf", "description": "***AAAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=13676986733133377042\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Turning 30: New Ideas in Inductive Logic Programming", "url": "https://www.ijcai.org/proceedings/2020/673", "description": "***IJCAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=17980870844719684257\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Inductive logic programming at 30: a new introduction", "url": "https://arxiv.org/abs/2008.07912", "description": "***Journal of Artificial Intelligence Research***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=317114056670544302\\&hl=en\\&as_sdt=0,5)]. A 30-year comprehensive review on Inductive Logic Programming."}, {"name": "Learning programs by learning from failures", "url": "https://arxiv.org/pdf/2005.02259.pdf", "description": "***Machine Learning***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=6797200487935462023\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Complete Bottom-Up Predicate Invention in Meta-Interpretive Learning", "url": "https://www.ijcai.org/proceedings/2020/320", "description": "***IJCAI'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=6085183078630665234\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Meta-Interpretive Learning as Metarule Specialisation", "url": "https://arxiv.org/pdf/2106.07464.pdf", "description": "***Machine Learning***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=14684315775211086859\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Qualitative choice logic", "url": "https://www.sciencedirect.com/science/article/pii/S0004370204000591", "description": "***Artificial Intelligence***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=1586187056162326386\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Derivative-free optimization of high-dimensional non-convex functions by sequential random embeddings", "url": "https://www.ijcai.org/Proceedings/16/Papers/278.pdf", "description": "***IJCAI'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=15955040483290586781\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Finitely Generated Groups and First-Order Logic", "url": "https://londmathsoc.onlinelibrary.wiley.com/doi/abs/10.1112/S0024610704006106", "description": "***Journal of The London Mathematical Society-second Series***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=3457158221419711506\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Leveraging Language for Abstraction and Program Search", "url": "https://vigilworkshop.github.io/static/papers-2021/25.pdf", "description": "***ICML'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Leveraging+Language+for+Abstraction+and+Program+Search\\&btnG=)]."}, {"name": "Program Synthesis Guided Reinforcement Learning", "url": "https://proceedings.neurips.cc/paper/2021/hash/f7e2b2b75b04175610e5a00c1e221ebb-Abstract.html", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=17353674428642875269\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning Part-Based Abstractions for Visual Object Concepts", "url": "https://cogtoolslab.github.io/pdf/wang_cogsci_2021a.pdf", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?lookup=0\\&q=Learning+Part-Based+Abstractions+for+Visual+Object+Concepts\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Program Synthesis with Large Language Models", "url": "https://arxiv.org/abs/2108.07732", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=15213050540818392833)]. This paper explores the limits of the current generation of large language models for program synthesis in general purpose programming languages."}, {"name": "Combining Functional and Automata Synthesis to Discover Causal Reactive Programs", "url": "https://dl.acm.org/doi/abs/10.1145/3571249", "description": "***POPL'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=10470162446663474225\\&as_sdt=0,5)]. A new algorithm that synthesizes functional reactive programs from observation data, which iterates between a functional synthesis step, which attempts to generate a transition function over observed states, and an automata synthesis step, which adds any additional latent state necessary to fully account for the observations."}, {"name": "Synthesizing theories of human language with Bayesian program induction", "url": "http://cap.csail.mit.edu/sites/default/files/research-pdfs/Synthesizing%20theories%20of%20human%20language%20with%20Bayesian%20program%20induction.pdf", "description": "***Nature Communications***, 2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=8603772394100237159\\&hl=en\\&as_sdt=0,5)]."}, {"name": "From Word Models to World Models: Translating from Natural Language to the Probabilistic Language of Thought", "url": "https://arxiv.org/abs/2306.12672", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=13778788929096574993)]. Rational meaning construction, a computational framework for language-informed thinking that combines neural language models with probabilistic models for rational inference. Linguistic meaning is framed as a context-sensitive mapping from natural language into a probabilistic language of thought (PLoT)--a general-purpose symbolic substrate for generative world modeling."}, {"name": "Latent Programmer: Discrete Latent Codes for Program Synthesis", "url": "https://proceedings.mlr.press/v139/hong21a.html", "description": "***ICML'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9789877360194738968)]. Paper introducing the Latent Programmer, a two-level program synthesis method that first predicts a discrete latent code from input/output examples, and then generates the program in the target language."}, {"name": "PAL: Program-aided Language Models", "url": "https://proceedings.mlr.press/v202/gao23f", "description": "***ICML'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=14898051625978777315\\&hl=en\\&as_sdt=0,5)]. Paper presenting an approach that uses the LLM to read natural language problems and generate programs as the intermediate reasoning steps, but offloads the solution step to a runtime such as a Python interpreter. With PAL, decomposing the natural language problem into runnable steps remains the only learning task for the LLM, while solving is delegated to the interpreter."}, {"name": "Large Language Models Meet NL2Code: A Survey", "url": "https://aclanthology.org/2023.acl-long.411/", "description": "***ACL'23***, 2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11868015824802341463\\&hl=en\\&as_sdt=0,5)]. \\[[NL2Code Website](https://nl2code.github.io/)]. A paper presenting a comprehensive survey of 27 existing large language models for NL2Code, and also review benchmarks and metrics, suggesting that the key factors contributing to the success of large language models for NL2Code are \u201cLarge Size, Premium Data, Expert Tuning\u201d."}, {"name": "A Large-Scale Survey on the Usability of AI Programming Assistants: Successes and Challenges", "url": "https://dl.acm.org/doi/abs/10.1145/3597503.3608128", "description": "***ICSE'24***, 2024. \\[[All Versions](https://scholar.google.com/scholar?cluster=3696356619002071917\\&hl=en\\&as_sdt=0,5)]. A survey finding that developers are most motivated to use AI programming assistants because they help developers reduce key-strokes, finish programming tasks quickly, and recall syntax, but resonate less with using them to help brainstorm potential solutions."}, {"name": "Large Language Models for Software Engineering: A Systematic Literature Review", "url": "https://arxiv.org/abs/2308.10620", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=10466731638053452642\\&as_sdt=0,5)]. A systematic literature review on LLM4SE, with a particular focus on understanding how LLMs can be exploited to optimize processes and outcomes."}], "notes": []}, {"name": "Agi Cocosci \u2014 Knowledge Representation", "entries": [{"name": "Handbook of Knowledge Representation", "url": "https://1lib.net/book/511192/9eab86", "description": "***Elsevier***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=14732064619564679879\\&hl=en\\&as_sdt=0,5)]. A pragmatical handbook for all kinds of knowledge representation modes."}, {"name": "Logic and Ontology", "url": "https://plato.stanford.edu/entries/logic-ontology/", "description": "***Plato Stanford***. A computational philosophy account on logic and ontology, mainly about the intersections of logic and ontology in many significant philosophy problems."}, {"name": "The Language of Thought Hypothesis", "url": "https://plato.stanford.edu/entries/language-thought/", "description": "***Plato Stanford***. A computational philosophy account on the laugnage of though hypothesis, which proposes that thinking occurs in a mental language."}, {"name": "The Analysis of Knowledge", "url": "https://plato.stanford.edu/entries/knowledge-analysis/", "description": "***Plato Stanford***."}, {"name": "Scientific Representation", "url": "https://plato.stanford.edu/entries/scientific-representation/", "description": "***Plato Stanford***. A computational philosophy account on scientific representation, focusing on how scientific models represent their target systems."}, {"name": "Self-Knowledge", "url": "https://plato.stanford.edu/entries/self-knowledge/", "description": "***Plato Stanford***. A computational philosophy account on self-knowledge, which standardly refers to knowledge of one's own mental states\u2014that is, of what one is feeling or thinking, or what one believes or desires."}, {"name": "Common Knowledge", "url": "https://plato.stanford.edu/entries/common-knowledge/", "description": "***Plato Stanford***."}, {"name": "Sense-Data", "url": "https://plato.stanford.edu/entries/sense-data/", "description": "***Plato Stanford***."}, {"name": "Supervenience", "url": "https://plato.stanford.edu/entries/supervenience/", "description": "***Plato Stanford***. A computational philosophy account on supervenience, where a set of properties A supervenes upon another set B just in case no two things can differ with respect to A-properties without also differing with respect to their B-properties."}, {"name": "Dialogical Logic", "url": "https://plato.stanford.edu/entries/logic-dialogical/", "description": "***Plato Stanford***. A computational philosophy account on dialogical logic, which is a dialogue-based approach to logic and argumentation rooted in a research tradition that goes back to dialectics in Greek Antiquity, when problems were approached through dialogues in which opposing parties discussed a thesis through questions and answers."}, {"name": "Temporal Logic", "url": "https://plato.stanford.edu/entries/logic-temporal/", "description": "***Plato Stanford***."}, {"name": "Modal Logic", "url": "https://plato.stanford.edu/entries/logic-modal/", "description": "***Plato Stanford***. A computational philosophy account on Modal Logic, which is the study of the deductive behavior of the expressions 'it is necessary that' and 'it is possible that'."}, {"name": "Epistemic Logic", "url": "https://plato.stanford.edu/entries/logic-epistemic/", "description": "***Plato Stanford***. A computational philosophy account on Epistemic Logic, which is a subfield of epistemology concerned with logical approaches to knowledge, belief and related notions."}, {"name": "Epistemic Modal Logic", "url": "https://en.wikipedia.org/wiki/Epistemic_modal_logic", "description": "***Wikipedia***."}, {"name": "The Perception of Relations", "url": "https://perception.jhu.edu/files/PDFs/21_Relations/HafriFirestone_2021_SeeingRelations_TiCS.pdf", "description": "***Trends in Cognitive Sciences***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=12190078466818849725\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. Chaz Firestone's review on the perception of relation, in constrast to the conventional reasoning view."}, {"name": "Commonsense reasoning about causality: Deriving behavior from structure", "url": "https://www.sciencedirect.com/science/article/abs/pii/0004370284900390", "description": "***Artificial Intelligence***, 1984. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=14940738362673077704)]."}, {"name": "Logics for Epistemic Programs", "url": "https://link.springer.com/article/10.1023/B:SYNT.0000024912.56773.5e", "description": "***Synthese***, 2004. \\[[All Versions](https://scholar.google.com/scholar?cluster=11403619699670839488\\&hl=en\\&as_sdt=0,5\\&as_vis=1)]."}, {"name": "A Translation Approach to Portable Ontology Specifications", "url": "https://tomgruber.org/writing/ontolingua-kaj-1993.pdf", "description": "***Knowledge Acquisition***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=14668658395073605123\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Symbolic Grounding Problem", "url": "http://www.cs.ox.ac.uk/activities/ieg/e-library/sources/harnad90_sgproblem.pdf", "description": "***Physica D: Nonlinear Phenomena***, 1990. \\[[All Versions](https://scholar.google.com/scholar?cluster=6279614024681929496\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning overhypotheses with hierarchical Bayesian models", "url": "https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-7687.2007.00585.x?__cf_chl_captcha_tk__=pmd_Q6xVT1AstoEUxA7xS3_10HyDVsk8W_DzWgOPho_Njnw-1635210931-0-gqNtZGzNA1CjcnBszQvl", "description": "***Developmental Science***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=18041836774924845900\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning Causal Schemata", "url": "https://escholarship.org/content/qt19v2r2ws/qt19v2r2ws.pdf", "description": "***CogSci'07***, 2007, \\[[All Versions](https://scholar.google.com/scholar?cluster=5008191267417189643\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The discovery of structural form", "url": "https://www.pnas.org/content/105/31/10687", "description": "***Proceedings of the National Academy of Sciences***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=10433149156915110486\\&hl=en\\&as_sdt=0,5)]. Chales Kemp's review on theory induction."}, {"name": "A Rational Analysis of Rule-Based Concept Learning", "url": "https://onlinelibrary.wiley.com/doi/full/10.1080/03640210701802071", "description": "***Cognitive Science***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=7765061503727822620\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Modeling semantic cognition as logical dimensionality reduction", "url": "https://escholarship.org/content/qt50r1c7qh/qt50r1c7qh.pdf", "description": "***CogSci'08***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=17061801746839695691\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Theory Acquisition and the Language of Thought", "url": "http://www.charleskemp.com/papers/KempGT08.pdf", "description": "***CogSci'08***, 2008. \\[[All Versions](https://scholar.google.com/scholar?cluster=1839916602381147749\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Theory Acquisition as Stochastic Search", "url": "http://web.mit.edu/tomeru/www/papers/tlss2010.pdf", "description": "***CogSci'10***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=16324634056226561429\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A probabilistic model of theory formation", "url": "http://www.charleskemp.com/papers/kemptng09.pdf", "description": "***Cognition***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=7705799129887482041\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Bootstrapping in a language of thought: A formal model of numerical concept learning", "url": "https://core.ac.uk/display/78064072", "description": "***Cognition***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=13046606910781656302\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Concepts in a Probabilistic Language of Thought", "url": "http://cbmm-dev.mit.edu/sites/default/files/publications/CBMM-Memo-010.pdf", "description": "***Center for Brains, Minds, and Machines MEMO No.010***, 2014. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=14593712389828476130)]."}, {"name": "Exploring the Conceptual Universe", "url": "http://www.charleskemp.com/papers/kemp_exploringtheconceptualuniverse.pdf", "description": "***Psychological Review***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=17824067813343816306\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A taxonomy of inductive problems", "url": "http://www.charleskemp.com/papers/kempj_ataxonomyofinductiveproblems.pdf", "description": "***Psychonomic Bulletin & Review***, 2014. \\[[All Versions](https://scholar.google.com/scholar?cluster=2571009743105592927\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Logical Primitives of Thought: Empirical Foundations for Compositional Cognitive Models", "url": "http://colala.berkeley.edu/papers/piantadosi2016logical.pdf", "description": "***Psychological Review***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=5316027496661813145\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The Emergence of Organizing Structure in Conceptual Representation", "url": "https://onlinelibrary.wiley.com/doi/full/10.1111/cogs.12580", "description": "***Cognitive Science***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=4986316323923233074\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Theory Acquisition as Constraint-Based Program Synthesis", "url": "https://cogtoolslab.github.io/pdf/wang_cogsci_2021b.pdf", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=525148607069840280\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Connecting perceptual and procedural abstractions in physical construction", "url": "https://escholarship.org/uc/item/9j00x928", "description": "***CogSci'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Connecting+perceptual+and+procedural+abstractions+in+physical+construction\\&btnG=)]."}, {"name": "Invariant representation of physical stability in the human brain", "url": "https://www.biorxiv.org/content/10.1101/2021.03.19.385641v1.full.pdf", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=17431019238600295521\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Introduction to The Fluent Calculus", "url": "https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.146.4086\\&rep=rep1\\&type=pdf", "description": "***Linkoeping University Electronic Press***, 1998. \\[[All Versions](https://scholar.google.com/scholar?cluster=12069059079023496731\\&hl=en\\&as_sdt=0,5)]."}, {"name": "From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem", "url": "https://www.sciencedirect.com/science/article/pii/S0004370299000338", "description": "***Artificial Intelligence***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=10854895617698839149\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Unsupervised Structure Learning of Stochastic And-Or Grammars", "url": "http://www.stat.ucla.edu/~sczhu/papers/Conf_2013/Learning_AoG_NeurIPS_2013.pdf", "description": "***NeurIPS'13***, 2013. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=4354984630817844670)]."}, {"name": "Algorithms of Adaptation in Inductive Inference", "url": "https://psyarxiv.com/ysndt", "description": "***Cognitive Psychology***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=16222039361294164246\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A representational analysis of numeration systems", "url": "https://www.sciencedirect.com/science/article/pii/0010027795006743", "description": "***Cognition***, 1995. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=8852566070856662412)]."}, {"name": "Learning Program Representations for Food Images and Cooking Recipes", "url": "https://openaccess.thecvf.com/content/CVPR2022/html/Papadopoulos_Learning_Program_Representations_for_Food_Images_and_Cooking_Recipes_CVPR_2022_paper.html", "description": "***CVPR'22***, 2022. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=7690010749576063125)]."}, {"name": "Reasoning about Procedures with Natural Language Processing: A Tutorial", "url": "https://arxiv.org/abs/2205.07455", "description": "2023. \\[[All Versions](https://scholar.google.com/scholar?cluster=11364086808527515615\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Cognitive Development", "entries": [{"name": "Machine Common Sense Concept Paper", "url": "https://arxiv.org/abs/1810.07528", "description": "***DARPA***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=1603121108181262769\\&hl=en\\&as_sdt=0,5)]. DARPA's perspective on integrating core knowledge from development psychology into machine intelligence systems."}, {"name": "Cognitive Development", "url": "https://en.wikipedia.org/wiki/Cognitive_development", "description": "***Wikipedia***."}, {"name": "Cognitive development: An information processing approach", "url": "https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Cognitive+Development%3A+an+information+processing+approach\\&btnG=", "description": "***B.Blackwell***, 1991. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Cognitive+development%3A+An+information+processing+approach\\&btnG=)]."}, {"name": "Reconstructing constructivism: Causal models, Bayesian learning mechanisms, and the theory theory", "url": "https://psycnet.apa.org/record/2012-12791-001", "description": "***Psychological Bulletin***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=11218217347365817167\\&hl=en\\&as_sdt=0,5)]. Alison Gopnik's review on the constructivism idea of developmental research."}, {"name": "Towards a rational constructivist theory of cognitive development", "url": "https://doi.apa.org/doiLanding?doi=10.1037/rev0000153", "description": "***Psychological Review***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=3294824172745724080\\&hl=en\\&as_sdt=0,5)]. Fei Xu's review extending Gopnik's view of constructivism, with the rationality as constraint."}, {"name": "The origins of inquiry: inductive inference and exploration in early childhood", "url": "https://www.sciencedirect.com/science/article/pii/S1364661312001301", "description": "***Trends in Cognitive Sciences***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=5189329081728071335\\&hl=en\\&as_sdt=0,5)]. Laura Schulz's review on children's exploratory play."}, {"name": "Play, Curiosity, and Cognition", "url": "https://www.annualreviews.org/doi/abs/10.1146/annurev-devpsych-070120-014806", "description": "***Annual Review of Developmental Psychology***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=10278208468154249192\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]. Laura Schulz's review on children's exploratory play, which proposes a new perspective on exploratory play to explain the emergence of irrational behaviors in play."}, {"name": "From exploration to play: A cross-sectional study of infant free play behavior", "url": "https://psycnet.apa.org/record/1981-32566-001", "description": "***Developmental Psychology***, 1981. \\[[All Versions](https://scholar.google.com/scholar?cluster=15547331535034599545\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Detecting Blickets: How Young Children Use Information about Novel Causal Powers in Categorization and Induction", "url": "https://srcd.onlinelibrary.wiley.com/doi/abs/10.1111/1467-8624.00224", "description": "***Children Development***, 2003. \\[[All Versions](https://scholar.google.com/scholar?cluster=9049737233568227380\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Serious fun: Preschoolers engage in more exploratory play when evidence is confounded", "url": "http://eccl.scripts.mit.edu/papers/bonawitzandschulzseriousfun.pdf", "description": "***Developmental Psychology***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=3033619407322882147\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Observing the unexpected enhances infants' learning and exploration", "url": "https://stahla.pages.tcnj.edu/files/2015/08/Stahl_Feigenson_Science_2015.pdf", "description": "***Science***, 2015. \\[[All Versions](https://scholar.google.com/scholar?start=10\\&hl=en\\&as_sdt=0,5\\&cluster=9247917261616759689)]."}, {"name": "Word, thought, and deed: the role of object categories in children's inductive inferences and exploratory play", "url": "https://psycnet.apa.org/record/2008-12114-008", "description": "***Developmental Psychology***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=13947689064550390312\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Where science starts: Spontaneous experiments in preschoolers' exploratory play", "url": "https://www.sciencedirect.com/science/article/pii/S0010027711000916", "description": "***Cognition***, 2011. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=16321989770180281706)]."}, {"name": "Scientific thinking in young children: Theoretical advances, empirical research, and policy implications", "url": "http://alisongopnik.com/Papers_Alison/Scientific%20Thinking%20in%20young%20Children.pdf", "description": "***Science***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=9103846738385460508\\&hl=en\\&as_sdt=2005)]."}, {"name": "Finding New Facts; Thinking New Thoughts", "url": "http://eccl.scripts.mit.edu/papers/Finding%20New%20Facts_%20Thinking%20New%20Thoughts.pdf", "description": "***Advances in Child Development and Behavior***, 2012. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Finding+new+facts%3B+thinking+new+thoughts\\&btnG=)]."}, {"name": "Theory learning as stochastic search in the language of thought", "url": "https://www.sciencedirect.com/science/article/pii/S0885201412000445", "description": "***Cognitive Development***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=8036476579458645432\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Infants make more attempts to achieve a goal when they see adults persist", "url": "https://www.science.org/doi/abs/10.1126/science.aan2317", "description": "***Science***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=2617011825272996810\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Knowing when to quit: Children consider access to solutions when deciding whether to persist", "url": "https://cognitivesciencesociety.org/cogsci20/papers/0716/0716.pdf", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=15997297570269958414\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Bayesian Models of Conceptual Development: Learning as Building Models of the World", "url": "https://psyarxiv.com/aq3rp/", "description": "***Annual Review of Developmental Psychology***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=646614032563248495\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Sticking to the Evidence? A Behavioral and Computational Case Study of Micro-Theory Change in the Domain of Magnetism", "url": "https://onlinelibrary.wiley.com/doi/full/10.1111/cogs.12765", "description": "***Cognitive Science***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=4409900195679222965\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Cognitive pragmatism: Children flexibly choose between facts and conjectures", "url": "https://junyichu.mit.edu/sites/default/files/documents/2018-05-14%20CogSci%20Final.pdf", "description": "***CogSci'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=6978944437676543728\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Exploratory play, rational action, and efficient search", "url": "https://psyarxiv.com/9yra2/", "description": "***CogSci'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=17529638197045429028\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Children selectively endorse speculative conjectures", "url": "https://srcd.onlinelibrary.wiley.com/doi/full/10.1111/cdev.13647?saml_referrer", "description": "***Child Development***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=5672344544260882286\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Learning higher-order generalizations through free play: Evidence from 2- and 3-year-old children", "url": "https://psycnet.apa.org/buy/2017-12497-003", "description": "***Developmental Psychology***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=4386474921214936914\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Childhood as a solution to explore\u2013exploit tensions", "url": "https://royalsocietypublishing.org/doi/10.1098/rstb.2019.0502", "description": "***Philosophical Transactions of the Royal Society B: Biological Sciences***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=11960188575664977017\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Children's exploratory play tracks the discriminability of hypotheses", "url": "https://www.nature.com/articles/s41467-021-23431-2", "description": "***Nature Communications***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=12389351553206792907\\&hl=en\\&as_sdt=0,5\\&as_ylo=2020)]."}, {"name": "A Developmental Perspective on Executive Function", "url": "https://srcd.onlinelibrary.wiley.com/doi/full/10.1111/j.1467-8624.2010.01499.x?saml_referrer", "description": "***Child Development***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=11347590808138984649\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Rethinking Executive Function and Its Development", "url": "https://journals.sagepub.com/doi/pdf/10.1177/1745691620904771", "description": "***Psychological Science***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16570230278367237499\\&hl=en\\&as_sdt=2005\\&sciodt=0,5)]."}, {"name": "Perception of partly occluded objects in infancy", "url": "https://www.harvardlds.org/wp-content/uploads/2017/01/Perception-of-partly-occluded-objects-in-infancy-1.pdf", "description": "***Cognitive Psychology***, 1983. \\[[All Versions](https://scholar.google.com/scholar?cluster=4182861116190610992\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Age-of-acquisition ratings for 30,000 English words", "url": "https://link.springer.com/article/10.3758/s13428-012-0210-4", "description": "***Behavior Research Methods***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=6752414178722956940\\&hl=en\\&as_sdt=0,5)]. \\[[Project](http://crr.ugent.be/archives/806)]. A database for age-of-acquisition ratings for over 30k English words."}], "notes": []}, {"name": "Agi Cocosci \u2014 Learning in the Open World", "entries": [{"name": "Online learning of symbolic concepts", "url": "https://www.sciencedirect.com/science/article/abs/pii/S002224961730010X", "description": "***Journal of Mathematical Psychology***, 2017. \\[[All Versions](https://scholar.google.com/scholar?start=20\\&hl=en\\&as_sdt=2005\\&sciodt=0,5\\&cites=8036476579458645432\\&scipsc=)]."}, {"name": "Zero-Shot Learning\u2014A Comprehensive Evaluation of the Good, the Bad and the Ugly", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=8413121", "description": "***IEEE Transactions on Pattern Analysis and Machine Intelligence***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=11909080239486864961\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on zero-shot learning."}, {"name": "Generalizing from a few examples: A survey on few-shot learning", "url": "https://www.4paradigm.com/upload/file/20210427/20210427225045_12063.pdf", "description": "***ACM Computing Survey***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7932202448069313464\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Towards Open World Recognition", "url": "https://ieeexplore.ieee.org/document/7298799", "description": "***CVPR'15***, 2015. \\[[All Versions](https://scholar.google.com/scholar?cluster=856704237994181529\\&hl=en\\&as_sdt=0,5)]. The first paper introducing the problem of open-world recognition."}, {"name": "Towards Open Set Deep Networks", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=7780542", "description": "***CVPR'16***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=3571743951915089896\\&hl=en\\&as_sdt=0,5)]."}, {"name": "In the Wild: From ML Models to Pragmatic ML Systems", "url": "https://arxiv.org/pdf/2007.02519.pdf", "description": "***ICLR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=15243890330014986346\\&hl=en\\&as_sdt=0,5)]. A comprehensive review on incremental machine learning."}, {"name": "Adversarial Filters of Dataset Biases", "url": "https://arxiv.org/pdf/2002.04108.pdf", "description": "***ICML'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=11617966867048191189\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A Wholistic View of Continual Learning with Deep Neural Networks: Forgotten Lessons and the Bridge to Active and Open World Learning", "url": "https://arxiv.org/pdf/2009.01797.pdf", "description": "2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=2640432662088551010\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Energy-Based Models for Continual Learning", "url": "https://arxiv.org/pdf/2011.12216.pdf", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7094884707139778576\\&hl=en\\&as_sdt=0,5)]. \\[[Project](https://energy-based-model.github.io/Energy-Based-Models-for-Continual-Learning/)]."}, {"name": "Learning to Learn Image Classifiers with Visual Analogy", "url": "https://openaccess.thecvf.com/content_CVPR_2019/papers/Zhou_Learning_to_Learn_Image_Classifiers_With_Visual_Analogy_CVPR_2019_paper.pdf", "description": "***CVPR'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=6285495755337309034\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Zero-Shot Object Detection", "url": "https://arxiv.org/pdf/1804.04340v2.pdf", "description": "***ECCV'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=2027060030559987993\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Towards Open World Object Detection", "url": "https://arxiv.org/pdf/2103.02603v1.pdf", "description": "***CVPR'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=9715328489246217151\\&hl=en\\&as_sdt=0,5)]. \\[[Project (\u2b501.1k)](https://github.com/JosephKJ/OWOD)]."}, {"name": "Learning to Recognise Unseen Classes by A Few Similes", "url": "https://dl.acm.org/doi/pdf/10.1145/3123266.3123323", "description": "***MM'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?q=related:FZZr2BK0U6YJ:scholar.google.com/\\&scioq=Learning+to+Recognise+Unseen+Classes+by+A+Few+Similes\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Ontology-guided Semantic Composition for Zero-Shot Learning", "url": "https://proceedings.kr.org/2020/87/kr2020-0087-chen-et-al.pdf", "description": "***KR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=1825132732653262003\\&hl=en\\&as_sdt=0,5)]."}, {"name": "OntoZSL: Ontology-enhanced Zero-shot Learning", "url": "https://arxiv.org/pdf/2102.07339.pdf", "description": "***WWW'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=1042573079110416209\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Knowledge-aware Zero-Shot Learning: Survey and Perspective", "url": "https://arxiv.org/abs/2103.00070", "description": "***IJCAI'21*** 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=2596179801089642923\\&hl=en\\&as_sdt=0,5)]."}, {"name": "From Red Wine to Red Tomato: Composition with Context", "url": "https://ieeexplore.ieee.org/document/8099612", "description": "***CVPR'17***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=6959320578989247472\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Attributes as Operators: Factorizing Unseen Attribute-Object Compositions", "url": "https://link.springer.com/chapter/10.1007%2F978-3-030-01246-5_11", "description": "***ECCV'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=11627198158637727139\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning Compositional Representations for Few-Shot Recognition", "url": "https://ieeexplore.ieee.org/document/9010671", "description": "***CVPR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7363445845219257348\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Symmetry and Group in Attribute-Object Compositions", "url": "https://ieeexplore.ieee.org/document/9156505", "description": "***CVPR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=16870815556752021056\\&hl=en\\&as_sdt=0,5)]."}, {"name": "A causal view of compositional zero-shot recognition", "url": "https://proceedings.neurips.cc/paper/2020/file/1010cedf85f6a7e24b087e63235dc12e-Paper.pdf", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=2543173389101020482\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Compositional Few-Shot Recognition with Primitive Discovery and Enhancing", "url": "https://dl.acm.org/doi/10.1145/3394171.3413849", "description": "***MM'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=15817839338790433509\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning Unseen Concepts via Hierarchical Decomposition and Composition", "url": "https://ieeexplore.ieee.org/document/9156655", "description": "***CVPR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=14161656227038242300\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Learning with Cognitive Plausibility", "entries": [{"name": "Accuracy and Precision", "url": "https://en.wikipedia.org/wiki/Accuracy_and_precision", "description": "***Wikipedia***. Wikipedia on the distinctions and the trade-off between accuracy and precision."}, {"name": "Cognitive Science: Definition, Status, and Questions", "url": "https://www.annualreviews.org/doi/abs/10.1146/annurev.ps.40.020189.003131", "description": "***Annual Review of Psychology***, 1989. \\[[All Versions](https://scholar.google.com/scholar?cluster=8549671583307260475\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Recognition-by-Components: A Theory of Human Image Understanding", "url": "http://people.csail.mit.edu/torralba/courses/6.870/papers/Biederman_RBC_1987.pdf", "description": "***Psychological Review***, 1987. \\[[All Versions](https://scholar.google.com/scholar?cluster=16522931798979362446\\&hl=en\\&as_sdt=0,5)]. The original paper on the recognition-by-components theory."}, {"name": "Machine Behaviour", "url": "https://www.nature.com/articles/s41586-019-1138-y", "description": "***Nature***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=7881171273277686092\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Dark, Beyond Deep: A Paradigm Shift to Cognitive AI with Humanlike Common Sense", "url": "https://yzhu.io/publication/dark2020engineering/paper.pdf", "description": "***Engineering***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=12292747257300299161\\&hl=en\\&as_sdt=0,5)]. Yixin Zhu and Song-Chun Zhu's review on visual commonsense."}, {"name": "Self-supervised Learning Through the eyes of a Child", "url": "https://cims.nyu.edu/~brenden/papers/OrhanEtAl2020NeurIPS.pdf", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=5608715260418451299\\&hl=en\\&as_sdt=0,5)]. Concept learning through near-natural co-occurrence frequency estimation."}, {"name": "CLEVRER: CoLlision Events for Video REpresentation and Reasoning", "url": "https://arxiv.org/abs/1910.01442", "description": "***ICLR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=4352064462350202338\\&hl=en\\&as_sdt=0,5)]."}, {"name": "BONGARD-LOGO: A New Benchmark for Human-Level Concept Learning and Reasoning", "url": "https://proceedings.neurips.cc/paper/2020/hash/bf15e9bbff22c7719020f9df4badc20a-Abstract.html", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=9164011458889391917\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The relationship between Precision-Recall and ROC curves", "url": "https://dl.acm.org/doi/10.1145/1143844.1143874", "description": "***ICML'06***, 2006. \\[[All Versions](https://scholar.google.com/scholar?cluster=10708180947310062390\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Distributional Generalization: A New Kind of Generalization", "url": "http://export.arxiv.org/pdf/2009.08092", "description": "2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=6190621467796247477\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Learning and development in networks: The importance of starting small.", "url": "https://www.sciencedirect.com/science/article/abs/pii/0010027793900584", "description": "***Cognition***, 1993. \\[[All Versions](https://scholar.google.com/scholar?cluster=5133345254007462915\\&hl=en\\&as_sdt=0,5)]. The original paper on the idea of curriculum learning."}, {"name": "Language acquisition in the absence of explicit negative evidence: how important is starting small?", "url": "https://www.sciencedirect.com/science/article/pii/S0010027799000311", "description": "***Cognition***, 1999. \\[[All Versions](https://scholar.google.com/scholar?cluster=11813578367725362166\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Curriculum Learning", "url": "https://dl.acm.org/doi/pdf/10.1145/1553374.1553380", "description": "***ICML'09***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=8740915934335425405\\&hl=en\\&as_sdt=0,5)]. The original paper applying the idea of curriculum learning to machine learning."}, {"name": "Parsing video events with goal inference and intent prediction", "url": "https://ieeexplore.ieee.org/document/6126279", "description": "***ICCV'11***, 2011. \\[[All Versions](https://scholar.google.com/scholar?cluster=5979196784405021658\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Inferring \"Dark Matter\" and \"Dark Energy\" from Videos", "url": "https://ieeexplore.ieee.org/document/6751387", "description": "***ICCV'13***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=3467068307444498624\\&hl=en\\&as_sdt=0,5)]. The original paper on latent state discovery from videos."}, {"name": "Explainable and Explicit Visual Reasoning over Scene Graphs", "url": "https://openaccess.thecvf.com/content_CVPR_2019/papers/Shi_Explainable_and_Explicit_Visual_Reasoning_Over_Scene_Graphs_CVPR_2019_paper.pdf", "description": "***CVPR'19***, 2019. \\[[All Versions](https://scholar.google.com/scholar?cluster=8517395712319798436\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Attention over Learned Object Embeddings Enables Complex Visual Reasoning", "url": "https://proceedings.neurips.cc/paper/2021/hash/4c26774d852f62440fc746ea4cdd57f6-Abstract.html", "description": "***NeurIPS'21***, 2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=127829313460149801\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Distributed Representations of Words and Phrases and their Compositionality", "url": "https://papers.NeurIPS.cc/paper/2013/file/9aa42b31882ec039965f3c4923ce901b-Paper.pdf", "description": "***NeurIPS'13***, 2013. \\[[All Versions](https://scholar.google.com/scholar?cluster=2410615501856807729\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Motion Reasoning for Goal-Based Imitation Learning", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=9197172", "description": "***ICRA'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=7519230802512388210\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Action Genome: Actions as Compositions of Spatio-temporal Scene Graphs", "url": "https://openaccess.thecvf.com/content_CVPR_2020/papers/Ji_Action_Genome_Actions_As_Compositions_of_Spatio-Temporal_Scene_Graphs_CVPR_2020_paper.pdf", "description": "***CVPR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=388714326304810525\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Refactoring Policy for Compositional Generalizability using Self-Supervised Object Proposals", "url": "https://proceedings.neurips.cc/paper/2020/file/64dcf3c521a00dbb4d2a10a27a95a9d8-Paper.pdf", "description": "***NeurIPS'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=2255457416066730255\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Something-Else: Compositional Action Recognition with Spatial-Temporal Interaction Networks", "url": "https://openaccess.thecvf.com/content_CVPR_2020/papers/Materzynska_Something-Else_Compositional_Action_Recognition_With_Spatial-Temporal_Interaction_Networks_CVPR_2020_paper.pdf", "description": "***CVPR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=17469863154797360929\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Putting visual object recognition in context", "url": "https://openaccess.thecvf.com/content_CVPR_2020/papers/Zhang_Putting_Visual_Object_Recognition_in_Context_CVPR_2020_paper.pdf", "description": "***CVPR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=6207193649298787857\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Multimodal Few-Shot Learning with Frozen Language Models", "url": "https://arxiv.org/abs/2106.13884", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=16154696122208258147\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Describing Objects by their Attributes", "url": "https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=\\&arnumber=5206772", "description": "***CVPR'09***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=6853730684095116174\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Panoramic Learning with A Standardized Machine Learning Formalism", "url": "https://arxiv.org/abs/2108.07783", "description": "2021. \\[[All Versions](https://scholar.google.com/scholar?cluster=14222434793711614257\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Graininess of judgment under uncertainty: An accuracy-informativeness trade-off", "url": "https://psycnet.apa.org/record/1996-10319-001", "description": "***Journal of Experimental Psychology***, 1995. \\[[All Versions](https://scholar.google.com/scholar?cluster=15366302654259490472\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Federated Learning via Posterior Averaging: A New Perspective and Practical Algorithms", "url": "https://openreview.net/forum?id=GFsU8a0sGB", "description": "***ICLR'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=2486025806014234529\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Interplay between rule learning and rule switching in a perceptual categorization task", "url": "https://www.biorxiv.org/content/10.1101/2022.01.29.478330v2.abstract", "description": "2022. \\[[All Versions](https://scholar.google.com/scholar?cluster=7461559646167397406\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Tasks & Environments", "entries": [], "notes": []}, {"name": "Agi Cocosci \u2014 Courses", "entries": [{"name": "Computational Cognitive Science Courses", "url": "https://cbmm.mit.edu/education/courses/computational-cognitive-science", "description": "***MIT***. Courses on computational cognitive science from MIT, Harvard, and Stanford."}, {"name": "Introduction to Program Synthesis", "url": "https://people.csail.mit.edu/asolar/SynthesisCourse/index.htm", "description": "***MIT***. Armando Solar-Lezama's elementary course on program synthesis."}, {"name": "Structure and Interpretation of Computer Programs", "url": "https://web.mit.edu/6.001/6.037/", "description": "***MIT***. \\[[Book: SICP](https://web.mit.edu/6.001/6.037/sicp.pdf)]. \\[[All Versions](https://scholar.google.com/scholar?cluster=7488066943428166450\\&hl=en\\&as_sdt=0,5)]. Classic course on applying structural, procedural, and meta-linguistic abstraction to solve computational problems."}, {"name": "Discrete Mathematics and Its Applications", "url": "https://faculty.ksu.edu.sa/sites/default/files/rosen_discrete_mathematics_and_its_applications_7th_edition.pdf", "description": ""}], "notes": []}, {"name": "Agi Cocosci \u2014 Programming", "entries": [{"name": "Probabilistic Models of Cognition", "url": "https://probmods.org/", "description": "***MIT***. The probabilistic approach to cognitive science, which models learning and reasoning as inference in complex probabilistic models."}], "notes": []}, {"name": "Agi Cocosci \u2014 Paper Writing", "entries": [{"name": "LaTex Configuration", "url": "https://github.com/SHI-Yu-Zhe/awesome-agi-cocosci/blob/master/README.md/LaTex/config.sty", "description": "***LaTex***. LaTex template for configuration file with elegant reference style (gray-colored reference, page backward reference)."}, {"name": "BibTex Template", "url": "https://github.com/SHI-Yu-Zhe/awesome-agi-cocosci/blob/master/README.md/BibTex/references_header.bib", "description": "***BibTex***. BibTex template for including abbreviations of journals and conferences in AI, Mathematics, and Cognitive Sciences."}, {"name": "bioRender", "url": "https://www.biorender.com/", "description": "***bioRender***. Create professional science figures in minutes by browsing thousands of pre-made icons and templates from more than 30 fields of life sciences."}, {"name": "How to construct a Nature summary paragraph", "url": "https://www.nature.com/documents/nature-summary-paragraph.pdf", "description": "***Nature***. Nature official guidelines for composing abstracts."}, {"name": "How to write a superb literature review", "url": "https://www.nature.com/articles/d41586-020-03422-x", "description": "***Nature***, 2020. Nature speaks to old hands and first timers about the work they did to make their reviews sing."}, {"name": "Scientific Papers", "url": "https://www.nature.com/scitable/topicpage/scientific-papers-13815490/", "description": "***Nature***. Nature guidance on writing scientific papers."}, {"name": "The Machine Learning Reproducibility Checklist", "url": "https://www.cs.mcgill.ca/~jpineau/ReproducibilityChecklist.pdf", "description": "***McGill University***. Guidelines for introducing a machine learning algorithm with guarantee of reproducibility."}], "notes": []}, {"name": "Agi Cocosci \u2014 Paper Reading", "entries": [{"name": "How to Read a Paper", "url": "https://www.cs.uni-potsdam.de/bs/teaching/docs/courses/ss2020/scn/material/p83-keshavA.pdf", "description": "***ACM SIGCOMM Computer Communication Review***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=7234542241721187587\\&hl=en\\&as_sdt=0,5)]. A comprehensive tutorial on reading scientific papers."}, {"name": "How to (seriously) read a scientific paper", "url": "https://www.science.org/content/article/how-seriously-read-scientific-paper", "description": "***Science***, 2016. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=How+to+%28seriously%29+read+a+scientific+paper\\&btnG=)]. Science interview on reading scientific papers."}, {"name": "It's not just you: science papers are getting harder to read", "url": "https://www.nature.com/articles/nature.2017.21751", "description": "***Nature***, 2017. \\[[All Versions](https://scholar.google.com/scholar?cluster=4409814498614719804\\&hl=en\\&as_sdt=0,5)]. Nature perspective on reading scientific papers."}, {"name": "How to navigate a scientific paper with time constraints: a graphics approach", "url": "https://be.mit.edu/sites/default/files/documents/HowToReadAScientificPaper.pdf", "description": "***MIT***. MIT guidance on strategies for reading papers given different time constraints."}, {"name": "Text Visualization Browser", "url": "https://textvis.lnu.se/", "description": "***ISOVIS group***, 2015. \\[[Paper](https://cs.lnu.se/isovis/pubs/docs/kucher-pacificvis15-postprint.pdf)]. \\[[All Versions](https://scholar.google.com/scholar?cluster=7000995325728444282\\&hl=en\\&as_sdt=0,5)]. A Hub of Text Visualization Techniques."}], "notes": []}, {"name": "Agi Cocosci \u2014 Literature Management", "entries": [{"name": "How to keep up with the scientific literature", "url": "https://www.science.org/content/article/how-keep-scientific-literature", "description": "***Science***, 2016. Science interview on organizing scientific papers."}, {"name": "Scientific literature: Information overload", "url": "https://www.nature.com/articles/nj7612-457a", "description": "***Nature***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=9898832432826237365\\&hl=en\\&as_sdt=0,5)]. Perspective on handling overloaded information from scientific literature."}, {"name": "Microsoft Academic Graph", "url": "https://www.microsoft.com/en-us/research/project/microsoft-academic-graph/", "description": "***Microsoft Research***. Heterogeneous graph containing scientific publication records, citation relationships between those publications, as well as authors, institutions, journals, conferences, and fields of study."}, {"name": "An Overview of Microsoft Academic Service (MAS) and Applications", "url": "http://sonyis.me/paperpdf/Microsoft%20Academic%20Graph%20WWW%202015.pdf", "description": "***WWW'15***, 2015. \\[[All Versios](https://scholar.google.com/scholar?cluster=9075899176667058496\\&hl=en\\&as_sdt=0,5)]. Original paper on Microsoft Academic Graph."}, {"name": "Goodbye, Microsoft Academic \u2013 Hello, open research infrastructure?", "url": "https://blogs.lse.ac.uk/impactofsocialsciences/2021/05/27/goodbye-microsoft-academic-hello-open-research-infrastructure/", "description": "***LSE Impact Blog***, 2021. An interpretation of Microsoft's strategy on research infrastructure."}, {"name": "Semantic Scholar", "url": "https://www.semanticscholar.org/", "description": "***Allen Institute for AI Research***. AI-powered scientific literature research tool."}, {"name": "Construction of the Literature Graph in Semantic Scholar", "url": "https://aclanthology.org/N18-3011/", "description": "***NAACL'18***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=5500969515339734950\\&hl=en\\&as_sdt=0,5)]. Semantic Scholar with extracting feature and metadata from raw paper data."}, {"name": "S2ORC: The Semantic Scholar Open Research Corpus", "url": "https://aclanthology.org/2020.acl-main.447/", "description": "***ACL'20***, 2020. \\[[All Versions](https://scholar.google.com/scholar?cluster=11978464475399626925\\&hl=en\\&as_sdt=0,5)]. An open corpus of academic papers released by Semantic Scholar."}, {"name": "Litmaps", "url": "https://www.litmaps.com/", "description": "***Litmap Ltd***. For interactive literature map construction and linked document management."}, {"name": "VOSviewer", "url": "https://www.vosviewer.com/", "description": "***Leiden University***. For constructing and visualizing bibliometric networks."}, {"name": "StateOfTheArt.AI", "url": "https://www.stateoftheart.ai/", "description": "***StateOfTheArtAI***. For tracking, collecting and visualizing the development of AI research."}], "notes": []}, {"name": "Agi Cocosci \u2014 Knowledge Management", "entries": [{"name": "Library of Congress Classification", "url": "https://www.loc.gov/aba/publications/FreeLCC/freelcc.html", "description": "***Library of Congress***. Classification system of USA (PDF only)."}, {"name": "Chinese Library Classification", "url": "http://cct.nlc.cn/", "description": "***National Library of China***. Classification system of P. R. China (online user interface in Chinese). \\[[English introduction at ISKO](https://www.isko.org/cyclo/clc)]. \\[[Wikipedia-EN](https://en.wikipedia.org/wiki/Chinese_Library_Classification)]."}, {"name": "DDC at German National Library", "url": "https://rvk.uni-regensburg.de/regensburger-verbundklassifikation-online", "description": "***Deutsche National Bibliothek***. Deway Decimal Classification (DDC) based classification system of Germany (online user interface). \\[[DNB Website](https://www.dnb.de/EN/Professionell/DDC-Deutsch/DDCinDNB/ddcindnb_node.html)]."}, {"name": "National Dite Library Classification", "url": "https://www.ndl.go.jp/jp/data/catstandards/classification_subject/ndlc.html", "description": "***National Diet Library of Japan***. Classification system of Japan (PDF only)."}, {"name": "DDC at OCLC (Wikipedia)", "url": "https://en.wikipedia.org/wiki/List_of_Dewey_Decimal_classes", "description": "***Online Computer Library Center (OCLC)***. \\[[OCLC Website](https://www.oclc.org/en/home.html)]. \\[[Introduction to DDC](https://www.oclc.org/content/dam/oclc/dewey/versions/print/intro.pdf)]. \\[[DDC Manual](https://www.oclc.org/content/dam/oclc/webdewey/help/full_manual.pdf)]. Dewey Decimal Classification (DDC) system for worldwide library resouce construction. \\[[DDC Class 000 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/000.pdf)]. \\[[DDC Class 100 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/100.pdf)]. \\[[DDC Class 200 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/200.pdf)]. \\[[DDC Class 300 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/300.pdf)]. \\[[DDC Class 400 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/400.pdf)]. \\[[DDC Class 500 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/500.pdf)]. \\[[DDC Class 600 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/600.pdf)]. \\[[DDC Class 700 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/700.pdf)]. \\[[DDC Class 800 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/800.pdf)]. \\[[DDC Class 900 (PDF only)](https://www.oclc.org/content/dam/oclc/webdewey/help/900.pdf)]."}, {"name": "Knowledge organization", "url": "https://en.wikipedia.org/wiki/Knowledge_organization", "description": "***Wikipedia***. Wikipedia on knowledge organization methods."}, {"name": "The Zettelkasten Method", "url": "https://zettelkasten.de/", "description": "***Bielefeld University***. Relating ideas in graphs and multi-labels."}, {"name": "Zettelkasten", "url": "https://en.wikipedia.org/wiki/Zettelkasten", "description": "***Wikipedia***. Wikipedia on the Zettelkasten method."}, {"name": "Roam Research", "url": "https://roamresearch.com/", "description": "***Roam Research***. For linked document management, visualization, and sharing."}, {"name": "Foam", "url": "https://foambubble.github.io/foam/", "description": "***Foambubble***. For linked document management, visualization, and sharing, opensourced softward built on VSCode."}, {"name": "Building a Second Brain", "url": "https://www.buildingasecondbrain.com/", "description": "***Forte Labs, LLC***. Connecting ideas in graphs."}, {"name": "Zotero", "url": "https://www.zotero.org/", "description": "***Digital Scholar***. For reference management to manage bibliographic data and research related materials."}, {"name": "Niklas Luhmann's Card Index: Thinking Tool, Communication Partner, Publication Machine", "url": "https://pdfs.semanticscholar.org/88f8/fa9dfbc0c2b296758dd932b871917c5c775a.pdf%C2%A0", "description": "***Forgetting Machines: Knowledge Management Evolution in Early Modern Europe, Brill***, 2016. \\[[All Versions](https://scholar.google.com/scholar?cluster=1786807670077004336\\&hl=en\\&as_sdt=0,5)]."}, {"name": "The card index as creativity machine", "url": "https://culturemachine.net/wp-content/uploads/2019/01/373-604-1-PB.pdf", "description": "***Culture Machine***, 2010. \\[[All Versions](https://scholar.google.com/scholar?cluster=9767873312286889264\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Where Does Niklas Luhmann's Card Index Come From?", "url": "https://www.researchgate.net/profile/Alberto-Cevolini/publication/328624186_Where_Does_Niklas_Luhmann%27s_Card_Index_Come_From/links/609f818e299bf147699a401d/Where-Does-Niklas-Luhmanns-Card-Index-Come-From.pdf", "description": "***Erudition and the Republic of Letters***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=8279465066043884141\\&hl=en\\&as_sdt=0,5)]. A simplified introduction on Luhmann's Zettelkasten."}, {"name": "Niklas Luhmann's Card Index: The Fabrication of Serendipity", "url": "https://www.uni-bielefeld.de/fakultaeten/soziologie/forschung/luhmann-archiv/pdf/jschmidt_niklas-luhmanns-card-index_-sociologica_2018_12-1.pdf", "description": "***Sociologica***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=12440286698665929622\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Communicating with Slip Boxes", "url": "https://luhmann.surge.sh/communicating-with-slip-boxes", "description": "2019. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=Communicating+with+slip+boxes+luhmann\\&btnG=)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 MIT", "entries": [{"name": "Center for Brains, Minds and Machines (CBMM)", "url": "https://cbmm.mit.edu/", "description": "***MIT***."}, {"name": "Josh Tenenbaum", "url": "https://cocosci.mit.edu/josh", "description": "***Department of Brain and Cognitive Sciences, CSAIL, MIT***, [Computational Cognitive Science Group (CoCoSci Group)](https://cocosci.mit.edu/) - ***MIT***."}, {"name": "Rebecca Saxe", "url": "https://saxelab.mit.edu/people/rebecca-saxe", "description": "***Department of Brain and Cognitive Sciences, MIT***, [Social Cognitive Neuroscience Laboratory (SaxeLab)](https://saxelab.mit.edu/) - ***MIT***."}, {"name": "Laura Schulz", "url": "https://cbmm.mit.edu/about/people/schulz", "description": "***Department of Brain and Cognitive Sciences, MIT***, [Early Childhood Cognition Lab](https://eccl.mit.edu/) - ***MIT***."}, {"name": "Leslie Kaelbling", "url": "https://people.csail.mit.edu/lpk/", "description": "***Department of Electrical Engineering and Computer Science, CSAIL, MIT***, [The Learning & Intelligent Systems Group](https://lis.csail.mit.edu/) - ***MIT***."}, {"name": "Armando Solar-Lezama", "url": "https://people.csail.mit.edu/asolar/", "description": "***Department of Electrical Engineering and Computer Science, CSAIL, MIT***, [Computer-Aided Programming Group](http://groups.csail.mit.edu/cap/) - ***MIT***."}], "notes": []}, {"name": "Agi Cocosci \u2014 Stanford", "entries": [{"name": "Li Fei-Fei", "url": "https://profiles.stanford.edu/fei-fei-li", "description": "***Computer Science Department, Human-Centered AI Institute, Stanford***, [Stanford Vision and Learning Lab](https://svl.stanford.edu/) - ***Stanford***."}, {"name": "Noah Goodman", "url": "https://cocolab.stanford.edu/ndg.html", "description": "***Department of Psychology, Computer Science Department, Stanford***, [Computation & Cognition Lab (CoCoLab)](https://cocolab.stanford.edu/) - ***Stanford***."}, {"name": "Michael Frank", "url": "https://web.stanford.edu/~mcfrank/", "description": "***Department of Psychology, Stanford***, [The Stanford Language and Cognition Lab](http://langcog.stanford.edu/) - ***Stanford***."}, {"name": "Tobias Gerstenberg", "url": "https://cicl.stanford.edu/member/tobias_gerstenberg/", "description": "***Department of Psychology, Stanford***, [Causality in Cognition Lab (CICL)](https://cicl.stanford.edu/) - ***Stanford***."}, {"name": "Chelsea Finn", "url": "http://ai.stanford.edu/~cbfinn/", "description": "***Computer Science Department, Stanford***, [Intelligence through Robotic Interaction at Scale (IRIS Group)](https://irislab.stanford.edu/) - ***Stanford***."}, {"name": "Jeremy Bailenson", "url": "https://comm.stanford.edu/faculty-bailenson/", "description": "***Department of Communication, Stanford***, [Virtual Human Interaction Lab (VHIL)](https://stanfordvr.com/) - ***Stanford***."}, {"name": "Jiajun Wu", "url": "https://jiajunwu.com/", "description": "***Computer Science Department, Stanford***."}, {"name": "Judith Fan", "url": "https://profiles.stanford.edu/judith-fan", "description": "***Department of Psychology, Stanford***, [Cognitive Tools Lab](https://cogtoolslab.github.io/) - ***Stanford***."}], "notes": []}, {"name": "Agi Cocosci \u2014 Princeton", "entries": [{"name": "Tania Lombrozo", "url": "https://psych.princeton.edu/person/tania-lombrozo", "description": "***Department of Psychology, Princeton***, [Concepts & Cognition Lab](https://cognition.princeton.edu/) - ***Princeton***."}, {"name": "Thomas Griffiths", "url": "https://cocosci.princeton.edu/tom/index.php", "description": "***Department of Psychology, Department of Computer Science, Princeton***, [Computational Cognitive Science Lab](https://cocosci.princeton.edu/index.php) - ***Princeton***."}], "notes": []}, {"name": "Agi Cocosci \u2014 Harvard", "entries": [{"name": "Elizabeth Spelke", "url": "https://psychology.fas.harvard.edu/people/elizabeth-s-spelke", "description": "***Department of Psychology, Harvard***, [Harvard Laboratory for Developmental Studies](https://www.harvardlds.org/) - ***Harvard***."}, {"name": "Tomer Ullman", "url": "https://www.tomerullman.org/", "description": "***Department of Psychology, Harvard***, [Computation, Cognition, and Development Lab (CoCoDev)](https://cocodev.fas.harvard.edu/) - ***Harvard***."}, {"name": "Samuel Gershman", "url": "https://psychology.fas.harvard.edu/people/samuel-j-gershman", "description": "***Department of Psychology, Harvard***, [Computational Cognitive Neuroscience Lab (CCN Lab)](https://gershmanlab.com/) - ***Harvard***."}, {"name": "Fiery Cushman", "url": "https://psychology.fas.harvard.edu/people/fiery-cushman", "description": "***Department of Psychology, Harvard***, [Moral Psychology Research Lab](https://cushmanlab.fas.harvard.edu/) - ***Harvard***."}], "notes": []}, {"name": "Agi Cocosci \u2014 UCLA", "entries": [{"name": "Center for Vision, Cognition, Learning and Autonomy (VCLA)", "url": "http://vcla.stat.ucla.edu/", "description": "***Department of Statistics, UCLA***."}, {"name": "Ying Nian Wu", "url": "http://www.stat.ucla.edu/~ywu/", "description": "***Department of Statistics, UCLA***."}, {"name": "Tao Gao", "url": "http://www.stat.ucla.edu/~taogao/Taogao.html", "description": "***Department of Statistics, Department of Psychology, UCLA***, [Visual Intelligence Lab](http://www.stat.ucla.edu/~taogao/index.html) - ***UCLA***."}, {"name": "Hongjing Lu", "url": "https://www.psych.ucla.edu/faculty/page/hongjing", "description": "***Department of Psychology, Department of Statistics, UCLA***, [Computational Vision and Learning Lab (CVL)](http://cvl.psych.ucla.edu/) - ***UCLA***."}, {"name": "Guy Van den Broeck", "url": "http://web.cs.ucla.edu/~guyvdb/", "description": "***Department of Computer Science, UCLA***, [StarAI Lab](http://starai.cs.ucla.edu/#) - ***UCLA***."}], "notes": []}, {"name": "Agi Cocosci \u2014 UC Berkeley", "entries": [{"name": "Anca Dragan", "url": "https://people.eecs.berkeley.edu/~anca/index.html", "description": "***Department of Electrical Engineering and Computer Science, UC Berkeley***, [Interactive Autonomy and Collaborative Technologies Laboratory (InterACT)](http://interact.berkeley.edu/) - ***UC Berkeley***."}, {"name": "Fei Xu", "url": "https://psychology.berkeley.edu/people/fei-xu", "description": "***Department of Psychology, UC Berkeley***, [Berkeley Early Learning Lab (Xu Lab)](https://babylab5.wixsite.com/bell) - ***UC Berkeley***."}, {"name": "Alison Gopnik", "url": "http://alisongopnik.com/", "description": "***Department of Psychology, UC Berkeley***, [Cognitive Development & Learning Lab (Gopnik Lab)](http://www.gopniklab.berkeley.edu/) - ***UC Berkeley***."}, {"name": "Steve Piantadosi", "url": "http://colala.berkeley.edu/people/piantadosi/", "description": "***Department of Psychology, UC Berkeley***, [The computation and language lab (colala)](http://colala.berkeley.edu/) - ***UC Berkeley***."}, {"name": "Celeste Kidd", "url": "http://www.celestekidd.com/", "description": "***Department of Psychology, UC Berkeley***, [Kidd Lab](https://www.kiddlab.com/) - ***UC Berkeley***."}], "notes": []}, {"name": "Agi Cocosci \u2014 BNU", "entries": [{"name": "Yanchao Bi", "url": "https://brain.bnu.edu.cn/English/Faculty/CurrentFaculty/Bzz/a552402e529a4f27b979378abd42c10e.htm", "description": "***IDG/McGovern Institute for Brain Research and the State Key Laboratory of Cognitive Neuroscience and Learning, Beijing Normal University (BNU)***, [Yanchao Bi's Concept Lab (Bi Lab)](http://bilab.bnu.edu.cn/) - ***BNU***."}], "notes": []}, {"name": "Agi Cocosci \u2014 PKU", "entries": [{"name": "Song-Chun Zhu", "url": "https://zhusongchun.net/", "description": "***School of AI and Institute for AI, Peking University (PKU)***."}, {"name": "Yixin Zhu", "url": "https://yzhu.io/", "description": "***School of AI and Institute for AI, Peking University (PKU)***, [Cognitive Reasoning Lab (CoRe Lab)](https://pku.ai/) - ***PKU***."}], "notes": []}, {"name": "Agi Cocosci \u2014 UCSD", "entries": [{"name": "Zhuowen Tu", "url": "https://pages.ucsd.edu/~ztu/", "description": "***Department of Computer Science, UCSD***, [Machine Learning, Perception, and Cognition Lab (mlPC)](https://pages.ucsd.edu/~ztu/Group.htm) - ***UCSD***."}, {"name": "Ed Vul", "url": "https://psychology.ucsd.edu/people/profiles/evul.html", "description": "***Department of Psychology, UCSD***, [Computational Cognition Lab](http://www.evullab.org/index.html) - ***UCSD***."}], "notes": []}, {"name": "Agi Cocosci \u2014 NYU", "entries": [{"name": "Ernest Davis", "url": "https://cs.nyu.edu/~davise/", "description": "***Department of Computer Science, Courant Institute of Mathematical Sciences, NYU***."}, {"name": "Gary Marcus", "url": "http://garymarcus.com/index.html", "description": "***Department of Psychology, NYU***."}, {"name": "Brenden Lake", "url": "https://cims.nyu.edu/~brenden/", "description": "***Department of Psychology, NYU***, [Human & Machine Learning Lab (Lake Lab)](https://lake-lab.github.io/) - ***NYU***."}, {"name": "Todd Gureckis", "url": "https://as.nyu.edu/faculty/todd-gureckis.html", "description": "***Department of Psychology, NYU***, [Computation & Cognition Lab](http://gureckislab.org/) - ***NYU***."}, {"name": "Wei Ji Ma", "url": "http://www.cns.nyu.edu/malab/people.html", "description": "***Department of Psychology, Center for Neural Science, NYU***, [Wei Ji Ma Lab](http://www.cns.nyu.edu/malab/) - ***NYU***."}], "notes": []}, {"name": "Agi Cocosci \u2014 JHU", "entries": [{"name": "Chaz Firestone", "url": "https://perception.jhu.edu/chaz/", "description": "***Department of Psychological and Brain Sciences, Johns Hopkins University (JHU)***, [Hopkins Perception & Mind Lab](https://perception.jhu.edu/) - ***JHU***."}], "notes": []}, {"name": "Agi Cocosci \u2014 SIT", "entries": [{"name": "Mark Ho", "url": "https://markkho.github.io/", "description": "***Department of Computer Science, Stevens Institute of Technology (SIT)***, [Computation and Decision-Making Lab](https://codec-lab.github.io/) - ***SIT***."}], "notes": []}, {"name": "Agi Cocosci \u2014 John Hopcroft", "entries": [{"name": "Introduction to Automata Theory, Languages, and Computation", "url": "http://elib.vku.udn.vn/bitstream/123456789/2543/1/2007.%20Introduction%20to%20Automata%20Theory%2C%20Languages%2C%20and%20Computations%20%283rd%20edition%29.pdf", "description": "***Pearson***, 2007. \\[[All Versions](https://scholar.google.com/scholar?cluster=326269839585842480)]."}, {"name": "Foundations of Data Science", "url": "http://www.cs.cornell.edu/jeh/book%20no%20so;utions%20March%202019.pdf", "description": "***Cambridge University Press***. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=1802704438630899850)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Ulf Grenander", "entries": [{"name": "A Calculus of Ideas: A Mathematical Study of Thinking", "url": "https://www.dam.brown.edu/ptg/REPORTS/calculustext.PDF", "description": "***World Scientific Publishing Company***, 2012. \\[[All Versions](https://scholar.google.com/scholar?cluster=12182416000849265255\\&hl=en\\&as_sdt=0,5)]."}, {"name": "General Pattern Theory: A Mathematical Study of Regular Structures", "url": "https://global.oup.com/academic/product/general-pattern-theory-9780198536710?cc=lt\\&lang=de#", "description": "***Oxford University Press***, 1993. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=General+Pattern+Theory\\&btnG=)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 David Marr", "entries": [{"name": "Vision: A Computational Investigation into the Human Representation and Processing of Visual Information", "url": "https://usa1lib.org/book/1223444/8e5ca8", "description": "***MIT Press***, 1982. \\[[All Versions](https://scholar.google.com/scholar?cluster=14386368570811483142\\&hl=en\\&as_sdt=0,44)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Michael Tomasello", "entries": [{"name": "Origins of human communication", "url": "https://1lib.net/book/541274/39859f", "description": "***MIT Press***, 2010. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=2553369883266458474)]."}, {"name": "The cultural origins of human cognition", "url": "https://hk1lib.org/book/541275/1452f8?id=541275\\&secret=1452f8", "description": "***Havard University Press***, 2000. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=5000469061641945144)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Judea Pearl", "entries": [{"name": "The Book of Why: The New Science of Cause and Effect", "url": "http://bayes.cs.ucla.edu/WHY/", "description": "***Basic Books***, 2018. \\[[All Versions](https://scholar.google.com/scholar?cluster=2505901292485349932\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Causality: Models, Reasoning and Inference", "url": "https://hk1lib.org/book/2780725/2ec8f1?id=2780725\\&secret=2ec8f1", "description": "***Cambridge University Press***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=10996260119229499611\\&hl=en\\&as_sdt=0,5\\&as_vis=1)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Susan Carey", "entries": [{"name": "The Origin of Concepts", "url": "https://hk1lib.org/book/844457/42178f?id=844457\\&secret=42178f", "description": "***Oxford University Press***, 2009. \\[[All Versions](https://scholar.google.com/scholar?cluster=11493102398422813821\\&hl=en\\&as_sdt=0,5)]."}, {"name": "Conceptual Change in Childhood", "url": "https://hk1lib.org/book/3659332/11fa44", "description": "***MIT Press***, 1985. \\[[All Versions](https://scholar.google.com/scholar?hl=en\\&as_sdt=0%2C5\\&q=conceptual+change+in+childhood+susan+carey\\&btnG=)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Daniel Kahneman", "entries": [{"name": "Thinking, fast and slow", "url": "https://hk1lib.org/book/2181569/f5e85a?id=2181569\\&secret=f5e85a", "description": "***Farrar Straus Giroux***, 2011. \\[[All Versions](https://scholar.google.com/scholar?oi=bibs\\&hl=en\\&cluster=3255681708785115121)]."}], "notes": []}, {"name": "Agi Cocosci \u2014 Karl Popper", "entries": [{"name": "The logic of scientific discovery", "url": "https://hk1lib.org/book/511214/299596", "description": "***Routledge***, 2005. \\[[All Versions](https://scholar.google.com/scholar?cluster=5836864564733788424\\&hl=en\\&as_sdt=0,5)]."}, {"name": "All Life is Problem Solving", "url": "https://hk1lib.org/book/2773070/c48f60", "description": "***Routledge***, 2001. \\[[All Versions](https://scholar.google.com/scholar?cluster=9799073870888093350\\&hl=en\\&as_sdt=0,5)]."}], "notes": []}], "total_entries": 1055}, {"name": "Talks", "subcategories": [{"name": "Talks \u2014 Categories", "entries": [{"name": "Software Development", "url": "#software-development", "description": ""}, {"name": "Object-Oriented Programming", "url": "#object-oriented-programming", "description": ""}, {"name": "Functional Programming", "url": "#functional-programming", "description": ""}, {"name": "Software Design", "url": "#software-design", "description": ""}, {"name": "Web Development", "url": "#web-development", "description": ""}, {"name": "Test-Driven Development", "url": "#test-driven-development", "description": ""}, {"name": "Methodologies", "url": "#methodologies", "description": ""}, {"name": "Computer History", "url": "#computer-history", "description": ""}, {"name": "Databases", "url": "#databases", "description": ""}, {"name": "Security", "url": "#security", "description": ""}, {"name": "Cognitive Development", "url": "#cognitive-development", "description": ""}, {"name": "The Computer Revolution hasn't happend yet", "url": "https://www.youtube.com/watch?v=oKg1hTOQXoY", "description": ""}, {"name": "The Future of Programming", "url": "https://vimeo.com/71278954", "description": ""}, {"name": "Inventing on Principle", "url": "https://vimeo.com/38272912", "description": ""}, {"name": "Media for Thinking the Unthinkable", "url": "http://worrydream.com/MediaForThinkingTheUnthinkable/", "description": ""}, {"name": "Finding a Way Out", "url": "http://www.infoq.com/presentations/reimagining-software", "description": ""}, {"name": "Programming is terrible - Lessons learned from a life wasted", "url": "https://www.youtube.com/watch?v=AUYPnxv0yss", "description": ""}, {"name": "Computers are a Sadness, I am the Cure", "url": "https://vimeo.com/95066828", "description": ""}, {"name": "Are We There Yet?", "url": "http://www.infoq.com/presentations/Are-We-There-Yet-Rich-Hickey", "description": ""}, {"name": "Simple Made Easy", "url": "http://www.infoq.com/presentations/Simple-Made-Easy", "description": ""}, {"name": "The Value of Values", "url": "https://www.infoq.com/presentations/Value-Values", "description": ""}, {"name": "Effective Programs - 10 Years of Clojure", "url": "https://www.youtube.com/watch?v=2V1FtfBDsLU", "description": ""}, {"name": "The Web We Lost", "url": "https://www.youtube.com/watch?v=9KKMnoTTHJk", "description": ""}, {"name": "Growing a Language", "url": "https://www.youtube.com/watch?v=_ahvzDzKdB0", "description": ""}, {"name": "The Mess We're In", "url": "https://www.youtube.com/watch?v=lKXe3HUG2l4\\&list=UU_QIfHvN9auy2CoOdSfMWDw", "description": ""}, {"name": "To the Moon!", "url": "https://www.youtube.com/watch?v=4Sso4HtvJsw", "description": ""}, {"name": "Simplify Challenging Software Problems with Rocket Science", "url": "https://www.youtube.com/watch?v=h1g1YyVO6j8", "description": ""}, {"name": "A short history of Software Engineering, and other ideas that didn't work", "url": "https://www.youtube.com/watch?v=CnquVcxvAl0", "description": ""}, {"name": "Linus Torvalds on Git", "url": "https://www.youtube.com/watch?v=idLyobOhtO4", "description": ""}, {"name": "The Worst Programming Language Ever", "url": "https://www.youtube.com/watch?v=vcFBwt1nu2U", "description": ""}, {"name": "Unconventional Programming with Chemical Computing", "url": "https://www.youtube.com/watch?v=cHoYNStQOEc", "description": ""}, {"name": "Seven Ineffective Coding Habits of Many Programmers", "url": "https://vimeo.com/97329157", "description": ""}, {"name": "5 WTFs in 6 LOCs", "url": "https://brightonruby.com/2016/five-wtfs-in-six-lines-of-code-dot-wingrove/", "description": ""}, {"name": "Programming is Writing is Programming", "url": "https://www.youtube.com/watch?v=uO3a4HIBDU4", "description": ""}, {"name": "We're Doing It All Wrong", "url": "https://www.youtube.com/watch?v=TS1lpKBMkgg", "description": ""}, {"name": "Real Software Engineering", "url": "https://www.youtube.com/watch?v=RhdlBHHimeM", "description": ""}, {"name": "Feature Branching Considered Evil", "url": "https://www.youtube.com/watch?v=h7LeD7VevyI", "description": ""}, {"name": "Programming\u2019s Greatest Mistakes", "url": "https://www.youtube.com/watch?v=qC_ioJQpv4E", "description": ""}, {"name": "Email vs Capitalism: A Story About Why We Can't Have Nice Things", "url": "https://www.youtube.com/watch?v=U8mJCPpvu1I", "description": ""}, {"name": "Preventing the Collapse of Civilization", "url": "https://www.youtube.com/watch?v=ZSRHeXYDLko", "description": ""}, {"name": "Functional is cool, but do you know OO", "url": "https://www.youtube.com/watch?v=oiFYPAel-KY", "description": ""}, {"name": "Stop Writing Classes", "url": "http://pyvideo.org/video/880/stop-writing-classes", "description": ""}, {"name": "Functional Principles for Object-Oriented Developers", "url": "http://www.youtube.com/watch?v=pMGY9ViIGNU", "description": ""}, {"name": "Adventures in Functional Programming", "url": "https://vimeo.com/45140590", "description": ""}, {"name": "Functional Programming: What? Why? When?", "url": "https://vimeo.com/97514630", "description": ""}, {"name": "Deconstructing Functional Programming", "url": "http://www.infoq.com/presentations/functional-pros-cons", "description": ""}, {"name": "Living in a Post-Functional World", "url": "http://www.infoq.com/presentations/post-functional-scala-clojure-haskell", "description": ""}, {"name": "Extreme Cleverness: Functional Data Structures in Scala", "url": "https://www.youtube.com/watch?v=pNhBQJN44YQ", "description": ""}, {"name": "Tangible Functional Programming", "url": "https://www.youtube.com/watch?v=faJ8N0giqzw", "description": ""}, {"name": "Faith, Evolution, and Programming Languages", "url": "https://www.youtube.com/watch?v=8frGknO8rIg", "description": ""}, {"name": "Don't fear the Monad", "url": "https://www.youtube.com/watch?v=ZhuHCtR3xq8", "description": ""}, {"name": "Functional Programming Design Patterns", "url": "https://vimeo.com/113588389", "description": ""}, {"name": "Domain modelling with the F# type system", "url": "http://vimeo.com/97507575", "description": ""}, {"name": "Propositions as Types", "url": "https://www.youtube.com/watch?v=IOiZatlZtGU", "description": ""}, {"name": "Category Theory for the Working Hacker", "url": "https://www.infoq.com/presentations/category-theory-propositions-principle", "description": ""}, {"name": "Types are like the Weather, Type Systems are like Weathermen", "url": "https://www.youtube.com/watch?v=XTl7Jn_kmio", "description": ""}, {"name": "Functional architecture - The pits of success", "url": "https://www.youtube.com/watch?v=US8QG9I1XW0", "description": ""}, {"name": "To Clojure and back: Writing and rewriting in Ruby", "url": "https://www.youtube.com/watch?v=doZ0XAc9Wtc", "description": ""}, {"name": "All I needed for FP I learned in High School Algebra", "url": "https://www.youtube.com/watch?v=epT1xgxSpFU", "description": ""}, {"name": "Solving Problems The Clojure Way", "url": "https://www.youtube.com/watch?v=vK1DazRK_a0", "description": ""}, {"name": "Architecture the Lost Years", "url": "https://www.youtube.com/watch?v=WpkDN78P884", "description": ""}, {"name": "DDD: putting the model to work", "url": "http://www.infoq.com/presentations/model-to-work-evans", "description": ""}, {"name": "Unleash Your Domain", "url": "https://vimeo.com/19428577", "description": ""}, {"name": "The Art of Destroying Software", "url": "https://www.youtube.com/watch?v=1FPsJ-if2RU", "description": ""}, {"name": "8 Lines of Code", "url": "https://www.infoq.com/presentations/8-lines-code-refactoring", "description": ""}, {"name": "Strategic Design", "url": "http://www.infoq.com/presentations/strategic-design-evans", "description": ""}, {"name": "Reliability, Availability, and Scalability", "url": "https://vimeo.com/6222577", "description": ""}, {"name": "Implementing Micro Service Architectures", "url": "https://vimeo.com/79866979", "description": ""}, {"name": "Immutability Changes Everything", "url": "http://vimeo.com/52831373", "description": ""}, {"name": "Crafting Wicked Domain Models", "url": "https://vimeo.com/43598193", "description": ""}, {"name": "The Actor Model", "url": "https://www.youtube.com/watch?v=7erJ1DV_Tlo", "description": ""}, {"name": "How To Design A Good API and Why it Matters", "url": "http://www.youtube.com/watch?v=aAb7hSCtvGw", "description": ""}, {"name": "The Joys and Pains of a Long Lived Codebase", "url": "http://www.infoq.com/presentations/Lessons-Learned-Jeremy-Miller", "description": ""}, {"name": "Microservices", "url": "https://www.youtube.com/watch?v=wgdBVIX9ifA", "description": ""}, {"name": "Stewardship: The Sobering Parts", "url": "https://www.youtube.com/watch?v=2y5Pv4yN0b0", "description": ""}, {"name": "Therapeutic Refactoring", "url": "https://www.youtube.com/watch?v=J4dlF0kcThQ", "description": ""}, {"name": "Evidence-Oriented Programming", "url": "https://www.youtube.com/watch?v=uEFrE6cgVNY", "description": ""}, {"name": "The Programming Language Wars", "url": "https://www.youtube.com/watch?v=mDZ-QSLQIB8", "description": ""}, {"name": "Hopelessness and Confidence in Distributed Systems Design", "url": "https://www.youtube.com/watch?v=TlU1opuCXB0", "description": ""}, {"name": "Kill \"Microservices\" Before Its Too Late", "url": "https://www.youtube.com/watch?v=-UKEPd2ipEk", "description": ""}, {"name": "The Lost Art Of Software Design", "url": "https://www.youtube.com/watch?v=gNj8I4uSTgc", "description": ""}, {"name": "Tidy First", "url": "https://www.youtube.com/watch?v=XmsyvStDuqI", "description": ""}, {"name": "Crockford on JavaScript", "url": "https://www.youtube.com/playlist?list=PL7664379246A246CB", "description": ""}, {"name": "Go To There and Back Again", "url": "http://vimeo.com/78893726", "description": ""}, {"name": "The Better Parts", "url": "https://www.youtube.com/watch?v=XFTOG895C7c", "description": ""}, {"name": "Introduction to Node.js", "url": "https://www.youtube.com/watch?v=M-sc73Y-zQA", "description": ""}, {"name": "WAT", "url": "https://www.destroyallsoftware.com/talks/wat", "description": ""}, {"name": "The Birth & Death of JavaScript", "url": "https://www.destroyallsoftware.com/talks/the-birth-and-death-of-javascript", "description": ""}, {"name": "Hey Underscore, You're Doing It Wrong!", "url": "http://www.youtube.com/watch?v=m3svKOdZijA", "description": ""}, {"name": "Community.js", "url": "https://www.youtube.com/watch?v=23Yxji-tEfc", "description": ""}, {"name": "An End to Negativity", "url": "https://www.youtube.com/watch?v=17rkSdkc5TI", "description": ""}, {"name": "Is Node.js Better", "url": "https://www.youtube.com/watch?v=C5fa1LZYodQ", "description": ""}, {"name": "Life is Terrible: Let's Talk About the Web", "url": "http://vimeo.com/111122950", "description": ""}, {"name": "Critical rendering path - Crash course on web performance", "url": "https://www.youtube.com/watch?v=PkOBnYxqj3k", "description": ""}, {"name": "10 Things I Learned from the jQuery Source", "url": "https://vimeo.com/12529436", "description": ""}, {"name": "Om Next", "url": "https://www.youtube.com/watch?v=ByNs9TG30E8", "description": ""}, {"name": "ClojureScript for Skeptics", "url": "https://www.youtube.com/watch?v=gsffg5xxFQI", "description": ""}, {"name": "TDD, where did it all go wrong", "url": "http://vimeo.com/68375232", "description": ""}, {"name": "Holistic testing", "url": "http://vimeo.com/68390508", "description": ""}, {"name": "Boundaries", "url": "https://www.destroyallsoftware.com/talks/boundaries", "description": ""}, {"name": "Is TDD Dead?", "url": "https://martinfowler.com/articles/is-tdd-dead/", "description": ""}, {"name": "The Transformation Priority Premise", "url": "https://www.youtube.com/watch?v=B93QezwTQpI", "description": ""}, {"name": "TDD in Tatters", "url": "https://vimeo.com/97537026", "description": ""}, {"name": "Test-Driven Development - Write better code in less time", "url": "https://www.youtube.com/watch?v=HhwElTL-mdI", "description": ""}, {"name": "The Magic Tricks of Testing", "url": "https://www.youtube.com/watch?v=URSWYvyc42M", "description": ""}, {"name": "How To Stop Hating Your Tests", "url": "https://vimeo.com/145917204", "description": ""}, {"name": "Why You Don't Get Mock Objects", "url": "https://www.youtube.com/watch?v=R9FOchgTtLM", "description": ""}, {"name": "The Clean Code Talks - Unit Testing", "url": "https://www.youtube.com/watch?v=wEhu57pih5w", "description": ""}, {"name": "TDD and Software Design", "url": "https://www.youtube.com/watch?v=ty3p5VDcoOI", "description": ""}, {"name": "Integrated Tests Are a Scam", "url": "https://vimeo.com/80533536", "description": ""}, {"name": "Structure and Interpretation of Test Cases", "url": "https://vimeo.com/289852238", "description": ""}, {"name": "Does TDD Really Lead to Good Design?", "url": "https://www.youtube.com/watch?v=KyFVA4Spcgg", "description": ""}, {"name": "TDD For Those Who Don't Need It", "url": "https://www.youtube.com/watch?v=a6oP24CSdUg", "description": ""}, {"name": "TDD: Theme & Variations", "url": "https://www.youtube.com/watch?v=C5IH0ABmyc0", "description": ""}, {"name": "The Land that Scrum Forgot", "url": "https://www.youtube.com/watch?v=hG4LH6P8Syk", "description": ""}, {"name": "Demanding Professionalism in Software Development", "url": "https://www.youtube.com/watch?v=p0O1VVqRSK0", "description": ""}, {"name": "Spotify Engineering Culture - Part 1", "url": "https://vimeo.com/85490944", "description": ""}, {"name": "Spotify Engineering Culture - Part 2", "url": "http://vimeo.com/94950270", "description": ""}, {"name": "Adopting Continuous Delivery", "url": "http://vimeo.com/68320415", "description": ""}, {"name": "The Death of Agile", "url": "https://www.youtube.com/watch?v=YpGGRAhes2k", "description": ""}, {"name": "Why Agile Works", "url": "https://www.youtube.com/watch?v=BdSiBlLafNY", "description": ""}, {"name": "Implementing Programmer Anarchy", "url": "https://vimeo.com/79866978", "description": ""}, {"name": "Moving Past the Scaling Myth", "url": "https://www.infoq.com/presentations/scalability-variant-structuring#", "description": ""}, {"name": "It Is Not About Software Anymore", "url": "https://www.youtube.com/watch?v=X8iIRG9LA54", "description": ""}, {"name": "7 minutes, 26 seconds, and the Fundamental Theorem of Agile Software Development", "url": "https://www.youtube.com/watch?v=WSes_PexXcA", "description": ""}, {"name": "Explaining Team Flow", "url": "https://www.youtube.com/watch?v=bhpQKA9XYcE", "description": ""}, {"name": "The Efficiency Paradox", "url": "https://www.youtube.com/watch?v=hGJpez7rvc0", "description": ""}, {"name": "Extreme Product Development", "url": "https://www.youtube.com/watch?v=U6TA7atF4Y0", "description": ""}, {"name": "A Brief History of Graphics", "url": "https://www.youtube.com/playlist?list=PLOQZmjD6P2HlOoEVKOPaCFvLnjP865X1f", "description": ""}, {"name": "The Charming Genius of the Apollo Guidance Computer", "url": "https://www.youtube.com/watch?v=xY45YE7ggng", "description": ""}, {"name": "The History (and the Future) of Software", "url": "https://www.youtube.com/watch?v=OdI7Ukf-Bf4", "description": ""}, {"name": "The Future of Programming", "url": "https://www.youtube.com/watch?v=ecIWPzGEbFc", "description": ""}, {"name": "1968", "url": "https://www.youtube.com/watch?v=KjgvffBlWAg", "description": ""}, {"name": "DOOM\u2019s Development: A Year of Madness", "url": "https://www.youtube.com/watch?v=eBU34NZhW7I", "description": ""}, {"name": "The Boeing 737 MAX: When Humans and Technology Don't Mix", "url": "https://www.youtube.com/watch?v=opRbU6WZH9s", "description": ""}, {"name": "Deconstructing the Database", "url": "https://www.youtube.com/watch?v=Cym4TZwTCNU", "description": ""}, {"name": "Things Every Developer Absolutely, Positively Needs To Know About Database Indexing", "url": "https://www.youtube.com/watch?v=HubezKbFL7E", "description": ""}, {"name": "Why Do Keynote Speakers Keep Suggesting That Improving Security Is Possible?", "url": "https://www.youtube.com/watch?v=ajGX7odA87k", "description": ""}, {"name": "Acceptance Testing For Continuous Delivery", "url": "https://www.youtube.com/watch?v=s1Y454DTRtg", "description": ""}, {"name": "A Lecture on Creativity", "url": "https://www.youtube.com/watch?v=Pb5oIIPO62g", "description": ""}, {"name": "The Meaning of Life", "url": "https://www.youtube.com/watch?v=zzcCWEb-tyk", "description": ""}, {"name": "Becoming an Outlier: Career Reboot for the Developer Mind", "url": "https://vimeo.com/97415346", "description": ""}, {"name": "Surviving the Framework Hype Cycle", "url": "https://www.youtube.com/watch?v=9zc4DSTRGeM", "description": ""}, {"name": "Stop Treading Water - Learning to Learn", "url": "https://www.youtube.com/watch?v=Z8KcCU-p8QA", "description": ""}, {"name": "The Last Lecture: Achieving Your Childhood Dreams", "url": "https://www.youtube.com/watch?v=ji5_MqicxSo", "description": ""}, {"name": "Steve Jobs' 2005 Stanford Commencement Address", "url": "https://www.youtube.com/watch?v=UF8uR6Z6KLc", "description": ""}, {"name": "Hammock Driven Development", "url": "https://www.youtube.com/watch?v=f84n5oFoZBc", "description": ""}, {"name": "Drive - The Surprising Truth About What Motivates Us", "url": "https://www.youtube.com/watch?v=u6XAPnuFjJc", "description": ""}, {"name": "Ideology", "url": "https://www.destroyallsoftware.com/talks/ideology", "description": ""}], "notes": []}], "total_entries": 149}, {"name": "Search Engine Optimization", "subcategories": [{"name": "Search Engine Optimization", "entries": [{"name": "URL", "url": "#url", "description": ""}, {"name": "Accessibility", "url": "#accessibility", "description": ""}, {"name": "Meta Information", "url": "#meta-information", "description": ""}, {"name": "Keywords", "url": "#keywords", "description": ""}, {"name": "Content", "url": "#content", "description": ""}, {"name": "Images", "url": "#images", "description": ""}, {"name": "Videos", "url": "#videos", "description": ""}, {"name": "Links", "url": "#links", "description": ""}, {"name": "Mobile", "url": "#mobile", "description": ""}, {"name": "Sitemap", "url": "#sitemap", "description": ""}, {"name": "Social Media", "url": "#social-media", "description": ""}, {"name": "Tools & Services", "url": "#tools--services", "description": ""}, {"name": "Books", "url": "#books", "description": ""}, {"name": "Courses", "url": "#courses", "description": ""}, {"name": "File extension", "url": "https://www.youtube.com/watch?v=dSG6C33GwsE", "description": "Do not strip out the file extension on URLs."}, {"name": "HTTPS", "url": "https://webmasters.googleblog.com/2014/08/https-as-ranking-signal.html", "description": "Security is a top priority for Google."}, {"name": "Hyphens", "url": "https://www.youtube.com/watch?v=AQcSFsQyct8", "description": "Split words using hyphens."}, {"name": "Localisation", "url": "https://support.google.com/webmasters/answer/62399", "description": "Choose a country-specific domain, for better local search results."}, {"name": "Subdomain or subfolder", "url": "https://www.youtube.com/watch?v=_MswMYk05tk", "description": "Subdomains are seen as separate domains."}, {"name": "URL builder", "url": "https://support.google.com/analytics/answer/1033867", "description": "Use this tool to add custom campaign parameters to your URLs."}, {"name": "Custom Search", "url": "https://developers.google.com/structured-data/slsb-overview", "description": "With Google Sitelink search box, people can reach your content more quickly."}, {"name": "Pagination", "url": "https://support.google.com/webmasters/answer/1663744", "description": "Implement the `rel=\"next\"` and `rel=\"prev\"` attributes to links."}, {"name": "Performance", "url": "https://developers.google.com/webmasters/mobile-sites/mobile-seo/common-mistakes/slow-mobile-pages", "description": "Performance and loading time is important."}, {"name": "RichSnippets", "url": "https://schema.org/", "description": "Markup your code with rich snippets, they show up on the search results page."}, {"name": "Robots", "url": "https://en.wikipedia.org/wiki/Robots_exclusion_standard", "description": "Block pages which should not be indexed via the `robots.txt` file or"}, {"name": "WAI-Aria", "url": "https://www.w3.org/TR/wai-aria/", "description": "Use WAI-Aria tags to help machines understand your code."}, {"name": "Description", "url": "https://www.youtube.com/watch?v=W4gr88oHb-k", "description": "Each page should have a unique description (max. 160 characters)"}, {"name": "Meta Tag", "url": "https://www.youtube.com/watch?v=jK7IPbnmvVU", "description": "You can ommit the `<meta name=\"keywords\" content=\"\">`,"}, {"name": "URL", "url": "https://www.youtube.com/watch?v=rAWFv43qubI", "description": "Keyword should appear in URL name."}, {"name": "Uniqueness", "url": "https://www.youtube.com/watch?v=mQZY7EmjbMA", "description": "Do not provide duplicated content, use unique content types."}, {"name": "Alt tag", "url": "https://support.google.com/webmasters/answer/114016", "description": "Add an alt-tag this a description of the image (60 - 70 characters)."}, {"name": "File name", "url": "https://www.youtube.com/watch?v=h2SWuUobbr0", "description": "Use a short descriptive name."}, {"name": "Optimization", "url": "https://imageoptim.com/", "description": "Optimize images by removing some meta information."}, {"name": "Responsive Images", "url": "https://www.w3.org/TR/html-picture-element/", "description": "Serve the most optimized image corresponding to the window size."}, {"name": "Unplayable content", "url": "https://developers.google.com/webmasters/mobile-sites/mobile-seo/common-mistakes/unplayable-content", "description": "Avoid unplayable video content. Use HTML5 `<video>` tag instead of Flash."}, {"name": "Languages", "url": "https://moz.com/learn/seo/hreflang-tag", "description": "The hreflang tag tells Google which language you are using on a specific page, so the search engine can serve that result to users searching in that language"}, {"name": "nofollow", "url": "https://support.google.com/webmasters/answer/96569", "description": "Add `rel=\"nofollow\"` attribute to external links only to prevent spam and bad links."}, {"name": "AppLinks", "url": "http://applinks.org/documentation/", "description": "Apps that link to your content can then use this metadata to deep-link into your app."}, {"name": "mobile friendly", "url": "https://googlewebmastercentral.blogspot.be/2014/11/helping-users-find-mobile-friendly-pages.html", "description": "Mobile optimized sites are marked in search results. Test for [mobile friendly site](https://www.google.com/webmasters/tools/mobile-friendly/)."}, {"name": "Smart App Banner", "url": "https://developer.apple.com/library/ios/documentation/AppleApplications/Reference/SafariWebContent/PromotingAppswithAppBanners/PromotingAppswithAppBanners.html", "description": "Safari has a Smart App Banner feature that provides a standardized method of promoting apps on the App Store from a website."}, {"name": "Tap targets", "url": "https://developers.google.com/speed/docs/insights/SizeTapTargetsAppropriately", "description": "Clickable links should not be too small."}, {"name": "HTML sitemap", "url": "https://www.youtube.com/watch?v=hi5DGOu1uA0", "description": "A HTML sitemap allows site visitors to easily navigate a website."}, {"name": "Image sitemap", "url": "https://support.google.com/webmasters/answer/178636", "description": "Increase that your images can be found in Image Search results."}, {"name": "Mobile sitemap", "url": "https://support.google.com/webmasters/answer/6082207", "description": "For feature phones, you can create a mobile sitemap."}, {"name": "Video sitemap", "url": "https://support.google.com/webmasters/answer/80471", "description": "Make sure, search engines know about all the video content on your site."}, {"name": "XML sitemap", "url": "https://support.google.com/webmasters/answer/183668", "description": "Help search engines to index your pages."}, {"name": "Facebook", "url": "https://developers.facebook.com/docs/sharing/best-practices", "description": "Sharing Best Practices for Websites & Mobile Apps."}, {"name": "OpenGraph", "url": "http://ogp.me/", "description": "The Open Graph protocol enables any web page to become a rich object in a social graph."}, {"name": "Social Profiles", "url": "https://developers.google.com/webmasters/structured-data/customize/social-profiles", "description": "Add social profiles to your Google search results."}, {"name": "Twitter", "url": "https://dev.twitter.com/cards/getting-started", "description": "With Twitter cards, you can attach photos, videos and media experience to you Tweets."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Webmasters", "entries": [{"name": "Bing Webmasters", "url": "http://www.bing.com/toolbox/webmaster", "description": "Allows webmasters to add their websites to the Bing index crawler."}, {"name": "Google Search Console (GWT)", "url": "https://www.google.com/webmasters/", "description": "Allows webmasters to check indexing status and optimize visibility of their websites."}, {"name": "Google Tag Manager", "url": "https://www.google.com/analytics/tag-manager/", "description": "Learn about Google Analytics Tag Manager and how it can help simplify your life and need for IT requests. Launch new tags with a few clicks."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Analytics", "entries": [{"name": "Ahrefs", "url": "https://ahrefs.com/", "description": "Analyze websites, track social media, build backlinks - Ahrefs has you covered. Try our marketing and SEO tools Site Explorer and Content Explorer today!"}, {"name": "BuzzSumo", "url": "https://app.buzzsumo.com/research/most-shared", "description": "Find the most shared content for any topic or domain."}, {"name": "Followerwonk", "url": "https://moz.com/followerwonk", "description": "Tools for Twitter Analytics, Bio Search and More."}, {"name": "Google Analytics", "url": "https://www.google.com/analytics/", "description": "Generate detailed statistics about a website's traffic."}, {"name": "Open Site Explorer", "url": "https://moz.com/researchtools/ose/", "description": "Use Open Site Explorer to identify link building opportunities. Research backlinks, identify top pages, view social activity, and analyze anchor text."}, {"name": "Matomo", "url": "https://matomo.org/", "description": "An open analytics platform."}, {"name": "SEMrush", "url": "https://www.semrush.com/", "description": "SEMrush is a powerful and versatile competitive intelligence suite for online marketing, from SEO and PPC to social media and video advertising research."}, {"name": "Seomator", "url": "https://seomator.com/", "description": "SEO Audit Tool and website crawler for SEO performance improving with How-to-Fix tips."}, {"name": "SEOstats", "url": "https://github.com/eyecatchup/SEOstats", "description": "SEOstats is a powerful open source PHP library to request a bunch of SEO relevant metrics.", "stars": "1.5k"}, {"name": "SimilarWeb", "url": "https://www.similarweb.com/", "description": "Compare website traffic with SimilarWeb.com's advanced traffic estimator tool. See any website's traffic sources & uncover their online marketing strategies."}, {"name": "SpyFu", "url": "https://www.spyfu.com/", "description": "Unlimited searches of any competitor's keywords for SEO or Google Ads. Research keywords, and find any domain's strongest content and their most dominant ad copy."}, {"name": "Twitter Analytics", "url": "https://analytics.twitter.com/", "description": "Measure and boost your impact on Twitter."}, {"name": "Plausible", "url": "https://plausible.io/", "description": "Simple and privacy-friendly alternative to Google Analytics."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Optimization", "entries": [{"name": "Web.dev", "url": "https://web.dev/", "description": "Get the web's modern capabilities on your own sites and apps with useful guidance and analysis from Web.dev. Whether you already have a website or you're just getting started, learn to build for the modern web at Web.dev."}, {"name": "PageSpeed Insights", "url": "https://developers.google.com/speed/pagespeed/insights/", "description": "Page Speed Insights measures the performance of a page for mobile devices and desktop devices."}, {"name": "Varvy Seo tool", "url": "https://varvy.com/", "description": "Displays: domain strength, links, image seo, social counts & mentions, page/technical seo, pagespeed and more."}, {"name": "Webpagetest.org", "url": "https://www.webpagetest.org/", "description": "Web Page Test gives you an overall performance waterfall as well as rendering timeline for sites. It also provides critical insight into time to first byte and what could be holding back web page performance."}, {"name": "WooRank", "url": "https://www.woorank.com/", "description": "WooRank will help you to address issues on your site & identify opportunities to push you ahead of the competition."}, {"name": "Awesometechstack.com", "url": "https://awesometechstack.com/", "description": "AwesomeTechStack provides insights into the security, modernity, and performance of any website's technology stack and guidance to improve web vitals and the technology stack."}, {"name": "OptimalUX", "url": "https://optimalux.com/seo-patching", "description": "Optimize your site with seamless SEO patching and an A/B testing tool built on top of Cloudflare for easy integration."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Keywords", "entries": [{"name": "Google Trends", "url": "https://www.google.com/trends/", "description": "Explore Google trending search topics with Google Trends."}, {"name": "Keyword Planner", "url": "https://adwords.google.com/KeywordPlanner", "description": "Plan your Search Network campaigns and learn what your customers are looking for."}, {"name": "Keyword Tool", "url": "http://keywordtool.io/", "description": "Best FREE alternative to Google Keyword Tool for SEO & PPC keyword research! Get 750+ relevant long-tail keywords from Google Suggest in seconds!"}, {"name": "Moz Keyword Explorer", "url": "https://moz.com/explorer", "description": "Paid Keyword Tool that provides precise search volume, keyword difficulty, SERP Features and organic click through rate data."}, {"name": "Keyword Clarity", "url": "https://keywordclarity.io", "description": "Free keyword analytics tool that allows you to visualize and group keyword metrics with tree diagrams. The tool works with data from the Google Search Console API and CSVs."}, {"name": "SEOwl", "url": "https://www.seowl.co", "description": "Track your keyword rankings overtime and monitor your backlinks"}], "notes": []}, {"name": "Search Engine Optimization \u2014 Links", "entries": [{"name": "OpenLinkProfiler", "url": "http://www.openlinkprofiler.org/", "description": "Get an in-depth analysis of the freshest live backlinks."}, {"name": "Search Engine Spider Simulator", "url": "http://tools.seochat.com/tools/search-spider-simulator", "description": "This tool simulates a search engine by displaying the contents of a web page in exactly the way the search engine bot would see it when it crawls the page: See most prominent or inaccessible page elements."}, {"name": "Screaming Frog SEO Spider Tool & Crawler Software", "url": "https://www.screamingfrog.co.uk/seo-spider/", "description": "The Screaming Frog SEO Spider is a small desktop program (PC or Mac) which crawls websites links, images, CSS, script and apps from an SEO perspective."}, {"name": "Linkbuilding Spider", "url": "https://github.com/fulldecent/linkbuilding-spider", "description": "A PHP project to check if websites are linking to your website.", "stars": "8"}, {"name": "linkok.com", "url": "https://linkok.com", "description": "An online broken link checker app."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Structured Data", "entries": [{"name": "Facebook Debugger", "url": "https://developers.facebook.com/tools/debug", "description": "Enter the URL you want to scrape to see how the page's markup appears to Facebook."}, {"name": "Pinterest", "url": "https://developers.pinterest.com/rich_pins/validator/", "description": "Validate your Rich Pins and apply to get them on Pinterest."}, {"name": "Structured Data Testing Tool", "url": "https://developers.google.com/structured-data/testing-tool/", "description": "Paste in your rich snippets or url to test it."}, {"name": "Twitter card validator", "url": "https://cards-dev.twitter.com/validator", "description": "Enter the URL of the page with the meta tags to validate."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Bookmarklets", "entries": [{"name": "OuiSEO", "url": "https://github.com/carlsednaoui/seo-bookmarklet", "description": "An open-source bookmarklet that shows you on-page SEO and social meta data information.", "stars": "51"}, {"name": "SEO Bookmarklet", "url": "https://twkm.ca/projects/seo-bookmarklet", "description": "A One-Stop SEO Bookmarklet to Quickly Review On-Site SEO."}], "notes": []}, {"name": "Search Engine Optimization \u2014 Browser Extensions", "entries": [{"name": "MozBar", "url": "https://moz.com/tools/seo-toolbar", "description": "The SEO Toolbar from Moz gives you quick access to many on-page SEO factors, Domain & Page Authority plus a quick nofollow toggle. Download the Free Toolbar today!"}], "notes": []}, {"name": "Search Engine Optimization \u2014 Jekyll Plugins", "entries": [{"name": "Jekyll SEO Tag", "url": "https://github.com/jekyll/jekyll-seo-tag", "description": "A Jekyll plugin to add metadata tags for search engines and social networks to better index and display your site's content.", "stars": "1.7k"}], "notes": []}, {"name": "Search Engine Optimization \u2014 TYPO3 Extensions", "entries": [{"name": "Basic SEO Features", "url": "https://typo3.org/extensions/repository/view/seo_basics", "description": "Adds a separate field for the title-tag per page, easy and SEO-friendly keywords and description editing in a new module as well as a flexible Google Sitemap."}, {"name": "Google sitemap", "url": "https://typo3.org/extensions/repository/view/dd_googlesitemap", "description": "High performance Google sitemap implementation that avoids typical errors by other similar extensions."}], "notes": []}, {"name": "Search Engine Optimization \u2014 WordPress Plugins", "entries": [{"name": "All in One SEO Pack", "url": "https://wordpress.org/plugins/all-in-one-seo-pack/", "description": "The most downloaded plugin for WordPress (almost 30 million downloads). Use All in One SEO Pack to automatically optimize your site for Search Engines."}, {"name": "Yoast SEO", "url": "https://wordpress.org/plugins/wordpress-seo/", "description": "Improve your WordPress SEO: Write better content and have a fully optimized WordPress site using Yoast SEO plugin."}, {"name": "Slim SEO", "url": "https://wordpress.org/plugins/slim-seo/", "description": "Automated SEO tasks for you with a lightweight WordPress SEO plugin."}, {"name": "Search engine optimization 2016: Learn SEO with smart internet marketing strategies", "url": "https://www.amazon.com/Search-Optimization-Internet-Marketing-Strategies/dp/151534567X", "description": "Learn SEO strategies to rank at the top of Google with SEO 2016."}, {"name": "Search Engine Optimization All-in-One For Dummies", "url": "https://www.amazon.com/Search-Engine-Optimization-All-Dummies/dp/1118921755", "description": "Bruce Clay is one of the most respected figures in the SEO community, teaching classes and workshops at all the major conferences. Like the \u2018Art of SEO,\u2019 this book is actually pretty technical and probably not your best easy, first guide, despite being part of the \u2018Dummies\u2019 series."}, {"name": "SEO 2016: Learn Search Engine Optimization", "url": "https://www.amazon.com/SEO-2016-Search-Engine-Optimization/dp/1512275069", "description": "A Comprehensive Must-Have Guide to SEO in Today's Competitive Search Environment."}, {"name": "SEO Fitness Workbook", "url": "https://www.amazon.com/SEO-Fitness-Workbook-2016-Optimization/dp/1518748880", "description": "Step-by-step book on SEO, starting with goals, going through on page SEO such as page tags, and ending up with off page SEO such as link-building and social mentions."}, {"name": "SEO For Dummies, 6th Edition", "url": "http://shop.oreilly.com/product/9781119129554.do", "description": "Your fully updated guide to search engine optimization."}, {"name": "SEO Step-by-Step - The Complete Beginner's Guide to Getting Traffic from Google", "url": "https://www.amazon.com/SEO-Step-Step-Complete-Beginners/dp/1497415020", "description": "Also starts with keywords and covers ON PAGE and OFF PAGE SEO. Emphasizes the importance of speed, and has a nice appendix with SEO resources, glossary, and links."}, {"name": "SEO Warrior", "url": "http://shop.oreilly.com/product/9780596157081.do", "description": "Essential Techniques for Increasing Web Visibility."}, {"name": "SEO: Marketing Strategies to Dominate the First Page", "url": "https://www.amazon.com/SEO-Marketing-Strategies-analytics-optimization-ebook/dp/B01ACB7LQM", "description": "Introduction to Google Analytics, Webmaster, Website traffic, Adwords, Pay per click, Website promotion and Search engine optimization."}, {"name": "The Art of SEO, 3rd Edition", "url": "http://shop.oreilly.com/product/0636920032908.do", "description": "Mastering search engine optimization."}, {"name": "The Beginner's Guide to SEO", "url": "https://moz.com/beginners-guide-to-seo", "description": "New to SEO? Need to polish up your knowledge? The Beginner's Guide to SEO has been read over 3 million times and provides the information you need to get on the road to professional quality SEO."}, {"name": "The SEO Battlefield", "url": "http://shop.oreilly.com/product/0636920050964.do", "description": "If you want to establish an ongoing SEO program with the goal of increased traffic and search prominence, this practical step-by-step guide will help you understand SEO methodology and then show you how to put those theories into practice."}, {"name": "Analyzing Your Website to Improve SEO", "url": "https://www.lynda.com/Marketing-Small-Business-Marketing-tutorials/Analyzing-Your-Website-Improve-SEO/82409-2.html", "description": "Walks step-by-step through the process of reviewing the content and markup of a web site to improve its ranking in search engine results. With Peter Kent by Lynda.com."}, {"name": "ClickMinded", "url": "https://www.clickminded.com/", "description": "ClickMinded is an SEO training course for startups that want to grow their organic traffic and sales as quickly as possible."}, {"name": "Ecommerce SEO 101 Video Series", "url": "https://www.shopify.com/videos/ecommerce-seo-101", "description": "Ecommerce SEO 101 Video Series with Helen Overland by shopify."}, {"name": "Improving SEO Using Accessibility Techniques", "url": "https://www.lynda.com/HTML-5-tutorials/Improving-SEO-Using-Accessibility-Techniques/89051-6.html", "description": "Make web sites more accessible and search engine friendly through proper markup and web standards compliance. With Morten Rand-Hendriksen by Lynda.com."}, {"name": "International SEO Fundamentals", "url": "https://www.lynda.com/Analytics-tutorials/International-SEO-Fundamentals/377449-6.html", "description": "Attract international visitors to your websites with these SEO tips. Learn how to determine target markets and optimize your website's technical aspects and content for countries and languages around the world. With David Booth by Lynda.com."}, {"name": "Learning Search Engine Optimization (SEO) - A Video Introduction", "url": "https://www.video2brain.com/en/courses/learning-search-engine-optimization-seo-a-video-introduction", "description": "Learning Search Engine Optimization (SEO) - A Video Introduction with Matt Bailey by video2brain."}, {"name": "Learning Web Analytics", "url": "https://www.video2brain.com/en/courses/learning-web-analytics", "description": "Learning Web Analytics with Matt Bailey by video2brain."}, {"name": "SEO for Beginners", "url": "http://seoforbeginners.com/", "description": "SEO for Beginners: A Video Guide Introduction."}, {"name": "SEO for Ecommerce", "url": "https://www.lynda.com/Google-Analytics-tutorials/SEO-Ecommerce/386884-2.html", "description": "SEO for ecommerce is different. Get strategies tailored for optimizing an online store to improve page rankings and build traffic. With Steven Harris by Lynda.com."}, {"name": "SEO for Local Visibility", "url": "https://www.lynda.com/Google-Maps-tutorials/SEO-Local-Visibility/178132-2.html", "description": "Achieve maximum visibility in search rankings with these local SEO strategies. With Brad Batesole by Lynda.com."}, {"name": "SEO for Web Designers", "url": "https://webdesign.tutsplus.com/courses/seo-for-web-designers", "description": "SEO for Web Designers with Craig Campbell by TutsPlus."}, {"name": "SEO Fundamentals", "url": "https://www.lynda.com/Analytics-tutorials/SEO-Fundamentals/187858-2.html", "description": "SEO Fundamentals with David Booth by Lynda.com."}, {"name": "SEO Fundamentals", "url": "https://www.pluralsight.com/courses/seo-fundamentals", "description": "SEO Fundamentals with Paul Wilson by Pluralsight."}, {"name": "SEO Tools Fundamentals", "url": "https://www.lynda.com/Buzzstream-tutorials/SEO-Tools-Fundamentals/368917-2.html", "description": "Learn about today's top SEO tools for technical optimization, content optimization, offsite optimization, and competitive research. With Brad Batesole by Lynda.com."}, {"name": "SEO Training Course by Moz", "url": "https://www.udemy.com/whiteboard-seo/", "description": "SEO Training Course with Moz by udemy."}, {"name": "SEO: Keyword Strategy in Depth", "url": "https://www.lynda.com/Business-Online-Marketing-tutorials/SEO-Keyword-Strategy-Depth/147030-6.html", "description": "Learn how to research keywords, apply them to your website, and create ad campaigns around keywords. Increase your site traffic and better understand your user's intent with keywords. With Matt Bailey by Lynda.com."}, {"name": "SEO: Link Building in Depth", "url": "https://www.lynda.com/Business-Online-Marketing-tutorials/SEO-Link-Building-Depth/95253-6.html", "description": "Investigates the anatomy of a link, how links affect page ranking, and the properties that make an excellent inbound link. With Peter Kent by Lynda.com."}, {"name": "Spying with SEO Tools", "url": "https://www.lynda.com/Marketing-PPC-tutorials/Spying-SEO-Tools/371730-6.html", "description": "Learn how to use SEO tools and techniques to research the competition online. Find out what keywords your competitors are optimizing for\u2014and then outrank them on search engine results pages. With Anson Alexander by Lynda.com."}, {"name": "WordPress Plugins: SEO", "url": "https://www.lynda.com/WordPress-tutorials/WordPress-Plugins-SEO/140779-2.html", "description": "Drive more visitors to your WordPress site by performing search engine optimization, or SEO, with the help of two powerful plugins. With Morten Rand-Hendriksen by Lynda.com."}], "notes": []}], "total_entries": 127}, {"name": "Math", "subcategories": [{"name": "Math", "entries": [{"name": "Contents", "url": "#contents", "description": ""}, {"name": "General Resources", "url": "#general-resources", "description": ""}, {"name": "Branches of Mathematics", "url": "#branches-of-mathematics", "description": ""}, {"name": "Students Lecture Notes", "url": "#students-lecture-notes", "description": ""}, {"name": "Related Awesome Lists", "url": "#related-awesome-lists", "description": ""}, {"name": "License", "url": "#license", "description": ""}, {"name": "Khan Academy", "url": "https://www.khanacademy.org/math", "description": ""}, {"name": "Coursera", "url": "https://www.coursera.org/courses?query=mathematics\\&languages=en", "description": ""}, {"name": "MIT OpenCourseWare", "url": "http://ocw.mit.edu/courses/mathematics/", "description": ""}, {"name": "edX", "url": "https://www.edx.org/course/subject/math", "description": ""}, {"name": "Brilliant", "url": "https://brilliant.org/courses/#math-foundational", "description": ""}, {"name": "WooTube", "url": "https://misterwootube.com/", "description": ""}, {"name": "Mathigon", "url": "https://mathigon.org/", "description": ""}, {"name": "Calculus.org", "url": "http://calculus.org/", "description": ""}, {"name": "Ximera", "url": "https://ximera.osu.edu/", "description": ""}, {"name": "Almost Fun", "url": "https://www.almostfun.org/lessons/", "description": ""}, {"name": "Oxford Mathematics", "url": "https://www.youtube.com/c/OxfordMathematics", "description": ""}, {"name": "Math Academy", "url": "https://mathacademy.com/", "description": ""}, {"name": "Derivative Calculus Solver", "url": "https://www.derivativecalculus.com", "description": "A step-by-step differentiation tool focusing on the chain rule and substitution logic."}, {"name": "Understanding Mathematics", "url": "https://github.com/nelson-brochado/understanding-math", "description": "", "stars": "1.2k"}, {"name": "Brandon Foltz", "url": "https://www.youtube.com/@BrandonFoltz", "description": ""}, {"name": "StatQuest", "url": "https://www.youtube.com/channel/UCtYLUTtgS3k1Fg4y5tAhLbw", "description": ""}, {"name": "3Blue1Brown", "url": "https://www.youtube.com/@3blue1brown", "description": ""}, {"name": "NPTEL", "url": "https://www.youtube.com/@iit", "description": ""}, {"name": "Numberphile", "url": "https://www.youtube.com/@numberphile", "description": ""}, {"name": "PatrickJMT", "url": "https://www.youtube.com/@patrickjmt", "description": ""}, {"name": "Professor Leonard", "url": "https://www.youtube.com/@ProfessorLeonard", "description": ""}, {"name": "Crash Course", "url": "https://www.youtube.com/@crashcourse", "description": ""}, {"name": "Harvard", "url": "https://www.youtube.com/@harvard", "description": ""}, {"name": "MIT OpenCourseWare", "url": "https://www.youtube.com/@mitocw", "description": ""}, {"name": "Mathologer", "url": "https://www.youtube.com/@Mathologer", "description": ""}, {"name": "The Math District", "url": "https://www.youtube.com/@TheMathDistrict", "description": ""}, {"name": "Mathematical Monk", "url": "https://www.youtube.com/@mathematicalmonk", "description": ""}, {"name": "The Math Sorcerer", "url": "https://www.youtube.com/@TheMathSorcerer", "description": ""}, {"name": "Symbolab", "url": "https://www.symbolab.com/", "description": ""}, {"name": "Desmos", "url": "https://www.desmos.com/calculator", "description": ""}, {"name": "Math Words", "url": "http://www.mathwords.com/", "description": ""}, {"name": "Wolfram Alpha", "url": "http://www.wolframalpha.com/", "description": ""}, {"name": "Maxima", "url": "https://maxima.sourceforge.io/", "description": ""}, {"name": "Sympy", "url": "https://www.sympy.org/", "description": ""}, {"name": "Sagemath", "url": "http://www.sagemath.org/", "description": ""}, {"name": "MathFlow", "url": "https://github.com/Nonanti/MathFlow", "description": "C# math expression library with symbolic computation (differentiation, simplification, equation solving)", "stars": "51"}, {"name": "Unit Converter", "url": "https://unitconverters.net", "description": ""}, {"name": "GeoGebra", "url": "https://www.geogebra.org/?lang=en", "description": ""}, {"name": "Macaulay2", "url": "http://www2.macaulay2.com/Macaulay2/", "description": ""}, {"name": "Singular", "url": "https://www.singular.uni-kl.de/", "description": ""}, {"name": "GNU Octave", "url": "https://www.gnu.org/software/octave/", "description": ""}, {"name": "Magma", "url": "http://magma.maths.usyd.edu.au/magma/", "description": ""}, {"name": "Maple", "url": "https://www.maplesoft.com/products/Maple/", "description": ""}, {"name": "Matlab", "url": "https://www.mathworks.com/products/matlab.html", "description": ""}, {"name": "Wolfram Mathematica", "url": "https://www.wolfram.com/mathematica/", "description": ""}, {"name": "Free Math", "url": "https://freemathapp.org", "description": ""}, {"name": "xhub", "url": "https://chrome.google.com/webstore/detail/xhub/anidddebgkllnnnnjfkmjcaallemhjee", "description": ""}, {"name": "CopyPasteMathjax", "url": "https://www.copypastemathjax.com/", "description": ""}, {"name": "Finance calculators", "url": "https://www.financecharts.com/pages/5724-retirement-calculators-and-stock-market-tips", "description": ""}, {"name": "Mathcheap", "url": "https://mathcheap.xyz", "description": ""}, {"name": "Midpoint Calculator", "url": "https://midpointcalculator.co", "description": ""}, {"name": "Quartiles Calculator", "url": "https://quartilecalculator.net", "description": ""}, {"name": "Corca Editor", "url": "https://corca.io/", "description": ""}, {"name": "RunMat", "url": "https://github.com/runmat-org/runmat", "description": "Runtime for MATLAB-syntax array math with automatic CPU/GPU execution.", "stars": "193"}, {"name": "Structural Engineering Tools (SEPCO Engineering)", "url": "https://github.com/sepcostructural/structural-engineering-tools", "description": "Free online calculators for beam diagrams, Canadian steel section properties, and pressure conversions.", "stars": "0"}, {"name": "Mathematics Stack Exchange", "url": "http://math.stackexchange.com/", "description": ""}, {"name": "MathOverflow", "url": "http://mathoverflow.net/", "description": "for professional mathematicians"}, {"name": "Encyclopedia of Mathematics", "url": "https://www.encyclopediaofmath.org", "description": ""}, {"name": "Planetmath", "url": "http://planetmath.org/", "description": ""}, {"name": "ProofWiki", "url": "https://proofwiki.org/wiki/Main_Page", "description": ""}, {"name": "Wolfram Mathworld", "url": "http://mathworld.wolfram.com/", "description": ""}, {"name": "The On-Line Encyclopedia of Integer Sequences", "url": "https://oeis.org", "description": "Great compendium of many different integer sequences. Founded 1964 by N. J. A. Sloane."}, {"name": "Calculus: Basic Concepts for High Schools", "url": "https://archive.org/details/TarasovCalculus", "description": "L.V. Tarasov"}, {"name": "Basics of Algebra, Topology, and Differential Calculus", "url": "http://www.cis.upenn.edu/~jean/math-basics.pdf", "description": "Jean Gallier (University of Pennsylvania)"}, {"name": "Multivariable Calculus", "url": "http://people.math.gatech.edu/%7Ecain/notes/calculus.html", "description": "G. Cain, J. Herod (Georgia Tech)"}, {"name": "Wikibooks", "url": "https://en.wikibooks.org/wiki/Wikibooks:Mathematics_bookshelf", "description": ""}, {"name": "Online Mathematics Textbooks", "url": "https://people.math.gatech.edu/~cain/textbooks/onlinebooks.html", "description": ""}, {"name": "Beginning and Intermediate Algebra", "url": "http://www.wallace.ccfaculty.org/book/Beginning_and_Intermediate_Algebra.pdf", "description": ""}, {"name": "Free Mathematics Books", "url": "https://github.com/EbookFoundation/free-programming-books/blob/master/books/free-programming-books-subjects.md#mathematics", "description": "", "stars": "384k"}, {"name": "Trigonometry", "url": "http://www.mecmath.net/trig/trigbook.pdf", "description": ""}, {"name": "Math for Frontend Web Dev", "url": "https://www.manning.com/books/math-for-frontend-web-dev", "description": ""}, {"name": "Grokking Statistics", "url": "https://www.manning.com/books/grokking-statistics", "description": ""}, {"name": "The Math Behind Artificial Intelligence", "url": "https://www.freecodecamp.org/news/the-math-behind-artificial-intelligence-book", "description": "Tiago Capelo Monteiro (freeCodeCamp)"}, {"name": "Quanta Magazine", "url": "https://www.quantamagazine.org/mathematics/", "description": "Features latest research breakthroughs in an accessible style for non-experts."}, {"name": "Bulletin of the American Mathematical Society", "url": "https://www.ams.org/journals/bull/all_issues.html", "description": "Expository articles on contemporary mathematical research, written in a way that gives insight to mathematicians who may not be experts in the particular topic."}, {"name": "Notices of the American Mathematical Society", "url": "http://www.ams.org/cgi-bin/notices/amsnotices.pl?article_id=fullissue\\&article_type=gallery\\&gallery_type=fullissue", "description": "Publicizes activities of the Society and features surveys, reports, news, announcements, and opinions on industry trends, academia, and research."}, {"name": "European Mathematical Society Magazine", "url": "https://euromathsoc.org/magazine", "description": "The Magazine features announcements about meetings and conferences, articles outlining current trends in scientific development, reports on member societies, and many other informational items."}, {"name": "Mathematics Today by Institute of Mathematics and its Applications", "url": "https://ima.org.uk/publications/mathematics-today/", "description": "News, opinions, and articles related to mathematics, so the reader stays updated."}, {"name": "Crux Mathematicorum by Canadian Mathematical Society", "url": "https://cms.math.ca/publications/crux/", "description": "source of unique and challenging mathematical problems designed for the secondary and undergraduate levels. It includes an Olympiad Corner which is helpful for math competitions."}, {"name": "BetterExplained", "url": "https://betterexplained.com/", "description": "Maintained by Kalid Azad"}, {"name": "ILoveMaths", "url": "http://ilovemaths.com/", "description": "For grades 6 thru 12 in K-12 system"}, {"name": "3blue1brown", "url": "https://www.3blue1brown.com/", "description": "Animated Maths"}, {"name": "Mathsisfun", "url": "https://www.mathsisfun.com", "description": ""}, {"name": "MathematicsIsAScience", "url": "https://calculus123.com/wiki/Peter_Saveliev", "description": "Peter Saveliev (Professor of mathematics at Marshall University, Huntington WV, USA)"}, {"name": "MathsJam", "url": "https://mathsjam.com/", "description": "monthly local recreational maths/puzzle meetups and an annual gathering in Staffordshire, England"}, {"name": "Talking Maths in Public", "url": "https://talkingmathsinpublic.uk/", "description": "a conference for maths communicators, running every two years, usually in the UK"}, {"name": "Bridges", "url": "https://www.bridgesmathart.org/", "description": "an annual conference on mathematical connections in art, music, architecture, and culture. The 2025 meeting is in Eindhoven, Netherlands."}, {"name": "Areas of mathematics on Wikipedia", "url": "https://en.wikipedia.org/wiki/Areas_of_mathematics", "description": ""}, {"name": "Paul's Online Math Notes", "url": "http://tutorial.math.lamar.edu/", "description": "Paul Dawkins (Lamar University)"}, {"name": "List of electronic textbooks", "url": "http://faculty.atu.edu/mfinan/nnotes.html", "description": "Marcel B. Finan (Arkansas Tech University)"}, {"name": "Topology Atlas", "url": "http://at.yorku.ca/topology/", "description": ""}, {"name": "Recreations in Math", "url": "http://djm.cc/library/Recreations_in_Mathematics_Licks_edited.pdf", "description": "H. E. Licks (1917)"}, {"name": "Magic Squares and Cubes", "url": "http://djm.cc/library/Magic_Squares_Cubes_Andrews_edited.pdf", "description": "W. S. Andrews (1917)"}, {"name": "Convex Optimization", "url": "https://web.stanford.edu/~boyd/cvxbook/", "description": "Stephen Boyd and Lieven Vandenberghe"}, {"name": "Fabrice Baudoin's Notes", "url": "https://fabricebaudoin.wordpress.com/", "description": "Both research and lecture notes on many topics, Including Diffusions on foliated manifold, Stochastic Calculus, Global analysis in Dirichlet spaces, and more."}], "notes": []}, {"name": "Math \u2014 Transition To Pure Rigour Math", "entries": [], "notes": []}, {"name": "Math \u2014 Set Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Logic", "entries": [], "notes": []}, {"name": "Math \u2014 Category Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Type Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Homotopy Type Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Surreal Numbers", "entries": [], "notes": []}, {"name": "Math \u2014 Algebraic Number Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Analytic Number Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Abstract Algebra", "entries": [], "notes": []}, {"name": "Math \u2014 Group Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Linear Algebra", "entries": [], "notes": []}, {"name": "Math \u2014 Ring Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Galois Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Lie Algebras", "entries": [], "notes": []}, {"name": "Math \u2014 Graph Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Differential Geometry", "entries": [], "notes": []}, {"name": "Math \u2014 Algebraic Geometry", "entries": [], "notes": []}, {"name": "Math \u2014 Algebraic Statistics", "entries": [], "notes": []}, {"name": "Math \u2014 Topology", "entries": [], "notes": []}, {"name": "Math \u2014 Algebraic Topology", "entries": [], "notes": []}, {"name": "Math \u2014 Real Analysis", "entries": [], "notes": []}, {"name": "Math \u2014 Harmonic Analysis", "entries": [], "notes": []}, {"name": "Math \u2014 Complex Analysis", "entries": [], "notes": []}, {"name": "Math \u2014 Functional Analysis", "entries": [], "notes": []}, {"name": "Math \u2014 Measure Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Ordinary Differential Equations", "entries": [], "notes": []}, {"name": "Math \u2014 Partial Differential Equations", "entries": [], "notes": []}, {"name": "Math \u2014 Chaos Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Probability Theory", "entries": [], "notes": []}, {"name": "Math \u2014 Statistics", "entries": [], "notes": []}, {"name": "Math \u2014 Statistical Learning", "entries": [], "notes": []}, {"name": "Math \u2014 Stochastic processes", "entries": [{"name": "Evan Chen", "url": "https://web.evanchen.cc/coursework.html", "description": "MIT. 2012 \\~ 2018. Covers Combinatorics, Number Theory, Honors Algebra, Set Theory, Real Analysis, Graph Theory, and more."}, {"name": "Dexter Chua", "url": "https://dec41.user.srcf.net/notes/", "description": "Harvard. 2013 \\~ 2018. Covers Analysis, Probability, Linear Algebra, Complex Analysis, Numerical Analysis, Statistics, Optimization, Algebraic Topology, Quantum Field Theory, and more."}, {"name": "Theoretical Computer Science", "url": "https://github.com/mostafatouny/awesome-theoretical-computer-science", "description": "", "stars": "1.1k"}], "notes": []}], "total_entries": 104}, {"name": "Audit Algorithms", "subcategories": [{"name": "Audit Algorithms", "entries": [{"name": "Papers", "url": "#papers", "description": ""}, {"name": "Related Events (conferences/workshops)", "url": "#related-events", "description": ""}], "notes": []}, {"name": "Audit Algorithms \u2014 2026", "entries": [{"name": "Exposing the Illusion of Fairness: Auditing Vulnerabilities to Distributional Manipulation Attacks", "url": "https://arxiv.org/pdf/2507.20708", "description": "(arXiv)"}], "notes": []}, {"name": "Audit Algorithms \u2014 2025", "entries": [{"name": "Auditing Pay-Per-Token in Large Language Models", "url": "https://arxiv.org/pdf/2510.05181", "description": "(arXiv) *Develops an auditing framework based on martingale theory that enables a trusted third-party auditor who sequentially queries a provider to"}, {"name": "P2NIA: Privacy-Preserving Non-Iterative Auditing", "url": "https://arxiv.org/abs/2504.00874", "description": "(ECAI) *Proposes a mutually beneficial collaboration for both the auditor and the platform: a privacy-preserving and non-iterative audit scheme that enhances fairness assessments using synthetic or local data, avoiding the challenges associated with traditional API-based audits.*"}, {"name": "The Fair Game: Auditing & debiasing AI algorithms overtime", "url": "https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9E8408C67F7CE30505122DD1586D9FA2/S3033373325000080a.pdf/the-fair-game-auditing-and-debiasing-ai-algorithms-over-time.pdf", "description": "(Cambridge Forum on AI: Law and Governance) *Aims to simulate the evolution of ethical and legal frameworks in the society by creating an auditor which sends feedback to a debiasing algorithm deployed around an ML system.*"}, {"name": "Robust ML Auditing using Prior Knowledge", "url": "https://arxiv.org/pdf/2505.04796", "description": "(ICML) *Formally establishes the conditions under which an auditor can prevent audit manipulations using prior knowledge about the ground truth.*"}, {"name": "CALM: Curiosity-Driven Auditing for Large Language Models", "url": "https://arxiv.org/abs/2501.02997", "description": "(AAAI) *Auditing as a black-box optimization problem where the goal is to automatically uncover input-output pairs of the target LLMs that exhibit illegal, immoral, or unsafe behaviors.*"}, {"name": "Queries, Representation & Detection: The Next 100 Model Fingerprinting Schemes", "url": "https://arxiv.org/abs/2412.13021", "description": "(AAAI) *Divides model fingerprinting into three core components, to identify \u223c100 previously unexplored combinations of these and gain insights into their performance.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2024", "entries": [{"name": "Hardware and software platform inference", "url": "https://arxiv.org/pdf/2411.05197", "description": "(arXiv) *A method for identifying the underlying GPU architecture and software stack of a black-box machine learning model solely based on its input-output behavior.*"}, {"name": "Auditing Local Explanations is Hard", "url": "https://arxiv.org/abs/2407.13281", "description": "(NeurIPS) *Gives the (prohibitive) query complexity of auditing explanations.*"}, {"name": "LLMs hallucinate graphs too: a structural perspective", "url": "https://arxiv.org/abs/2409.00159", "description": "(complex networks) *Queries LLMs for known graphs and studies topological hallucinations. Proposes a structural hallucination rank.*"}, {"name": "Fairness Auditing with Multi-Agent Collaboration", "url": "https://arxiv.org/pdf/2402.08522", "description": "(ECAI) *Considers multiple"}, {"name": "FairProof: Confidential and Certifiable Fairness for Neural Networks", "url": "https://arxiv.org/pdf/2402.12572v1.pdf", "description": "(Arxiv) *Proposes an alternative paradigm to traditional auditing using crytographic tools like Zero-Knowledge Proofs; gives a system called FairProof for verifying fairness of small neural networks.*"}, {"name": "Under manipulations, are some AI models harder to audit?", "url": "https://grodino.github.io/projects/manipulated-audits/preprint.pdf", "description": "(SATML) *Relates the difficulty of black-box audits"}, {"name": "Improved Membership Inference Attacks Against Language Classification Models", "url": "https://arxiv.org/pdf/2310.07219.pdf", "description": "(ICLR) *Presents a framework for running membership inference attacks against classifier, in audit mode.*"}, {"name": "Auditing Fairness by Betting", "url": "https://arxiv.org/pdf/2305.17570.pdf", "description": "(Neurips) [\\[Code\\] (\u2b506)](https://github.com/bchugg/auditing-fairness) *Sequential methods that allows for the continuous monitoring of incoming data from a black-box classifier or regressor.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2023", "entries": [{"name": "Privacy Auditing with One (1) Training Run", "url": "https://neurips.cc/virtual/2023/poster/70925", "description": "(NeurIPS - best paper) *A scheme for auditing differentially private machine learning systems with a single training run.*"}, {"name": "Auditing fairness under unawareness through counterfactual reasoning", "url": "https://www.sciencedirect.com/science/article/pii/S0306457322003259", "description": "(Information Processing & Management) *Shows how to unveil whether a black-box model, complying with the regulations, is still biased or not.*"}, {"name": "XAudit : A Theoretical Look at Auditing with Explanations", "url": "https://arxiv.org/pdf/2206.04740.pdf", "description": "(Arxiv) *Formalizes the role of explanations in auditing and investigates if and how model explanations"}, {"name": "Keeping Up with the Language Models: Robustness-Bias Interplay in NLI Data and Models", "url": "https://arxiv.org/pdf/2305.12620.pdf", "description": "(Arxiv) *Proposes a way to extend the shelf-life of auditing datasets by using language models themselves; also finds problems with the current bias auditing metrics and proposes alternatives -- these alternatives highlight that model brittleness superficially increased the previous bias scores.*"}, {"name": "Online Fairness Auditing through Iterative Refinement", "url": "https://dl.acm.org/doi/pdf/10.1145/3580305.3599454", "description": "(KDD) *Provides an adaptive process that automates the inference of probabilistic guarantees associated with estimating fairness metrics.*"}, {"name": "Stealing the Decoding Algorithms of Language Models", "url": "https://people.cs.umass.edu/~amir/papers/CCS23-LM-stealing.pdf", "description": "(CCS) *Steal the type and hyperparameters of the decoding algorithms of a LLM.*"}, {"name": "Modeling rabbit\u2011holes on YouTube", "url": "https://link.springer.com/epdf/10.1007/s13278-023-01105-9?sharing_token=h-O-asHI49VUWS9FxN1Gsve4RwlQNchNByi7wbcMAY6I98PKW1PqhFQJ_JqQyk3TrB05qDb3LUzMDmKOgrupccQliViDle-rwKEi2MZ8xBViaAQhyN41oZBKLLeXchoeIW2kklVHC094I5KD8pxja4-if6-iB0uAI1FnqnYoxjU%3D", "description": "(SNAM) *Models the trapping dynamics of users in rabbit holes in YouTube, and provides a measure of this enclosure.*"}, {"name": "Auditing YouTube\u2019s Recommendation Algorithm for Misinformation Filter Bubbles", "url": "https://dl.acm.org/doi/full/10.1145/3568392", "description": "(Transactions on Recommender Systems) *What it takes to \u201cburst the bubble,\u201d i.e., revert the bubble enclosure from recommendations.*"}, {"name": "Auditing Yelp\u2019s Business Ranking and Review Recommendation Through the Lens of Fairness", "url": "https://arxiv.org/pdf/2308.02129.pdf", "description": "(Arxiv) *Audits the fairness of Yelp\u2019s business"}, {"name": "Confidential-PROFITT: Confidential PROof of FaIr Training of Trees", "url": "https://openreview.net/pdf?id=iIfDQVyuFD", "description": "(ICLR) *Proposes fair decision tree learning algorithms along with zero-knowledge proof protocols to obtain a proof of fairness on the audited server.*"}, {"name": "SCALE-UP: An Efficient Black-box Input-level Backdoor Detection via Analyzing Scaled Prediction Consistency", "url": "https://arxiv.org/pdf/2302.03251.pdf", "description": "(ICLR) *Considers backdoor detection under the black-box setting in machine learning as a service (MLaaS) applications.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2022", "entries": [{"name": "Two-Face: Adversarial Audit of Commercial Face Recognition Systems", "url": "https://ojs.aaai.org/index.php/ICWSM/article/view/19300/19072", "description": "(ICWSM) *Performs an adversarial audit on multiple systems APIs and datasets, making a number of concerning observations.*"}, {"name": "Scaling up search engine audits: Practical insights for algorithm auditing", "url": "https://journals.sagepub.com/doi/10.1177/01655515221093029", "description": "(Journal of Information Science) [(Code) (\u2b5032)](https://github.com/gesiscss/WebBot) *Audits multiple search engines using simulated browsing behavior with virtual agents.*"}, {"name": "A zest of lime: towards architecture-independent model distances", "url": "https://openreview.net/pdf?id=OUz_9TiTv9j", "description": "(ICLR) *Measures the distance between two remote models using LIME.*"}, {"name": "Active Fairness Auditing", "url": "https://proceedings.mlr.press/v162/yan22c/yan22c.pdf", "description": "(ICML) *Studies of query-based auditing algorithms that can estimate the demographic parity of ML models in a query-efficient manner.*"}, {"name": "Look at the Variance! Efficient Black-box Explanations with Sobol-based Sensitivity Analysis", "url": "https://proceedings.neurips.cc/paper/2021/file/da94cbeff56cfda50785df477941308b-Paper.pdf", "description": "(NeurIPS) *Sobol indices provide an efficient way to capture higher-order interactions between image regions and their contributions to a (black box) neural network\u2019s prediction through the lens of variance.*"}, {"name": "Your Echos are Heard: Tracking, Profiling, and Ad Targeting in the Amazon Smart Speaker Ecosystem", "url": "https://arxiv.org/pdf/2204.10920.pdf", "description": "(arxiv) *Infers a link between the Amazon Echo system and the ad targeting algorithm.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2021", "entries": [{"name": "When the Umpire is also a Player: Bias in Private Label Product Recommendations on E-commerce Marketplaces", "url": "https://arxiv.org/pdf/2102.00141.pdf", "description": "(FAccT) *Do Amazon private label products get an unfair share of recommendations and are therefore advantaged compared to 3rd party products?*"}, {"name": "Everyday Algorithm Auditing: Understanding the Power of Everyday Users in Surfacing Harmful Algorithmic Behaviors", "url": "https://arxiv.org/pdf/2105.02980.pdf", "description": "(CHI) *Makes the case for \"everyday algorithmic auditing\" by users.*"}, {"name": "Auditing Black-Box Prediction Models for Data Minimization Compliance", "url": "https://www.cs.bu.edu/faculty/crovella/paper-archive/minimization-audit-Neurips21.pdf", "description": "(NeurIPS) *Measures the level of data minimization satisfied by the prediction model using a limited number of queries.*"}, {"name": "Setting the Record Straighter on Shadow Banning", "url": "https://arxiv.org/abs/2012.05101", "description": "(INFOCOM)  [(Code)](https://gitlab.enseeiht.fr/bmorgan/infocom-2021) *Considers the possibility of shadow banning in Twitter (ie, the moderation black-box algorithm), and measures the probability of several hypothesis.*"}, {"name": "Extracting Training Data from Large Language Models", "url": "https://arxiv.org/pdf/2012.07805.pdf", "description": "(USENIX Security) *Extract verbatim text sequences from the GPT-2 model\u2019s training data.*"}, {"name": "FairLens: Auditing black-box clinical decision support systems", "url": "https://www.sciencedirect.com/science/article/pii/S030645732100145X?casa_token=oyjFKij269MAAAAA:w_ohScpMPNMnkDdzBqAIod5QfBgQlq5Ht9mMRSOydZpOgNG-i1yuqEmBjWN__38gOGmjNL7dVT0", "description": "(Information Processing & Management) *Presents a pipeline to detect and explain potential fairness issues in Clinical DSS, by comparing different multi-label classification disparity measures.*"}, {"name": "Auditing Algorithmic Bias on Twitter", "url": "https://dl.acm.org/doi/abs/10.1145/3447535.3462491", "description": "(WebSci)."}, {"name": "Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information", "url": "https://proceedings.mlr.press/v139/neiswanger21a.html", "description": "(ICML) *A budget constrained and Bayesian optimization procedure to extract properties out of a black-box algorithm.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2020", "entries": [{"name": "Black-Box Ripper: Copying black-box models using generative evolutionary algorithms", "url": "https://proceedings.neurips.cc/paper/2020/file/e8d66338fab3727e34a9179ed8804f64-Paper.pdf", "description": "(NeurIPS) *Replicates the functionality of a black-box neural model, yet with no limit on the amount of queries (via a teacher/student scheme and an evolutionary search).*"}, {"name": "Auditing radicalization pathways on", "url": "https://dl.acm.org/doi/pdf/10.1145/3351095.3372879", "description": "(FAT\\*) *Studies the reachability of radical channels from each others, using random walks on static channel recommendations.*"}, {"name": "Adversarial Model Extraction on Graph Neural Networks", "url": "https://arxiv.org/abs/1912.07721", "description": "(AAAI Workshop on Deep Learning on Graphs: Methodologies and Applications) *Introduces GNN model extraction and presents a preliminary approach for this.*"}, {"name": "Remote Explainability faces the bouncer problem", "url": "https://rdcu.be/b6qB4", "description": "(Nature Machine Intelligence volume 2, pages529\u2013539)  [(Code) (\u2b504)](https://github.com/erwanlemerrer/bouncer_problem) *Shows the impossibility (with one request) or the difficulty to spot lies on the explanations of a remote AI decision.*"}, {"name": "GeoDA: a geometric framework for black-box adversarial attacks", "url": "https://openaccess.thecvf.com/content_CVPR_2020/papers/Rahmati_GeoDA_A_Geometric_Framework_for_Black-Box_Adversarial_Attacks_CVPR_2020_paper.pdf", "description": "(CVPR)  [(Code) (\u2b5036)](https://github.com/thisisalirah/GeoDA) *Crafts adversarial examples to fool models, in a pure blackbox setup (no gradients, inferred class only).*"}, {"name": "The Imitation Game: Algorithm Selectionby Exploiting Black-Box Recommender", "url": "https://github.com/erwanlemerrer/erwanlemerrer.github.io/raw/master/files/imitation_blackbox_recommenders_netys-2020.pdf", "description": "(Netys)  [(Code) (\u2b501)](https://github.com/gdamaskinos/RecRank) *Parametrize a local recommendation algorithm by imitating the decision of a remote and better trained one.*", "stars": "2"}, {"name": "Auditing News Curation Systems:A Case Study Examining Algorithmic and Editorial Logic in Apple News", "url": "https://ojs.aaai.org/index.php/ICWSM/article/view/7277", "description": "(ICWSM) *Audit study of Apple News as a sociotechnical news curation system (trending stories section).*"}, {"name": "Auditing Algorithms:  On Lessons Learned and the Risks of DataMinimization", "url": "https://dl.acm.org/doi/pdf/10.1145/3375627.3375852", "description": "(AIES) *A practical audit for a well-being recommendation app developed by Telef\u00f3nica (mostly on bias).*"}, {"name": "Extracting Training Data from Large Language Models", "url": "https://arxiv.org/pdf/2012.07805", "description": "(arxiv) *Performs a training data extraction attack to recover individual training examples by querying the language model.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2019", "entries": [{"name": "Adversarial Frontier Stitching for Remote Neural Network Watermarking", "url": "https://arxiv.org/abs/1711.01894", "description": "(Neural Computing and Applications) [(Alternative implementation) (\u2b5024)](https://github.com/dunky11/adversarial-frontier-stitching) *Check if a remote machine learning model is a \"leaked\" one: through standard API requests to a remote model, extract (or not) a zero-bit watermark, that was inserted to watermark valuable models (eg, large deep neural networks).*"}, {"name": "Knockoff Nets: Stealing Functionality of Black-Box Models", "url": "https://arxiv.org/abs/1812.02766.pdf", "description": "(CVPR) *Ask to what extent can an adversary steal functionality of such \"victim\" models based solely on blackbox interactions: image in, predictions out.*"}, {"name": "Opening Up the Black Box:Auditing Google's Top Stories Algorithm", "url": "https://par.nsf.gov/servlets/purl/10101277", "description": "(Flairs-32) *Audit of the Google's Top stories panel that pro-vides insights into its algorithmic choices for selectingand ranking news publisher*"}, {"name": "Making targeted black-box evasion attacks effective andefficient", "url": "https://arxiv.org/pdf/1906.03397.pdf", "description": "(arXiv) *Investigates how an adversary can optimally use its query budget for targeted evasion attacks against deep neural networks.*"}, {"name": "Online Learning for Measuring Incentive Compatibility in Ad Auctions", "url": "https://research.fb.com/wp-content/uploads/2019/05/Online-Learning-for-Measuring-Incentive-Compatibility-in-Ad-Auctions.pdf", "description": "(WWW) *Measures the incentive compatible- (IC) mechanisms (regret) of black-box auction platforms.*"}, {"name": "TamperNN: Efficient Tampering Detection of Deployed Neural Nets", "url": "https://arxiv.org/abs/1903.00317", "description": "(ISSRE) *Algorithms to craft inputs that can detect the tampering with a remotely executed classifier model.*"}, {"name": "Neural Network Model Extraction Attacks in Edge Devicesby Hearing Architectural Hints", "url": "https://arxiv.org/pdf/1903.03916.pdf", "description": "(arxiv) *Through the acquisition of memory access events from bus snooping, layer sequence identification bythe LSTM-CTC model, layer topology connection according to the memory access pattern, and layer dimension estimation under data volume constraints, it demonstrates one can accurately recover the a similar network architecture as the attack starting point*"}, {"name": "Stealing Knowledge from Protected Deep Neural Networks Using Composite Unlabeled Data", "url": "https://ieeexplore.ieee.org/abstract/document/8851798", "description": "(ICNN) *Composite method which can be used to attack and extract the knowledge ofa black box model even if it completely conceals its softmaxoutput.*"}, {"name": "Neural Network Inversion in Adversarial Setting via Background Knowledge Alignment", "url": "https://dl.acm.org/citation.cfm?id=3354261", "description": "(CCS) *Model inversion approach in the adversary setting based on training an inversion model that acts as aninverse of the original model. With no fullknowledge about the original training data, an accurate inversion is still possible by training the inversion model on auxiliary samplesdrawn from a more generic data distribution.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2018", "entries": [{"name": "Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR", "url": "https://arxiv.org/abs/1711.00399", "description": "(Harvard Journal of Law & Technology) *To explain a decision on x, find a conterfactual: the closest point to x that changes the decision.*"}, {"name": "Distill-and-Compare: Auditing Black-Box Models Using Transparent Model Distillation", "url": "https://arxiv.org/abs/1710.06169", "description": "(AIES) *Treats black box models as teachers, training transparent student models to mimic the risk scores assigned by black-box models.*"}, {"name": "Towards Reverse-Engineering Black-Box Neural Networks", "url": "https://arxiv.org/abs/1711.01768", "description": "(ICLR) [(Code) (\u2b5056)](https://github.com/coallaoh/WhitenBlackBox) *Infer inner hyperparameters (eg number of layers, non-linear activation type) of a remote neural network model by analysing its response patterns to certain inputs.*"}, {"name": "Data driven exploratory attacks on black box classifiers in adversarial domains", "url": "https://www.sciencedirect.com/science/article/pii/S092523121830136X", "description": "(Neurocomputing) *Reverse engineers remote classifier models (e.g., for evading a CAPTCHA test).*"}, {"name": "xGEMs: Generating Examplars to Explain Black-Box Models", "url": "https://arxiv.org/pdf/1806.08867.pdf", "description": "(arXiv) *Searches bias in the black box model by training an unsupervised implicit generative model. Thensummarizes the black-box model behavior quantitatively by perturbing data samples along the data manifold.*"}, {"name": "Learning Networks from Random Walk-Based Node Similarities", "url": "https://arxiv.org/pdf/1801.07386", "description": "(NIPS) *Reversing graphs by observing some random walk commute times.*"}, {"name": "Identifying the Machine Learning Family from Black-Box Models", "url": "https://rd.springer.com/chapter/10.1007/978-3-030-00374-6_6", "description": "(CAEPIA) *Determines which kind of machine learning model is behind the returned predictions.*"}, {"name": "Stealing Neural Networks via Timing Side Channels", "url": "https://arxiv.org/pdf/1812.11720.pdf", "description": "(arXiv) *Stealing/approximating a model through timing attacks usin queries.*"}, {"name": "Copycat CNN: Stealing Knowledge by Persuading Confession with Random Non-Labeled Data", "url": "https://arxiv.org/abs/1806.05476", "description": "(IJCNN)  [(Code) (\u2b5028)](https://github.com/jeiks/Stealing_DL_Models) *Stealing black-box models (CNNs) knowledge by querying them with random natural images (ImageNet and Microsoft-COCO).*"}, {"name": "Auditing the Personalization and Composition of Politically-Related Search Engine Results Pages", "url": "https://dl.acm.org/doi/10.1145/3178876.3186143", "description": "(WWW) *A Chrome extension to survey participants and collect the Search Engine Results Pages (SERPs) and autocomplete suggestions, for studying personalization and composition.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2017", "entries": [{"name": "Uncovering Influence Cookbooks : Reverse Engineering the Topological Impact in Peer Ranking Services", "url": "https://dl.acm.org/authorize.cfm?key=N21772", "description": "(CSCW) *Aims at identifying which centrality metrics are in use in a peer ranking service.*"}, {"name": "The topological face of recommendation: models and application to bias detection", "url": "https://arxiv.org/abs/1704.08991", "description": "(Complex Networks) *Proposes a bias detection framework for items recommended to users.*"}, {"name": "Membership Inference Attacks Against Machine Learning Models", "url": "http://ieeexplore.ieee.org/document/7958568/", "description": "(Symposium on Security and Privacy) *Given a machine learning model and a record, determine whether this record was used as part of the model's training dataset or not.*"}, {"name": "Practical Black-Box Attacks against Machine Learning", "url": "https://dl.acm.org/citation.cfm?id=3053009", "description": "(Asia CCS) *Understand how vulnerable is a remote service to adversarial classification attacks.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2016", "entries": [{"name": "Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning Systems", "url": "https://www.andrew.cmu.edu/user/danupam/datta-sen-zick-oakland16.pdf", "description": "(IEEE S\\&P) *Evaluate the individual, joint and marginal influence of features on a model using shapley values.*"}, {"name": "Auditing Black-Box Models for Indirect Influence", "url": "https://arxiv.org/abs/1602.07043", "description": "(ICDM) *Evaluate the influence of a variable on a black-box model by \"cleverly\" removing it from the dataset and looking at the accuracy gap*"}, {"name": "Iterative Orthogonal Feature Projection for Diagnosing Bias in Black-Box Models", "url": "https://arxiv.org/abs/1611.04967", "description": "(FATML Workshop) *Performs feature ranking to analyse black-box models*"}, {"name": "Bias in Online Freelance Marketplaces: Evidence from TaskRabbit", "url": "http://datworkshop.org/papers/dat16-final22.pdf", "description": "(dat workshop) *Measures the TaskRabbit's search algorithm rank.*"}, {"name": "Stealing Machine Learning Models via Prediction APIs", "url": "https://www.usenix.org/conference/usenixsecurity16/technical-sessions/presentation/tramer", "description": "(Usenix Security)  [(Code) (\u2b50356)](https://github.com/ftramer/Steal-ML) *Aims at extracting machine learning models in use by remote services.*"}, {"name": "\u201cWhy Should I Trust You?\u201dExplaining the Predictions of Any Classifier", "url": "https://arxiv.org/pdf/1602.04938v3.pdf", "description": "(arXiv)  [(Code) (\u2b50321)](https://github.com/marcotcr/lime-experiments) *Explains a blackbox classifier model by sampling around data instances.*"}, {"name": "Back in Black: Towards Formal, Black Box Analysis of Sanitizers and Filters", "url": "http://ieeexplore.ieee.org/document/7546497/", "description": "(Security and Privacy) *Black-box analysis of sanitizers and filters.*"}, {"name": "Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning Systems", "url": "http://ieeexplore.ieee.org/document/7546525/", "description": "(Security and Privacy) *Introduces measures that capture the degree of influence of inputs on outputs of the observed system.*"}, {"name": "An Empirical Analysis of Algorithmic Pricing on Amazon Marketplace", "url": "https://mislove.org/publications/Amazon-WWW.pdf", "description": "(WWW) [(Code)](http://personalization.ccs.neu.edu) *Develops a methodology for detecting algorithmic pricing, and use it empirically to analyze their prevalence and behavior on Amazon Marketplace.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2015", "entries": [{"name": "Certifying and Removing Disparate Impact", "url": "https://arxiv.org/abs/1412.3756", "description": "(SIGKDD) *Proposes SVM-based methods to certify absence of bias and methods to remove biases from a dataset.*"}, {"name": "Peeking Beneath the Hood of Uber", "url": "https://dl.acm.org/citation.cfm?id=2815681", "description": "(IMC) *Infer implementation details of Uber's surge price algorithm.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2014", "entries": [{"name": "A peek into the black box: exploring classifiers by randomization", "url": "https://github.com/erwanlemerrer/awesome-audit-algorithms/blob/main/README.md/", "description": "(Data Mining and Knowledge Discovery journal) ([code (\u2b502)](https://github.com/tsabsch/goldeneye)) *Finds groups of features that can be permuted without changing the output label of predicted samples*"}, {"name": "XRay: Enhancing the Web's Transparency with Differential Correlation", "url": "https://www.usenix.org/node/184394", "description": "(USENIX Security) *Audits which user profile data were used for targeting a particular ad, recommendation, or price.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2013", "entries": [{"name": "Measuring Personalization of Web Search", "url": "https://dl.acm.org/citation.cfm?id=2488435", "description": "(WWW) *Develops a methodology for measuring personalization in Web search result.*"}, {"name": "Auditing: Active Learning with Outcome-Dependent Query Costs", "url": "https://www.cs.bgu.ac.il/~sabatos/papers/SabatoSarwate13.pdf", "description": "(NIPS) *Learns from a binary classifier paying only for negative labels.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2012", "entries": [{"name": "Query Strategies for Evading Convex-Inducing Classifiers", "url": "http://www.jmlr.org/papers/v13/nelson12a.html", "description": "(JMLR) *Evasion methods for convex classifiers. Considers evasion complexity.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2008", "entries": [{"name": "Privacy Oracle: a System for Finding Application Leakswith Black Box Differential Testing", "url": "https://dl.acm.org/citation.cfm?id=1455806", "description": "(CCS) *Privacy Oracle: a system that uncovers applications' leaks of personal information in transmissions to remoteservers.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2005", "entries": [{"name": "Adversarial Learning", "url": "https://dl.acm.org/citation.cfm?id=1081950", "description": "(KDD) *Reverse engineering of remote linear classifiers, using membership queries.*"}], "notes": []}, {"name": "Audit Algorithms \u2014 2025", "entries": [{"name": "AIMLAI at ECML/PKDD 2025", "url": "https://project.inria.fr/aimlai/", "description": ""}, {"name": "AAAI workshop on AI Governance: Alignment, Morality, and Law", "url": "https://aaai.org/conference/aaai/aaai-25/workshop-list/#ws06", "description": ""}], "notes": []}, {"name": "Audit Algorithms \u2014 2024", "entries": [{"name": "1st International Conference on Auditing and Artificial Intelligence", "url": "https://www.ircg.msm.uni-due.de/ai/", "description": ""}, {"name": "Regulatable ML Workshop (RegML'24)", "url": "https://regulatableml.github.io/", "description": ""}], "notes": []}, {"name": "Audit Algorithms \u2014 2023", "entries": [{"name": "Supporting User Engagement in Testing, Auditing, and Contesting AI (CSCW User AI Auditing)", "url": "https://cscw-user-ai-auditing.github.io/", "description": ""}, {"name": "Workshop on Algorithmic Audits of Algorithms (WAAA)", "url": "https://algorithmic-audits.github.io", "description": ""}, {"name": "Regulatable ML Workshop (RegML'23)", "url": "https://regulatableml.github.io/", "description": ""}], "notes": []}], "total_entries": 99}, {"name": "Artificial Intelligence", "subcategories": [{"name": "Artificial Intelligence \u2014 \ud83d\udcda Books", "entries": [{"name": "Designing Machine Learning Systems", "url": "https://www.oreilly.com/library/view/designing-machine-learning/9781098107956/", "description": "Scalable, maintainable ML pipelines (Chip Huyen)."}, {"name": "Generative Deep Learning (2nd Edition)", "url": "https://www.oreilly.com/library/view/generative-deep-learning/9781098134174/", "description": "GANs, VAEs, diffusion models (David Foster)."}, {"name": "AI Engineering", "url": "https://www.oreilly.com/library/view/ai-engineering/9781098166298/", "description": "End-to-end AI product building (Chip Huyen)."}, {"name": "100 Page Language Models Book", "url": "https://www.thelmbook.com/", "description": "This book guides you through the evolution of language models, starting from machine learning fundamentals."}, {"name": "Artificial Intelligence: A Modern Approach", "url": "https://aima.cs.berkeley.edu/", "description": "Comprehensive AI theory (Russell & Norvig)."}, {"name": "Deep Learning", "url": "https://www.deeplearningbook.org/", "description": "Neural networks & architectures (Goodfellow, Bengio, Courville)."}, {"name": "Reinforcement Learning: An Introduction (2nd Edition)", "url": "https://web.stanford.edu/class/psych209/Readings/SuttonBartoIPRLBook2ndEd.pdf", "description": "RL fundamentals (Sutton & Barto)."}], "notes": []}, {"name": "Artificial Intelligence \u2014 \ud83c\udfd7 AI Engineering", "entries": [{"name": "OpenAI Agents Guide", "url": "https://cdn.openai.com/business-guides-and-resources/a-practical-guide-to-building-agents.pdf", "description": "Practical guide on building agents"}, {"name": "Google AI Agents Paper", "url": "https://www.kaggle.com/whitepaper-agents", "description": "Practical guide to building AI agents from Google"}, {"name": "Google Agents Companion Paper", "url": "https://www.kaggle.com/whitepaper-agent-companion", "description": "Guide from Google"}, {"name": "OpenAI Cookbook", "url": "https://cookbook.openai.com/", "description": "Example code, recipes, and best practices for working with OpenAI APIs."}, {"name": "LLM Engineer Handbook", "url": "https://github.com/SylphAI-Inc/LLM-engineer-handbook", "description": "A goldmine of useful links for AI engineers", "stars": "4.4k"}, {"name": "PocketFlow", "url": "https://the-pocket.github.io/PocketFlow/", "description": "Extremely minimalist AI agent framework in just 100 lines of code. Fantastic way to learn."}, {"name": "Google ADK", "url": "https://google.github.io/adk-docs/", "description": "Google's Agent Development Kit (Python, Java). Great local development experience + A2A + MCP."}, {"name": "Pydantic-AI", "url": "https://ai.pydantic.dev/", "description": "Typed, structured LLM orchestration framework built on Pydantic models for safe, predictable outputs."}, {"name": "LangGraph", "url": "https://www.langchain.com/langgraph", "description": "Build multi-agent workflows with stateful graphs on top of LangChain."}, {"name": "CrewAI", "url": "https://www.crewai.com/", "description": "Agent orchestration with structured tasks and human-in-the-loop controls."}, {"name": "AutoGen", "url": "https://microsoft.github.io/autogen/", "description": "Microsoft\u2019s framework for multi-agent conversation and collaboration."}, {"name": "LlamaIndex", "url": "https://www.llamaindex.ai/", "description": "Data framework for ingesting, indexing, and querying private data with LLMs."}, {"name": "Haystack", "url": "https://haystack.deepset.ai/", "description": "Open-source search/RAG framework with modular pipelines."}, {"name": "Docling", "url": "https://github.com/docling-project/docling", "description": "Great library for ingesting any kind of document for RAG \u2b50", "stars": "45k"}, {"name": "OpenAI Evals", "url": "https://github.com/openai/evals", "description": "OpenAI's framework for writing evals", "stars": "17k"}], "notes": []}, {"name": "Artificial Intelligence \u2014 \ud83d\udcc4 Landmark Papers", "entries": [{"name": "Attention Is All You Need", "url": "https://arxiv.org/abs/1706.03762", "description": "Transformer architecture."}, {"name": "Scaling Laws for Neural Language Models", "url": "https://arxiv.org/abs/2001.08361", "description": "Model/data/compute scaling."}, {"name": "Language Models are Few-Shot Learners", "url": "https://arxiv.org/abs/2005.14165", "description": "GPT-3 capabilities."}, {"name": "Constitutional AI", "url": "https://arxiv.org/abs/2212.08073", "description": "Safer model alignment."}, {"name": "Google Generative AI Learning Path", "url": "https://www.cloudskillsboost.google/paths/118", "description": ""}, {"name": "Hugging Face LLM Course", "url": "https://huggingface.co/learn/llm-course/chapter1/1", "description": ""}, {"name": "Fast.ai \u2014 Practical Deep Learning", "url": "https://course.fast.ai/", "description": ""}, {"name": "Stanford CS324: Large Language Models", "url": "https://stanford-cs324.github.io/winter2022/", "description": ""}, {"name": "Full Stack Deep Learning", "url": "https://fullstackdeeplearning.com/", "description": ""}, {"name": "MIT 6.S191: Intro to Deep Learning", "url": "https://introtodeeplearning.com/", "description": ""}, {"name": "DeepLearning.AI Short Courses", "url": "https://learn.deeplearning.ai/", "description": ""}, {"name": "Google Deepmind| Introduction to Reinforcement Learning", "url": "https://www.youtube.com/playlist?list=PLqYmG7hTraZDM-OYHWgPebj2MfCFzFObQ", "description": ""}, {"name": "Karpathy\u2019s LLM Zero-to-Hero", "url": "https://www.youtube.com/playlist?list=PLAqhIrjkxbuWI23v9cThsA9GvCAUhRvKZ", "description": ""}, {"name": "Neural Nets - Zero-to-Hero", "url": "https://www.youtube.com/playlist?list=PLAqhIrjkxbuWI23v9cThsA9GvCAUhRvKZ", "description": ""}, {"name": "The Rundown AI", "url": "https://www.therundown.ai/", "description": ""}, {"name": "AlphaSignal", "url": "https://alphasignal.ai/", "description": ""}, {"name": "Superhuman AI", "url": "https://www.superhuman.ai/", "description": ""}, {"name": "AI Engineer", "url": "https://newsletter.owainlewis.com", "description": ""}], "notes": []}, {"name": "Artificial Intelligence \u2014 \ud83d\udcac Models", "entries": [{"name": "ChatGPT", "url": "https://openai.com/chatgpt/overview/", "description": "Best for general coding + reasoning."}, {"name": "Claude", "url": "https://www.anthropic.com/claude", "description": "Best for long-context analysis and structured thinking."}, {"name": "Gemini", "url": "https://gemini.google.com/", "description": "Best for Google ecosystem integration."}, {"name": "Perplexity", "url": "https://www.perplexity.ai/", "description": "Best for quick research with live citations."}, {"name": "Cohere", "url": "https://cohere.com/", "description": "Best for enterprise LLMs with strong retrieval-augmented generation APIs."}, {"name": "Mistral", "url": "https://mistral.ai/", "description": "Best for lightweight, high-performance open-weight models."}, {"name": "Qwen", "url": "https://qwenlm.github.io/", "description": "Best for multilingual and Chinese-first applications."}, {"name": "DeepSeek", "url": "https://deepseek.com/", "description": "Best for efficient, cost-optimized large models with competitive reasoning."}], "notes": []}, {"name": "Artificial Intelligence \u2014 \ud83d\udc68\u200d\ud83d\udcbb Code & Developer Tools", "entries": [{"name": "Claude Code", "url": "https://www.anthropic.com/claude", "description": "IDE extensions with long-context code edits."}, {"name": "GitHub Copilot", "url": "https://github.com/features/copilot", "description": "In-IDE code completion, chat, and refactors."}, {"name": "Cursor", "url": "https://cursor.sh/", "description": "LLM-powered IDE for multi-file edits and codebase-aware chat."}], "notes": []}, {"name": "Artificial Intelligence \u2014 \ud83c\udfa8 Multimedia AI Tools", "entries": [{"name": "ChatGPT-4o Image Generation", "url": "https://openai.com/chatgpt", "description": "Integrated image creation with style control."}, {"name": "Midjourney", "url": "https://www.midjourney.com/", "description": "Artistic and photorealistic images and video."}, {"name": "Adobe Firefly", "url": "https://www.adobe.com/sensei/generative-ai/firefly.html", "description": "Integrated into Creative Cloud."}, {"name": "Ideogram", "url": "https://ideogram.ai/", "description": "Precise, legible text in generated images."}, {"name": "Flux", "url": "https://blackforestlabs.ai/", "description": "High-res, prompt-editable images."}, {"name": "Kling", "url": "https://klingai.com/", "description": "Cinematic, realistic video generation."}, {"name": "Google Veo 3", "url": "https://deepmind.google/technologies/veo/", "description": "High-quality video with synchronized audio."}, {"name": "Runway", "url": "https://runwayml.com/", "description": "Video editing + generation."}, {"name": "ElevenLabs", "url": "https://elevenlabs.io/", "description": "High-quality text-to-speech."}, {"name": "Suno", "url": "https://suno.ai/", "description": "AI music from text prompts."}, {"name": "Aiva", "url": "https://www.aiva.ai/", "description": "Music composition for media."}], "notes": []}], "total_entries": 62}, {"name": "Recursion Schemes", "subcategories": [{"name": "Recursion Schemes", "entries": [{"name": "Introductions", "url": "#introductions", "description": ""}, {"name": "Articles", "url": "#articles", "description": ""}, {"name": "Papers", "url": "#papers", "description": ""}, {"name": "Presentations", "url": "#presentations", "description": ""}, {"name": "Cheat Sheets", "url": "#cheat-sheets", "description": ""}, {"name": "Podcasts", "url": "#podcasts", "description": ""}, {"name": "Implementations", "url": "#implementations", "description": ""}, {"name": "Awesome Recursion Schemes", "url": "https://github.com/passy/awesome-recursion-schemes", "description": "A curation of useful resources for learning about and using recursion schemes.", "stars": "1.1k"}, {"name": "Practical Recursion Schemes", "url": "https://jtobin.io/practical-recursion-schemes", "description": ""}, {"name": "An Introduction to Recursion Schemes", "url": "http://blog.sumtypeofway.com/an-introduction-to-recursion-schemes/", "description": ""}, {"name": "Understanding Algebras", "url": "https://www.schoolofhaskell.com/user/bartosz/understanding-algebras", "description": ""}, {"name": "Recursion Schemes in JavaScript and Flow", "url": "https://medium.com/@JosephJnk/recursion-schemes-in-javascript-and-flow-with-static-land-recursision-schemes-97cf10599fb7", "description": ""}, {"name": "Recursion Schemes: A Field Guide (Redux)", "url": "http://comonad.com/reader/2009/recursion-schemes/", "description": ""}, {"name": "Catamorphisms", "url": "https://wiki.haskell.org/Catamorphisms", "description": "Definition on the Haskell Wiki."}, {"name": "Catamorphisms", "url": "https://www.schoolofhaskell.com/user/edwardk/recursion-schemes/catamorphisms", "description": ""}, {"name": "Rotating Squares", "url": "https://jtobin.io/rotating-squares", "description": "Using a hylomorphism to rotate a quadtree by Jared Tobin."}, {"name": "Recursion Schemes, Part V: Hello, Hylomorphisms", "url": "http://blog.sumtypeofway.com/recursion-schemes-part-v/", "description": ""}, {"name": "Promorphisms, Pre and Post", "url": "https://jtobin.io/promorphisms-pre-post", "description": "Practical examples of pre- and postpromorphisms by Jared Tobin."}, {"name": "Time Traveling Recursion Schemes", "url": "https://jtobin.io/time-traveling-recursion", "description": "Exploring histo and futu by example by Jared Tobin."}, {"name": "Recursion Schemes, Part IV: Time is of the Essence", "url": "http://blog.sumtypeofway.com/recursion-schemes-part-iv-time-is-of-the-essence/", "description": "Practical article about histomorphism and the futumorphism."}, {"name": "Cheat Sheet", "url": "https://github.com/sellout/recursion-scheme-talk/blob/master/cheat%20sheet.pdf", "description": "Map of various recursion schemes and their duals.", "stars": "204"}, {"name": "Correcting the Visitor pattern", "url": "http://logji.blogspot.co.uk/2012/02/correcting-visitor-pattern.html", "description": "Showing that the Visitor pattern implements an f-algebra for use with a catamorphism (in Java)."}, {"name": "Recursion Schemes in Scala", "url": "https://free.cofree.io/2017/11/13/recursion/", "description": "Introduces the fixpoint combinator, anamorphism, catamorphism, hylomorphism, paramorphism, apomorphism, histomorphism, dynamorphism and futumorphism."}, {"name": "What's in a Fold: The Basic Catamorphism in recursion-schemes", "url": "https://duplode.github.io/posts/whats-in-a-fold.html", "description": "Introduces catamorphism as a generalization of fold."}], "notes": []}, {"name": "Recursion Schemes \u2014 Hylomorphisms in the Wild", "entries": [{"name": "Stalking a Hylomorphism in the Wild", "url": "https://bartoszmilewski.com/2017/12/29/stalking-a-hylomorphism-in-the-wild/", "description": "Advent of Code 2017, Domino challenge"}, {"name": "Open Seasons on Hylomorphisms", "url": "https://bartoszmilewski.com/2018/12/20/open-season-on-hylomorphisms/", "description": "Advent of Code 2018, String comparison challenge"}, {"name": "Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire, 1991, Meijer et al.", "url": "http://maartenfokkinga.github.io/utwente/mmf91m.pdf", "description": ""}, {"name": "A Duality of Sorts, 2013, Hinze et al.", "url": "http://www.cs.ox.ac.uk/ralf.hinze/publications/Sorting.pdf", "description": ""}, {"name": "Sorting with Bialgebras and Distributive Laws, 2012, Hinze et al.", "url": "http://www.cs.ox.ac.uk/people/daniel.james/sorting/sorting.pdf", "description": ""}, {"name": "Scrap your boilerplate: a practical design pattern for generic programming, 2003, SPJ et al.", "url": "http://research.microsoft.com/en-us/um/people/simonpj/Papers/hmap/hmap.ps", "description": ""}, {"name": "Slidedecks by Tim Philip Williams", "url": "http://www.timphilipwilliams.com/slides.html", "description": ""}, {"name": "Unifying Structured Recursion Schemes", "url": "https://www.youtube.com/watch?v=9EGYSb9vov8", "description": ""}, {"name": "Recursion Schemes", "url": "https://www.youtube.com/watch?v=Zw9KeP3OzpU", "description": ""}, {"name": "F-algebras or: How I Learned to Stop Worrying and Love the Type System", "url": "https://www.youtube.com/watch?v=PK4SOaAGVfg", "description": ""}, {"name": "A Gentle Introduction to Recursion Schemes", "url": "https://www.youtube.com/watch?v=i5A2Amfcir8", "description": ""}, {"name": "recursion-scheme-talk", "url": "https://github.com/sellout/recursion-scheme-talk", "description": "Collection of slide decks about recursion schemes.", "stars": "204"}, {"name": "Bracer: Transforming Real-World Languages with Coproducts and Recursion Schemes", "url": "https://www.youtube.com/watch?v=5Kr7IykGMzU", "description": "High-level talk about structuring programs with coproducts and recursion schemes by Patrick Thomson."}, {"name": "Recursion: Where Functional Programming Hits Bottom", "url": "https://www.youtube.com/watch?v=24UoRaoKLjM", "description": "Introduction to recursive fix point data structures and recursion schemes in Haskell and Scala by Greg Pfeil."}, {"name": "Programming with algebras", "url": "https://www.youtube.com/watch?v=-98fR9VmLbQ", "description": "Bartosz Milewski's article in talk form, presented at LambdaCon."}, {"name": "Peeling the Banana: Recursion Schemes from First Principles", "url": "https://www.youtube.com/watch?v=XZ9nPZbaYfE\\&t=3s", "description": "Zainab Ali's Introductory talk presented at LambdaWorld."}, {"name": "The Hitchhiker's Guide to Morphisms", "url": "https://ipfs.io/ipfs/QmTppu1VDAQWsdiyVSZX6qb8PErdpwzNP2oKfEhcgaBvWR/guide-to-morphisms.pdf", "description": "Overview of different morphisms including a printable PDF."}, {"name": "Magic Read Along", "url": "http://www.magicreadalong.com/", "description": "Casual discussions about"}, {"name": "Scala Love", "url": "https://scala.love/", "description": "Podcast about Scala that brings up"}, {"name": "The Haskell Cast", "url": "https://www.haskellcast.com/", "description": "Recursion schemes come up in"}, {"name": "recursion-schemes", "url": "https://github.com/ekmett/recursion-schemes/", "description": "", "stars": "310"}, {"name": "Matryoshka", "url": "https://github.com/slamdata/matryoshka", "description": "", "stars": "795"}, {"name": "andyscott/droste", "url": "https://github.com/andyscott/droste", "description": "", "stars": "351"}, {"name": "recursion\\_schemes", "url": "https://github.com/vmchale/recursion_schemes/", "description": "", "stars": "60"}, {"name": "purescript-matryoshka", "url": "https://github.com/slamdata/purescript-matryoshka", "description": "", "stars": "57"}, {"name": "recursion", "url": "https://github.com/vmchale/recursion", "description": "", "stars": "8"}, {"name": "dada", "url": "https://github.com/sellout/dada", "description": "", "stars": "58"}, {"name": "static-land-recursion-schemes", "url": "https://github.com/JosephJNK/static-land-recursion-schemes", "description": "", "stars": "21"}, {"name": "Katalyst", "url": "https://github.com/aedans/Katalyst", "description": "", "stars": "22"}], "notes": []}], "total_entries": 53}, {"name": "Algorithms", "subcategories": [{"name": "Algorithms", "entries": [{"name": "Awesome Algorithms", "url": "#awesome-algorithms", "description": ""}], "notes": []}, {"name": "Algorithms \u2014 YouTube Playlist", "entries": [{"name": "Khan Academy Algorithms", "url": "https://www.khanacademy.org/computing/computer-science/algorithms", "description": "Algorithm course ministered by Tomas Cormen and Devin Balkcom."}], "notes": []}, {"name": "Algorithms \u2014 Book", "entries": [{"name": "Real World Algorithms: A Beginner's Guide", "url": "https://mitpress.mit.edu/books/real-world-algorithms", "description": "An introduction to algorithms for readers with no background in advanced mathematics or computer science."}, {"name": "Levitin. Introduction to Algorithms", "url": "https://www.amazon.com/Introduction-Design-Analysis-Algorithms-3rd/dp/0132316811", "description": "A very accessible illustration of algorithms in the forms of puzzles. No programming experience is required!"}], "notes": []}, {"name": "Algorithms \u2014 Interactive Learning & Visualization", "entries": [{"name": "VisuAlgo", "url": "http://visualgo.net", "description": "Visualising data structures and algorithms through animation."}, {"name": "See Algorithms", "url": "https://see-algorithms.com/", "description": "Visualizes algorithms and lets users create and share custom graphs and binary trees."}], "notes": []}, {"name": "Algorithms \u2014 Website", "entries": [{"name": "CP-Algorithms", "url": "https://cp-algorithms.com/", "description": "Algorithms and data structures are especially popular in the field of competitive programming."}], "notes": []}, {"name": "Algorithms \u2014 Book", "entries": [{"name": "Steven Halim. Competitive Programming book", "url": "https://cpbook.net/", "description": ""}], "notes": []}, {"name": "Algorithms \u2014 Competition Website", "entries": [{"name": "HackerEarth", "url": "https://www.hackerearth.com/", "description": "Accessible tutorials for beginners."}, {"name": "Code Chef", "url": "https://www.codechef.com/contests", "description": "Accessible problems for beginners."}, {"name": "Codeforces", "url": "http://codeforces.com/", "description": "Challenging problems."}, {"name": "TopCoder", "url": "https://www.topcoder.com/", "description": "Sponsored by tech companies."}, {"name": "Leet Code", "url": "https://leetcode.com/", "description": "Interviews problems."}, {"name": "UVA", "url": "https://uva.onlinejudge.org/", "description": "Archives previous ACM-ICPC Regionals and World Finals."}, {"name": "ProjectEuler", "url": "https://projecteuler.net/", "description": "Math oriented problems."}], "notes": []}, {"name": "Algorithms \u2014 Blog", "entries": [{"name": "An awesome list for competitive programming!", "url": "https://codeforces.com/blog/entry/23054", "description": "Awesome blog for all the resources and list of books and algorithms."}, {"name": "Algorithms Weekly", "url": "https://petr-mitrichev.blogspot.com/", "description": "A good blog by Petr Mitrichev, mainly in Java."}, {"name": "Algorithm Tutorials by Tanuj Khattar", "url": "https://tanujkhattar.wordpress.com/", "description": "Excellent blog by Tanuj Khattar. Covers tutorials on some interesting data structures along with example problems to solve."}], "notes": []}, {"name": "Algorithms \u2014 Book", "entries": [{"name": "Introduction to Algorithms", "url": "https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/", "description": "Standard classic for anyone."}, {"name": "The Art of Computer Programming", "url": "http://www-cs-faculty.stanford.edu/~uno/taocp.html", "description": "Knuth's classic."}, {"name": "The Algorithm Design Manual", "url": "http://www.algorist.com/", "description": "Easy to read and full of real-world examples."}], "notes": []}, {"name": "Algorithms \u2014 Online Course", "entries": [{"name": "MIT - 6-006", "url": "https://ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/video_galleries/lecture-videos/", "description": "Well explained algorithms."}, {"name": "MIT - 6-046j", "url": "https://ocw.mit.edu/courses/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video_galleries/video-lectures/", "description": "Similar to the previous one, but with different algorithms."}, {"name": "MIT - 6-00sc", "url": "http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/index.htm", "description": "An easy and well-explained introduction to algorithms."}], "notes": []}, {"name": "Algorithms \u2014 YouTube Playlist", "entries": [{"name": "Tim Roughgarden. Algorithms Illuminated", "url": "https://www.algorithmsilluminated.org/", "description": "Tim Roughgarden, a pioneer of computer science, offers a companion to his book, with lecture videos and slides."}, {"name": "Performance Engineering of Software Systems. MIT OCW", "url": "https://ocw.mit.edu/courses/6-172-performance-engineering-of-software-systems-fall-2018/", "description": "A hands-on, project-based introduction to building scalable and high-performance software systems. Topics include performance analysis, algorithmic techniques for high performance, instruction-level optimizations, and caching optimizations."}, {"name": "Cloud and Distributed Computing: Algorithms and Systems by Misra & Patel", "url": "https://www.wileyindia.com/cloud-and-distributed-computing-algorithms-and-systems.html", "description": "It teaches the internals of cloud computing and how concepts of distributed systems work inside clouds."}, {"name": "PostgreSQL Query Optimization: The Ultimate Guide to Building Efficient Queries", "url": "https://www.oreilly.com/library/view/postgresql-query-optimization/9781484268858/", "description": "It introduces different classes of queries and optimization techniques suitable to each, such as the use of indexes and specific join algorithms."}, {"name": "Fabulous Adventures in Data Structures and Algorithms", "url": "https://www.manning.com/books/fabulous-adventures-in-data-structures-and-algorithms", "description": "It teaches lesser-known algorithmic approaches like immutable data structures\u2014stacks, queues, deques, and unusual constructions like Hughes lists."}, {"name": "Tech Interview Cheat Sheet", "url": "https://github.com/TSiege/Tech-Interview-Cheat-Sheet", "description": "", "stars": "4.7k"}, {"name": "Princeton DS Cheat Sheet", "url": "https://algs4.cs.princeton.edu/cheatsheet/", "description": ""}, {"name": "CLRS in short", "url": "https://sinon.org/algorithms//#data-structures", "description": ""}, {"name": "Rice university DS course in short", "url": "https://www.clear.rice.edu/comp160/data1.html", "description": ""}, {"name": "Algo Deck", "url": "https://github.com/teivah/algodeck/", "description": "An open-source collection of +200 algorithmic cards.", "stars": "5.8k"}, {"name": "Theoretical Computer Science", "url": "https://github.com/mostafatouny/awesome-theoretical-computer-science/", "description": "The interdisciplinary of Mathematics and Computer Science, distinguished by its emphasis on mathematical technique and rigour.", "stars": "1.1k"}, {"name": "Math", "url": "https://github.com/rossant/awesome-math#readme", "description": "Freely available lecture notes on mathematics.", "stars": "13k"}], "notes": []}], "total_entries": 36}, {"name": "Papers We Love", "subcategories": [{"name": "Papers We Love \u2014 Chapters", "entries": [], "notes": []}, {"name": "Papers We Love \u2014 Past Presentations", "entries": [], "notes": []}, {"name": "Papers We Love \u2014 Other Good Places to Find Papers", "entries": [{"name": "2 Minute Papers", "url": "https://www.youtube.com/user/keeroyz", "description": ""}, {"name": "alphaXiv", "url": "https://www.alphaxiv.org/", "description": ""}, {"name": "arXiv Paper Repository", "url": "http://arxiv.org/", "description": ""}, {"name": "Bell System Technical Journal, 1922-1983", "url": "https://www.bell-labs.com/our-research/technical-journal/", "description": ""}, {"name": "Best Paper Awards in Computer Science", "url": "http://jeffhuang.com/best_paper_awards.html", "description": ""}, {"name": "cat-v.org", "url": "http://doc.cat-v.org/", "description": ""}, {"name": "eugeneyan/applied-ml GitHub repository", "url": "https://github.com/eugeneyan/applied-ml", "description": "", "stars": "28k"}, {"name": "Facebook", "url": "https://research.facebook.com/publications/", "description": ""}, {"name": "Functional Programming Books Review", "url": "http://alexott.net/en/fp/books/", "description": ""}, {"name": "Google Scholar", "url": "http://scholar.google.com/citations?view_op=top_venues\\&hl=en\\&vq=eng", "description": ""}, {"name": "Gradual Typing Bibliography", "url": "http://samth.github.io/gradual-typing-bib/", "description": ""}, {"name": "Lobste.rs tagged as PDF", "url": "https://lobste.rs/t/pdf", "description": ""}, {"name": "Microsoft Research", "url": "https://www.microsoft.com/en-us/research/publications/", "description": ""}, {"name": "MIT's Artificial Intelligence Lab Publications", "url": "http://dspace.mit.edu/handle/1721.1/39813", "description": ""}, {"name": "MIT's Distributed System's Reading Group", "url": "http://dsrg.pdos.csail.mit.edu/", "description": ""}, {"name": "netlib", "url": "http://www.netlib.org/", "description": ""}, {"name": "Readings in Distributed Systems", "url": "http://christophermeiklejohn.com/distributed/systems/2013/07/12/readings-in-distributed-systems.html", "description": ""}, {"name": "Research Papers from Robert Harper, Carnegie Mellon University", "url": "https://www.cs.cmu.edu/~rwh/papers/index.html", "description": ""}, {"name": "SciRate", "url": "https://scirate.com/", "description": ""}, {"name": "Security Data Science Papers", "url": "http://www.covert.io/the-definitive-security-datascience-and-machinelearning-guide/", "description": ""}, {"name": "Services Engineering Reading List", "url": "https://github.com/mmcgrana/services-engineering", "description": "", "stars": "3.6k"}, {"name": "The Morning Paper", "url": "http://blog.acolyer.org/", "description": ""}, {"name": "y-archive", "url": "http://yarchive.net/comp/index.html", "description": ""}], "notes": []}, {"name": "Papers We Love \u2014 How To Read a Paper", "entries": [{"name": "How to read an academic article", "url": "http://organizationsandmarkets.com/2010/08/31/how-to-read-an-academic-article/", "description": ""}, {"name": "Advice on reading academic papers", "url": "https://userpages.umbc.edu/~akmassey/posts/2012-02-15-advice-on-reading-academic-papers.html", "description": ""}, {"name": "How to read and understand a scientific paper", "url": "http://violentmetaphors.com/2013/08/25/how-to-read-and-understand-a-scientific-paper-2/", "description": ""}, {"name": "Should I Read Papers?", "url": "http://michaelrbernste.in/2014/10/21/should-i-read-papers.html", "description": ""}, {"name": "The Refreshingly Rewarding Realm of Research Papers", "url": "https://www.youtube.com/watch?v=8eRx5Wo3xYA", "description": ""}, {"name": "How to read a paper", "url": "http://ccr.sigcomm.org/online/files/p83-keshavA.pdf", "description": ""}], "notes": []}, {"name": "Papers We Love \u2014 Applications/Ideas built around Papers We Love", "entries": [], "notes": []}, {"name": "Papers We Love \u2014 Download papers", "entries": [], "notes": []}], "total_entries": 29}], "list_count": 10, "total_entries": 3172, "subcategory_count": 10}