---

name: creative-thinking-for-research description: Applies cognitive science frameworks for creative thinking to CS and AI research ideation. Use when seeking genuinely novel research directions by leveraging combinatorial creativity, analogical reasoning, constraint manipulation, and other empirically grounded creative strategies. version: 1.0.0 author: Orchestra Research license: MIT tags: [Creative Thinking, Research Ideation, Analogical Reasoning, Problem Reformulation, Cognitive Science] dependencies: []

Creative Thinking for Research

Eight empirically grounded frameworks from cognitive science, applied to computer science and AI research. Unlike ad-hoc brainstorming, each framework here is backed by decades of creativity research — from Koestler's bisociation to Kauffman's adjacent possible. They target distinct cognitive operations: combining, reformulating, analogizing, constraining, inverting, abstracting, exploring boundaries, and holding contradictions.

When to Use This Skill

• Generating genuinely novel ideas, not incremental extensions of prior work
• Feeling trapped in a local optimum of thinking within a single subfield
• Wanting to systematically apply creativity heuristics rather than waiting for inspiration
• Preparing for a research retreat or PhD-level ideation session
• Bridging between fields and seeking structural (not superficial) connections

Do NOT use this skill when:

• You need structured project-level brainstorming workflows (use brainstorming-research-ideas)
• You have a well-defined problem and need execution help (use domain-specific skills)
• You need a literature survey (use scientific-skills:literature-review)

Relationship to Brainstorm skill: The brainstorm skill provides operational workflows (diverge → converge → refine) and practical filters. This skill provides the deeper cognitive engines that power creative leaps. Use them together: creative-thinking to generate raw insight, brainstorm to structure and evaluate it.

---

Framework 1: Combinatorial Creativity (Bisociation)

Novel ideas arise from combining existing concepts in unexpected ways. Arthur Koestler called this bisociation — connecting two previously unrelated frames of reference, as distinct from routine association within a single frame.

Why it works: Meta-research consistently shows that breadth of knowledge is a precursor to creative output. People who read across disciplines produce more novel work. The combination itself is the creative act.

In CS Research:

• Biological evolution → optimization (genetic algorithms)
• Game theory → networking (mechanism design for routing)
• Statistical physics → machine learning (Boltzmann machines, energy-based models)
• Linguistics → programming (type theory, formal grammars)

Systematic Bisociation Workflow:

1. Select two domains you have at least passing familiarity with
2. List core primitives in each domain (5-10 fundamental concepts per domain)
3. Create a cross-product matrix: row = concepts from Domain A, column = concepts from Domain B
4. For each cell, ask: "What would it mean to apply A's concept to B's problem?"
5. Filter: Which combinations produce a non-trivial, testable research question?
6. Validate structural depth: Is the connection mechanistic or merely metaphorical?

Cross-Product Example:

| | Caching | Load Balancing | Fault Tolerance | |---|---------|---------------|-----------------| | Natural Selection | Evict least-fit entries | Adaptive allocation via fitness | Population-level redundancy | | Immune Memory | Learned threat signatures | Distributed detection | Self/non-self discrimination | | Symbiosis | Cooperative prefetching | Mutualistic resource sharing | Co-dependent resilience |

Quality Test: A strong bisociation is not a surface metaphor ("the network is like a brain") but a structural mapping where the mechanism transfers ("attention mechanisms implement a form of selective gating analogous to cognitive attention filtering").

Self-Check:

• [ ] Is the connection structural (mechanisms map) or merely verbal (labels map)?
• [ ] Does the combination generate testable predictions?
• [ ] Would an expert in both fields find the connection non-obvious but sound?

---

Framework 2: Problem Reformulation (Representational Change)

Gestalt psychologists identified that breakthroughs often come not from solving the problem as stated, but from re-representing the problem itself. Kaplan and Simon's work on insight shows that changing the problem space — the constraints, the abstraction level, the formalism — is often where creativity lives.

The Key Shift: From "How do I solve this problem?" to "Am I even thinking about this problem correctly?"

Reformulation Strategies:

| Strategy | Example | |----------|---------| | Change the objective | "Make the algorithm faster" → "Eliminate the need for this computation" | | Change the formalism | Graph problem → linear algebra problem (spectral methods) | | Change the granularity | Per-token prediction → per-span prediction | | Change the agent | "How should the model learn?" → "How should the data teach?" (curriculum learning) | | Change the timescale | Real-time optimization → amortized inference | | Invert the direction | Forward simulation → inverse problem (learning from observations) |

Workflow:

1. State your current problem in one sentence
2. Identify the hidden assumptions in that statement:
   • What formalism are you using? (Could you use a different one?)
   • What is the objective? (Is it the right objective?)
   • What level of granularity? (Could you go coarser or finer?)
   • Who is the agent? (Could you shift perspective?)
3. For each assumption, generate the alternative: "What if [opposite assumption]?"
4. For each alternative, ask: "Does this reformulation make the problem easier, harder, or different in a useful way?"
5. A reformulation that makes a hard problem easy is often a publishable insight on its own

