Intermediate
The 3-Sentence Epic
Condense a complex narrative into its purest form without losing the plot.
Take a well-known fairy tale or a classic myth and rewrite it using exactly three sentences. Your goal is to optimize the story structure by removing all fluff while ensuring the beginning, middle, climax, and resolution are still clearly understood. Focus on impactful word choice to convey the maximum emotional weight.
Beginner
The Capsule Collection
Create a functional wardrobe from a minimal set of items.
Imagine you are going on a month-long trip that requires attire for a business conference, a formal dinner, and a hiking excursion. You are only allowed to pack 5 items of clothing (excluding shoes and undergarments). List these 5 items and explain how you will mix and match them to optimize your look for every occasion without buying new clothes.
Advanced
The Zero-Waste Menu
Design a culinary experience that utilizes every ingredient purchased.
Design a 3-course dinner menu (appetizer, main, dessert) using exactly 10 whole ingredients. You must utilize every single ingredient across the three dishes—nothing can be left unused. Explain how the scraps or leftovers from one dish become the flavor base for another to optimize resource usage.
Intermediate
Musical Flow State
Arrange a tracklist to optimize energy and mood transitions.
Create a 10-song playlist designed to help someone get through a deep work session. The songs must flow seamlessly from one to the next, optimizing the listener's focus by gradually shifting from 'high energy' to 'deep flow' and ending with a 'cool down' phase. Explain the logic behind your track progression.
Beginner
The Infinite Meeting
Replace a corporate meeting with a highly efficient text update.
You have just attended a 60-minute meeting that could have been an email. Write a single email (under 200 words) that optimizes the communication process. It must clearly outline the decisions made, actions required, and deadlines, ensuring that no further clarification meetings are needed.
Intermediate
Room Tetris
Spatial reasoning challenge for a multi-purpose room.
You have a 10x10 foot empty room. You must fit in: a king-size bed, a standing desk, a bookshelf, and a yoga mat. Draw or describe in text the layout of the room that optimizes space efficiency while ensuring there is enough clearance to walk around and actually use the yoga mat.
Advanced
The 80/20 Skill Plan
Apply the Pareto Principle to learning a new hobby.
Choose a complex skill you want to learn (e.g., coding, playing guitar, speaking Japanese). Identify the 20% of the core concepts or chords that will give you 80% of the practical ability. Create a 7-day learning schedule focused exclusively on those core elements to optimize your progress from zero to functional.
Beginner
The Scenic Algorithm
Route planning focused on beauty rather than speed.
Plan a walking route between point A (your home) and point B (a local landmark) that is optimized for joy rather than speed. List the specific turns and landmarks you would pass. The route must be visually interesting or peaceful, and it can take up to 3 times longer than the fastest path.
Intermediate
Convexity and Global Optima
Analyze the relationship between function convexity and the existence of global minima.
Explain why any local minimum of a convex function defined on a convex set is also a global minimum. Provide a theoretical justification using the definition of convexity and the properties of the first and second derivatives. Discuss the implications of strict convexity regarding the uniqueness of the optimal solution.
Advanced
Primal-Dual Gap Analysis
Explore the concept of the duality gap in constrained optimization.
Define the Primal and Dual problems in the context of Lagrangian relaxation. Explain what the duality gap represents and under what conditions it becomes zero (strong duality). Discuss Slater's condition and its role in guaranteeing strong duality for convex optimization problems.
Advanced
Interpreting Complementary Slackness
Deep dive into the complementary slackness condition of the KKT theorem.
Provide a detailed theoretical interpretation of the complementary slackness condition found within the Karush-Kuhn-Tucker (KKT) conditions. Explain how this condition mathematically describes the relationship between the optimal primal variables and the dual variables (Lagrange multipliers) at the boundary of the feasible set.
Intermediate
Convergence Rates of Gradient Descent
Compare the theoretical convergence speeds of gradient descent under different assumptions.
Compare and contrast the theoretical convergence rates of the Gradient Descent algorithm for three distinct scenarios: 1) Lipschitz continuous gradients (general convex), 2) Strongly convex functions (linear convergence), and 3) Non-convex functions (critical point convergence). Explain how the condition number of the Hessian matrix affects the speed of convergence.
Beginner
Implications of No-Free Lunch
Discuss the theoretical limitations of optimization algorithms.
Explain the No-Free Lunch (NFL) theorem in the context of optimization and search algorithms. Discuss the theoretical implication that no single optimization algorithm is superior to all others when averaged over all possible cost functions. How does this theorem influence the selection of algorithms for specific real-world problems?
Advanced
Newton's Method and Quadratic Convergence
Analyze the theoretical basis for the speed of Newton's Method.
Describe the theoretical justification for the quadratic convergence rate of Newton's Method near a local minimum. Explain the role of the Hessian matrix (second-order information) in achieving this rate compared to the linear convergence of first-order methods. Discuss the specific conditions required for Newton's Method to converge quadratically.
Intermediate
Complexity Classes in Optimization
Classify optimization problems based on computational complexity.
Differentiate between optimization problems that fall into the complexity classes P, NP, and NP-Complete. Provide examples of problems that fit into each category (e.g., Linear Programming in P, Traveling Salesman Problem in NP-Hard). Discuss the theoretical significance of polynomial-time solvability in optimization.