I came across a post on LinkedIn about evolutionary computation, and opted to post this in response:
I never stopped using evolutionary computation. I'm even weirder and use coevolutionary algorithms. Unlike EC, the latter have a bad reputation as being difficult to apply, but if you know what you're doing (e.g. by reading my publications ๐Ÿ˜‰) they're quite powerful in certain application areas. I've successfully applied them to designing resilient physical systems, discovering novel game-playing strategies, and driving online tutoring systems, among other areas. They can inform more conventional multi-objective optimization.

Many challenging problems are not easily "vectorized" or "numericized", but might have straightforward representations in discrete data structures. Combinatorial optimization problems can fall under this umbrella. Techniques that work directly with those representations can be orders of magnitude faster/smaller/cheaper than techniques requiring another layer of representation (natural language for LLMs, vectors of real values for neural networks). Sure, given enough time and resources clever people can work out a good numerical re-representation that allows a deep neural network to solve a problem, or prompt engineer an LLM. But why whack at your problem with a hammer when you have a precision instrument?
I started to put up notes about (my way of conceiving) coevolutionary algorithms on my web site, here. I stopped because it's a ton of work and nobody reads these as far as I can tell. Sound off if you read anything there!

#AI #GenAI #GenerativeAI #LLMs #EvolutionaryComputation #GeneticAlgorithms #GeneticProgramming #EvolutionaryAlgorithms #CoevolutionaryAlgorithms #Cooptimization #CombinatorialOptimization #optimization
coevolutionary algorithms

Anthony Bucci's personal web site

Anthony Bucci

Proud of Denisa Arsene for presenting us and our work at the Complex Networks conference last week. She had a lot of engagement during her presentation, and made a ton of cool new science friends from all over the world ๐Ÿค“ ๐ŸŒŸ

Key contribution: SANA (simulated annealing for network anonymisation), an algorithm that makes small alterations to social networks to protect the people in the network from de-anonymization attacks.

Motivation: Facilitating data sharing between social scientists while preserving the privacy of the people who were part of those studies.

More info, including preprint and poster (with ALT): https://latower.github.io/posts/2025/11/sana/

#Science #Research #ComputerScience #AI #StudentLife #Networking #SciComm #SocialNetworkAnalysis #Algorithmics #SimulatedAnnealing #AcademicMastodon #AcademicChatter #CombinatorialOptimisation #CombinatorialOptimization

Did you know that you can watch short videos describing the research published in the Constraints Journal on ACP's YouTube account?

For example: here's a playlist with videos accompanying Vol 29: https://youtube.com/playlist?list=PLcByDTr7vRTa943JoLYbnbO6fG2HHM11F

#ConstraintProgramming #ACP #ConstraintsJournal #YouTube #SciComm #Science #Research #Optimization #CombinatorialOptimization #AI

Only a few days left to apply!

If you are interested in logic, decision-making, reasoning under uncertainty and statistics, apply by the end of this month for an opportunity to work with me, dr. Sicco Verwer and dr. Fabian Mies at Delft University of Technology!

Application deadline: 31 August 2025

https://careers.tudelft.nl/job/Delft-PhD-Position-Symbolic-AI-and-Reasoning-Under-Uncertainty-2628-CD/824585702/

#AcademicJobs
#AcademicMastodon
#GetFediHired
#AcademicJob
#SymbolicAI
#Statistics
#AI
#ConstraintProgramming
#CombinatorialOptimisation
#SensitivityAnalysis
#FormalMethods
#CombinatorialOptimization
#Delft
#TUDelft
#AcademicChatter

PhD Position Symbolic AI and Reasoning Under Uncertainty

PhD Position Symbolic AI and Reasoning Under Uncertainty

One month left to apply!

If you are looking for a PhD position and are interested in working on probabilistic inference, sensitivity analysis, and decision-making, this might be the job for you! We are looking for candidates with a strong background in Computer Science, and ideally also in Mathematics.

Please apply by 31 August. We're looking forward to reading your application!

https://careers.tudelft.nl/job/Delft-PhD-Position-Symbolic-AI-and-Reasoning-Under-Uncertainty-2628-CD/824585702/

#AcademicJobs
#AcademicMastodon
#GetFediHired
#AcademicJob
#SymbolicAI
#Statistics
#AI
#ConstraintProgramming
#CombinatorialOptimisation
#SensitivityAnalysis
#FormalMethods
#CombinatorialOptimization
#Delft
#TUDelft
#AcademicChatter

PhD Position Symbolic AI and Reasoning Under Uncertainty

PhD Position Symbolic AI and Reasoning Under Uncertainty

PhD Position Symbolic AI and Reasoning Under Uncertainty

PhD Position Symbolic AI and Reasoning Under Uncertainty

Postdoc in Applied Planning and Scheduling under Uncertainty

Postdoc in Applied Planning and Scheduling under Uncertainty

๐Ÿ‘‹#call4reading

โœ๏ธA benchmark for #quantum optimization: the #traveling salesman #by Richard H. Warren

๐Ÿ”—10.26421/QIC21.7-8-2

#quantumcomputing #combinatorialoptimization

๐Ÿš€ Exciting update! My Network Algorithms and Approximations course continues with Lessons 2, 3 & 4 now available! ๐ŸŽ‰

๐Ÿ“Œ Topics covered:
โœ… Submodular (Set) Cover โ€“ Greedy log-approximation & Group Steiner Tree
โœ… Maximum Coverage โ€“ 1 - 1/e approx, LP relaxations & budgeted coverage
โœ… Unique Coverage โ€“ Log(n)-approximation, NP-hardness & max-cut ties

๐Ÿ”— Watch now:
โ–ถ๏ธ Lesson 2: https://youtu.be/xi6P3bqy61g
โ–ถ๏ธ Lesson 3: https://youtu.be/jC44JdD74Hw
โ–ถ๏ธ Lesson 4: https://youtu.be/ypzFnl0Wfp4

๐Ÿ“… New lectures premiere every Wednesday at 7PM ET!
๐Ÿ“บ Full playlist: https://www.youtube.com/playlist?list=PLx7SjCaKZzEIeJxOlTuXveAE5eY7WOYB9

๐Ÿ”” Subscribe for more: https://www.youtube.com/@hajiaghayi

#Optimization #Algorithms #NetworkDesign #CombinatorialOptimization #MachineLearning #GraphTheory #SetCover #ApproximationAlgorithms

Lesson 2: Network Algorithms and Approximations by Mohammad Hajiaghayi: Submodular (Set) Cover

YouTube

2/n Very much like this visualisation presented by Frank Phillipson (based on a fig from Caceres-Cruz et al., 2014) of solvers for optimisation problems. Might try to use this or something like it in the course on algorithm for NP-hard problems that I am involved in.

#Algorithms #Algorithmics #CombinatorialOptimisation #CombinatorialOptimization #Optimisation #Optimization #SIGAlgo #SIGAlgo24 #ComputerScience