Classic CS Examples:

• PageRank: Reformulated "find important web pages" from content analysis to graph eigenvalue problem
• Dropout: Reformulated "prevent overfitting" from regularization to approximate ensemble
• Attention: Reformulated "handle long sequences" from remembering everything to selectively querying

---

Framework 3: Analogical Reasoning (Structure-Mapping)

Dedre Gentner's structure-mapping theory and Kevin Dunbar's studies of real scientists show that analogy is the core engine of scientific creativity. The critical finding: surface-level analogies are common but weak; structural or relational analogies — where the deep causal/relational structure maps across domains — produce the most powerful insights.

Dunbar's Finding: In the most successful labs, analogies from distant domains drove the most important discoveries. Nearby analogies refined ideas; distant analogies generated them.

Levels of Analogical Depth:

| Level | Description | Value | Example | |-------|-------------|-------|---------| | Surface | Things look similar | Low | "A neural network is like a brain" | | Relational | Relationships between entities match | Medium | "Attention allocation in models parallels resource allocation in economics" | | Structural | Deep causal mechanisms map | High | "Diffusion models reverse a thermodynamic process; the math of non-equilibrium stat-mech directly applies" |

Structure-Mapping Workflow:

1. Describe your problem using only relational/causal language (strip domain-specific nouns)
   • Bad: "We need to improve transformer attention efficiency"
   • Good: "We have a system that must selectively aggregate information from a large set, where relevance is context-dependent and the cost scales quadratically with set size"
2. Search for structural matches: What other systems selectively aggregate from large sets?
   • Database query optimization, visual attention in neuroscience, information retrieval, resource allocation
3. Pick the most distant match with genuine structural fidelity
4. Map the solution mechanism: How does the source domain solve this?
5. Transfer and adapt: What changes when you bring that mechanism into your domain?
6. Generate predictions: The analogy should tell you something you didn't already know

Validation Checklist:

• [ ] Does the mapping preserve causal/relational structure (not just labels)?
• [ ] Can I identify at least one prediction the analogy makes in my domain?
• [ ] Would an expert in the source domain confirm the mechanism is correctly understood?
• [ ] Is the analogy non-obvious to my target audience?

---

Framework 4: Constraint Manipulation (Boden's Framework)

Margaret Boden's framework distinguishes three forms of creativity based on how they interact with constraints:

| Type | Operation | CS Example | |------|-----------|------------| | Exploratory | Search within the existing conceptual space | Hyperparameter tuning, architecture search within a fixed paradigm | | Combinational | Combine elements from different spaces | Multi-task learning, neuro-symbolic methods | | Transformational | Change the rules of the space itself | Dropping the assumption that training requires labels (self-supervised learning) |

Transformational creativity is the rarest and highest-impact. It happens when you change what is even considered a valid solution.

Constraint Analysis Workflow:

1. List the constraints of your current approach (5-10 constraints):
   • Computational: "Must fit in GPU memory"
   • Methodological: "Requires labeled data"
   • Architectural: "Uses fixed-length context"
   • Evaluative: "Measured by accuracy on benchmark X"
2. Classify each constraint:
   • Hard: Physically or logically necessary (cannot violate)
   • Soft: Convention or historical accident (can question)
   • Hidden: Not stated but implicitly assumed (most fertile for innovation)
3. For each soft/hidden constraint, ask:
   • What if we relaxed it? (streaming algorithms from relaxing "fits in memory")
   • What if we tightened it? (efficiency research from tightening compute budgets)
   • What if we replaced it with a different constraint entirely?
4. The most productive move is often exposing and dropping a hidden constraint

Classic Examples of Constraint Transformation:

• "Data must fit in memory" → dropped → streaming algorithms, external memory
• "Training requires human labels" → dropped → self-supervised learning
• "Models must be deterministic" → dropped → variational methods, diffusion
• "Inference must happen in one pass" → dropped → iterative refinement, chain-of-thought

---

Framework 5: Negation and Inversion

Take a core assumption in your field and negate it. This is formalized in De Bono's lateral thinking and the TRIZ methodology from engineering.

The Pattern: "What if [widely held assumption] is wrong, unnecessary, or invertible?"

Systematic Negation Workflow:

1. List 5-10 core assumptions in your subfield (the things "everyone knows")
2. Negate each one and ask: What system would you build?
3. Evaluate each negation:
   • Incoherent → discard
   • Already explored → check if conditions have changed (see brainstorm skill, Framework 5)
   • Unexplored and coherent → potential research direction

Negation Hall of Fame in CS:

| Assumption | Negation | Result | |-----------|----------|--------| | "We need strong consistency" | What if we don't? | Eventual consistency, CRDTs | | "We need exact answers" | What if approximate is fine? | Sketches, LSH, approximate nearest neighbors | | "Labels are necessary" | What if we learn without them? | Self-supervised learning, contrastive methods | | "More parameters = more compute" | What if we don't use all parameters? | Mixture of Experts, spa