dspy 0.28.1 → 0.29.0

data/lib/gepa/strategies/batch_sampler.rb

@@ -0,0 +1,91 @@
+# frozen_string_literal: true
+
+require 'sorbet-runtime'
+
+module GEPA
+  module Strategies
+    class EpochShuffledBatchSampler
+      extend T::Sig
+
+      sig { params(minibatch_size: Integer, rng: T.nilable(Random), telemetry: T.nilable(T.untyped)).void }
+      def initialize(minibatch_size, rng: nil, telemetry: nil)
+        @minibatch_size = minibatch_size
+        @rng = rng || Random.new(0)
+        @telemetry = telemetry
+        @shuffled_ids = []
+        @epoch = -1
+        @id_freqs = Hash.new(0)
+      end
+
+      sig { params(trainset_size: Integer, iteration: Integer).returns(T::Array[Integer]) }
+      def next_minibatch_indices(trainset_size, iteration)
+        with_span(
+          'gepa.strategies.batch_sampler',
+          minibatch_size: @minibatch_size,
+          trainset_size: trainset_size,
+          iteration: iteration
+        ) do
+          ensure_epoch(trainset_size, iteration)
+          base_idx = (iteration * @minibatch_size) % @shuffled_ids.length
+          end_idx = base_idx + @minibatch_size
+          @shuffled_ids[base_idx...end_idx]
+        end
+      end
+
+      private
+
+      sig { returns(T.untyped) }
+      def telemetry
+        @telemetry || GEPA::Telemetry
+      end
+
+      sig { params(trainset_size: Integer, iteration: Integer).void }
+      def ensure_epoch(trainset_size, iteration)
+        update_shuffled(trainset_size) if @shuffled_ids.empty?
+
+        curr_epoch = if @epoch == -1
+          0
+        else
+          (iteration * @minibatch_size) / [@shuffled_ids.length, 1].max
+        end
+
+        return unless curr_epoch > @epoch
+
+        @epoch = curr_epoch
+        update_shuffled(trainset_size)
+      end
+
+      sig { params(trainset_size: Integer).void }
+      def update_shuffled(trainset_size)
+        @shuffled_ids = Array.new(trainset_size) { |idx| idx }
+        @shuffled_ids = @shuffled_ids.shuffle(random: @rng)
+
+        @shuffled_ids.each { |idx| @id_freqs[idx] += 1 }
+
+        remainder = trainset_size % @minibatch_size
+        num_to_pad = remainder.zero? ? 0 : (@minibatch_size - remainder)
+
+        num_to_pad.times do
+          least_used = @id_freqs.min_by { |_idx, count| count }&.first || 0
+          @shuffled_ids << least_used
+          @id_freqs[least_used] += 1
+        end
+
+        raise ArgumentError, 'minibatch size must be positive' if @minibatch_size <= 0
+        raise 'shuffled ids shorter than minibatch size' if @shuffled_ids.length < @minibatch_size
+        raise 'shuffled ids not aligned to minibatch size' unless (@shuffled_ids.length % @minibatch_size).zero?
+      end
+
+      sig do
+        params(
+          operation: String,
+          attrs: T::Hash[Symbol, T.untyped],
+          block: T.proc.returns(T.untyped)
+        ).returns(T.untyped)
+      end
+      def with_span(operation, attrs = {}, &block)
+        telemetry.with_span(operation, attrs, &block)
+      end
+    end
+  end
+end

data/lib/gepa/strategies/candidate_selector.rb

@@ -0,0 +1,97 @@
+# frozen_string_literal: true
+
+require 'sorbet-runtime'
+
+module GEPA
+  module Strategies
+    class ParetoCandidateSelector
+      extend T::Sig
+
+      sig { params(rng: T.nilable(Random), telemetry: T.nilable(T.untyped)).void }
+      def initialize(rng: nil, telemetry: nil)
+        @rng = rng || Random.new(0)
+        @telemetry = telemetry
+      end
+
+      sig { params(state: GEPA::Core::State).returns(Integer) }
+      def select_candidate_idx(state)
+        ensure_lengths!(state)
+        with_span('gepa.strategies.candidate_selector', strategy: 'pareto') do
+          scores = state.per_program_tracked_scores.each_with_index.to_h { |score, idx| [idx, score] }
+          GEPA::Utils::Pareto.select_program_candidate_from_pareto_front(
+            state.program_at_pareto_front_valset,
+            scores,
+            @rng
+          )
+        end
+      end
+
+      private
+
+      sig { params(state: GEPA::Core::State).void }
+      def ensure_lengths!(state)
+        return if state.per_program_tracked_scores.length == state.program_candidates.length
+
+        raise ArgumentError, 'per_program_tracked_scores and program_candidates length mismatch'
+      end
+
+      sig { returns(T.untyped) }
+      def telemetry
+        @telemetry || GEPA::Telemetry
+      end
+
+      sig do
+        params(
+          operation: String,
+          attrs: T::Hash[Symbol, T.untyped],
+          block: T.proc.returns(T.untyped)
+        ).returns(T.untyped)
+      end
+      def with_span(operation, attrs = {}, &block)
+        telemetry.with_span(operation, attrs, &block)
+      end
+    end
+
+    class CurrentBestCandidateSelector
+      extend T::Sig
+
+      sig { params(telemetry: T.nilable(T.untyped)).void }
+      def initialize(telemetry: nil)
+        @telemetry = telemetry
+      end
+
+      sig { params(state: GEPA::Core::State).returns(Integer) }
+      def select_candidate_idx(state)
+        ensure_lengths!(state)
+        with_span('gepa.strategies.candidate_selector', strategy: 'current_best') do
+          GEPA::Utils::Pareto.idxmax(state.per_program_tracked_scores)
+        end
+      end
+
+      private
+
+      sig { params(state: GEPA::Core::State).void }
+      def ensure_lengths!(state)
+        return if state.per_program_tracked_scores.length == state.program_candidates.length
+
+        raise ArgumentError, 'per_program_tracked_scores and program_candidates length mismatch'
+      end
+
+      sig { returns(T.untyped) }
+      def telemetry
+        @telemetry || GEPA::Telemetry
+      end
+
+      sig do
+        params(
+          operation: String,
+          attrs: T::Hash[Symbol, T.untyped],
+          block: T.proc.returns(T.untyped)
+        ).returns(T.untyped)
+      end
+      def with_span(operation, attrs = {}, &block)
+        telemetry.with_span(operation, attrs, &block)
+      end
+    end
+  end
+end

data/lib/gepa/strategies/component_selector.rb

@@ -0,0 +1,57 @@
+# frozen_string_literal: true
+
+require 'sorbet-runtime'
+
+module GEPA
+  module Strategies
+    class RoundRobinReflectionComponentSelector
+      extend T::Sig
+
+      sig { params(telemetry: T.nilable(T.untyped)).void }
+      def initialize(telemetry: nil)
+        @telemetry = telemetry
+      end
+
+      sig do
+        params(
+          state: GEPA::Core::State,
+          trajectories: T::Array[T.untyped],
+          subsample_scores: T::Array[Float],
+          candidate_idx: Integer,
+          candidate: T::Hash[String, String]
+        ).returns(T::Array[String])
+      end
+      def select_modules(state, trajectories, subsample_scores, candidate_idx, candidate)
+        with_span(
+          'gepa.strategies.component_selector',
+          strategy: 'round_robin',
+          candidate_idx: candidate_idx
+        ) do
+          predictor_id = state.named_predictor_id_to_update_next_for_program_candidate[candidate_idx]
+          state.named_predictor_id_to_update_next_for_program_candidate[candidate_idx] =
+            (predictor_id + 1) % state.list_of_named_predictors.length
+
+          [state.list_of_named_predictors[predictor_id]]
+        end
+      end
+
+      private
+
+      sig { returns(T.untyped) }
+      def telemetry
+        @telemetry || GEPA::Telemetry
+      end
+
+      sig do
+        params(
+          operation: String,
+          attrs: T::Hash[Symbol, T.untyped],
+          block: T.proc.returns(T.untyped)
+        ).returns(T.untyped)
+      end
+      def with_span(operation, attrs, &block)
+        telemetry.with_span(operation, attrs, &block)
+      end
+    end
+  end
+end

data/lib/gepa/strategies/instruction_proposal.rb

@@ -0,0 +1,120 @@
+# frozen_string_literal: true
+
+require 'sorbet-runtime'
+
+module GEPA
+  module Strategies
+    class InstructionProposalSignature
+      extend T::Sig
+
+      PROMPT_TEMPLATE = <<~PROMPT
+        I provided an assistant with the following instructions to perform a task for me:
+        ```
+        <curr_instructions>
+        ```
+
+        The following are examples of different task inputs provided to the assistant along with the assistant's response for each of them, and some feedback on how the assistant's response could be better:
+        ```
+        <inputs_outputs_feedback>
+        ```
+
+        Your task is to write a new instruction for the assistant.
+
+        Read the inputs carefully and identify the input format and infer detailed task description about the task I wish to solve with the assistant.
+
+        Read all the assistant responses and the corresponding feedback. Identify all niche and domain specific factual information about the task and include it in the instruction, as a lot of it may not be available to the assistant in the future. The assistant may have utilized a generalizable strategy to solve the task, if so, include that in the instruction as well.
+
+        Provide the new instructions within ``` blocks.
+      PROMPT
+
+      sig { returns(T::Array[String]) }
+      def self.input_keys
+        %w[current_instruction_doc dataset_with_feedback]
+      end
+
+      sig { returns(T::Array[String]) }
+      def self.output_keys
+        %w[new_instruction]
+      end
+
+      sig { params(input: T::Hash[String, T.untyped]).returns(String) }
+      def self.prompt_renderer(input)
+        prompt = PROMPT_TEMPLATE.dup
+        prompt = prompt.sub('<curr_instructions>', input.fetch('current_instruction_doc', ''))
+        prompt.sub('<inputs_outputs_feedback>', render_samples(input.fetch('dataset_with_feedback', [])))
+      end
+
+      sig { params(output: String).returns(T::Hash[String, String]) }
+      def self.output_extractor(output)
+        stripped = output.to_s.strip
+        return { 'new_instruction' => stripped } if stripped.count('```') < 2
+
+        first = stripped.index('```')
+        last = stripped.rindex('```')
+        if first.nil? || last.nil? || first == last
+          { 'new_instruction' => stripped.delete_prefix('```').delete_suffix('```').strip }
+        else
+          inner = stripped[(first + 3)...last].strip
+          { 'new_instruction' => inner.empty? ? stripped : inner }
+        end
+      end
+
+      sig do
+        params(
+          lm: T.untyped,
+          input_dict: T::Hash[String, T.untyped]
+        ).returns(T::Hash[String, String])
+      end
+      def self.run(lm, input_dict)
+        prompt = prompt_renderer(input_dict)
+        raw_output = if lm.respond_to?(:call)
+          lm.call(prompt)
+        else
+          response = lm.raw_chat([{ role: 'user', content: prompt }])
+          response.respond_to?(:content) ? response.content : response
+        end
+
+        output_extractor(raw_output.to_s)
+      end
+
+      class << self
+        extend T::Sig
+        private
+
+        sig { params(samples: T::Array[T.untyped]).returns(String) }
+        def render_samples(samples)
+          samples.each_with_index.map do |sample, index|
+            convert_sample_to_markdown(sample, index + 1)
+          end.join("\n\n")
+        end
+
+        sig { params(sample: T.untyped, index: Integer).returns(String) }
+        def convert_sample_to_markdown(sample, index)
+          return '' unless sample.is_a?(Hash)
+
+          sample.map do |key, value|
+            "## Example #{index}\n### #{key}\n#{render_value(value, 4)}"
+          end.join
+        end
+
+        sig { params(value: T.untyped, level: Integer).returns(String) }
+        def render_value(value, level)
+          case value
+          when Hash
+            value.map do |key, val|
+              heading = '#' * [level, 6].min
+              "#{heading} #{key}\n#{render_value(val, level + 1)}"
+            end.join
+          when Array
+            value.each_with_index.map do |item, idx|
+              heading = '#' * [level, 6].min
+              "#{heading} Item #{idx + 1}\n#{render_value(item, level + 1)}"
+            end.join
+          else
+            "#{value}\n\n"
+          end
+        end
+      end
+    end
+  end
+end

data/lib/gepa/telemetry.rb

@@ -0,0 +1,122 @@
+# frozen_string_literal: true
+
+require 'securerandom'
+require 'sorbet-runtime'
+require 'dspy'
+
+module GEPA
+  # Telemetry helpers for the GEPA optimizer.
+  #
+  # The helpers wrap DSPy context spans and structured logs so that the GEPA
+  # port can attach observability data consistently across the optimization
+  # lifecycle. They mirror the phases from the Python sequence diagrams:
+  #
+  # - `gepa.optimize` (API entry)
+  # - `gepa.state.initialize`
+  # - `gepa.engine.run` / `gepa.engine.iteration`
+  # - `gepa.proposer.*` (selection, evaluation, reflection, acceptance)
+  #
+  # Later phases of the port can depend on these helpers without reimplementing
+  # span naming or default attributes.
+  module Telemetry
+    extend T::Sig
+
+    DEFAULT_ATTRIBUTES = T.let({
+      optimizer: 'GEPA',
+      'gepa.instrumentation_version': 'phase0',
+      'langfuse.observation.type': 'span'
+    }.freeze, T::Hash[Symbol, T.untyped])
+
+    class Context < T::Struct
+      extend T::Sig
+
+      const :run_id, String
+      const :attributes, T::Hash[Symbol, T.untyped]
+
+      sig do
+        params(
+          operation: String,
+          metadata: T::Hash[T.any(String, Symbol), T.untyped],
+          block: T.proc.returns(T.untyped)
+        ).returns(T.untyped)
+      end
+      def with_span(operation, metadata = {}, &block)
+        Telemetry.with_span(operation, base_attributes.merge(Telemetry.send(:symbolize, metadata)), &block)
+      end
+
+      sig do
+        params(
+          event_name: String,
+          metadata: T::Hash[T.any(String, Symbol), T.untyped]
+        ).void
+      end
+      def emit(event_name, metadata = {})
+        Telemetry.emit(event_name, base_attributes.merge(Telemetry.send(:symbolize, metadata)))
+      end
+
+      private
+
+      sig { returns(T::Hash[Symbol, T.untyped]) }
+      def base_attributes
+        attributes.merge(run_id: run_id)
+      end
+    end
+
+    sig do
+      params(
+        additional_attributes: T::Hash[T.any(String, Symbol), T.untyped]
+      ).returns(Context)
+    end
+    def self.build_context(additional_attributes = {})
+      attributes = DEFAULT_ATTRIBUTES.merge(symbolize(additional_attributes.dup))
+      run_id = attributes.delete(:run_id) || SecureRandom.uuid
+
+      Context.new(run_id: run_id, attributes: attributes)
+    end
+
+    sig do
+      params(
+        operation: String,
+        attributes: T::Hash[T.any(String, Symbol), T.untyped],
+        block: T.proc.returns(T.untyped)
+      ).returns(T.untyped)
+    end
+    def self.with_span(operation, attributes = {}, &block)
+      operation_name = normalize_operation(operation)
+      span_attributes = DEFAULT_ATTRIBUTES.merge(symbolize(attributes))
+
+      DSPy::Context.with_span(operation: operation_name, **span_attributes, &block)
+    end
+
+    sig do
+      params(
+        event_name: String,
+        attributes: T::Hash[T.any(String, Symbol), T.untyped]
+      ).void
+    end
+    def self.emit(event_name, attributes = {})
+      payload = DEFAULT_ATTRIBUTES.merge(symbolize(attributes))
+      DSPy.log("gepa.#{event_name}", **payload)
+    end
+
+    sig { params(operation: String).returns(String) }
+    def self.normalize_operation(operation)
+      return operation if operation.start_with?('gepa.')
+
+      "gepa.#{operation}"
+    end
+    private_class_method :normalize_operation
+
+    sig do
+      params(
+        attributes: T::Hash[T.any(String, Symbol), T.untyped]
+      ).returns(T::Hash[Symbol, T.untyped])
+    end
+    def self.symbolize(attributes)
+      attributes.each_with_object({}) do |(key, value), acc|
+        acc[key.to_sym] = value
+      end
+    end
+    private_class_method :symbolize
+  end
+end

data/lib/gepa/utils/pareto.rb

@@ -0,0 +1,119 @@
+# frozen_string_literal: true
+
+require 'json'
+require 'set'
+require 'sorbet-runtime'
+
+module GEPA
+  module Utils
+    module Pareto
+      extend T::Sig
+
+      sig { params(value: T.untyped).returns(T.untyped) }
+      def self.json_default(value)
+        value.is_a?(Hash) ? value.transform_keys(&:to_s) : JSON.parse(value.to_json)
+      rescue StandardError
+        { value: value.to_s }
+      end
+
+      sig { params(values: T::Array[Float]).returns(Integer) }
+      def self.idxmax(values)
+        raise ArgumentError, 'values must not be empty' if values.empty?
+
+        values.each_with_index.max_by { |score, _i| score }&.last || 0
+      end
+
+      sig do
+        params(
+          program_at_pareto_front_valset: T::Array[T.untyped],
+          scores: T.nilable(T::Hash[Integer, Float])
+        ).returns(T::Array[T.untyped])
+      end
+      def self.remove_dominated_programs(program_at_pareto_front_valset, scores: nil)
+        normalized_fronts = program_at_pareto_front_valset.map { |front| front.to_a }
+
+        frequency = Hash.new(0)
+        normalized_fronts.each do |front|
+          front.each { |program_idx| frequency[program_idx] += 1 }
+        end
+
+        all_programs = frequency.keys
+        scores ||= all_programs.to_h { |idx| [idx, 1.0] }
+
+        sorted_programs = all_programs.sort_by { |idx| scores.fetch(idx, 0.0) }
+
+        dominated = Set.new
+        loop do
+          found = false
+          sorted_programs.each do |candidate|
+            next if dominated.include?(candidate)
+            next unless dominated?(candidate, sorted_programs.to_set, dominated, normalized_fronts)
+
+            dominated.add(candidate)
+            found = true
+            break
+          end
+          break unless found
+        end
+
+        dominators = sorted_programs.reject { |idx| dominated.include?(idx) }
+        dominators_set = dominators.to_set
+
+        normalized_fronts.map do |front|
+          front.select { |idx| dominators_set.include?(idx) }
+        end
+      end
+
+      sig do
+        params(
+          pareto_front_programs: T::Array[T.untyped],
+          train_val_weighted_scores: T::Hash[Integer, Float]
+        ).returns(T::Array[Integer])
+      end
+      def self.find_dominator_programs(pareto_front_programs, train_val_weighted_scores)
+        cleaned_frontiers = remove_dominated_programs(pareto_front_programs, scores: train_val_weighted_scores)
+        cleaned_frontiers.flat_map(&:to_a).uniq
+      end
+
+      sig do
+        params(
+          pareto_front_programs: T::Array[T.untyped],
+          weighted_scores: T::Hash[Integer, Float],
+          rng: Random
+        ).returns(Integer)
+      end
+      def self.select_program_candidate_from_pareto_front(pareto_front_programs, weighted_scores, rng)
+        cleaned_frontiers = remove_dominated_programs(pareto_front_programs, scores: weighted_scores)
+        frequency = Hash.new(0)
+        cleaned_frontiers.each do |front|
+          front.each { |idx| frequency[idx] += 1 }
+        end
+        raise ArgumentError, 'pareto front is empty' if frequency.empty?
+
+        sampling_list = frequency.flat_map { |idx, freq| [idx] * freq }
+        sampling_list[rng.rand(sampling_list.length)]
+      end
+
+      class << self
+        extend T::Sig
+        private
+
+        sig do
+          params(
+            candidate: Integer,
+            program_set: Set,
+            dominated: Set,
+            pareto_fronts: T::Array[T::Array[Integer]]
+          ).returns(T::Boolean)
+        end
+        def dominated?(candidate, program_set, dominated, pareto_fronts)
+          candidate_fronts = pareto_fronts.select { |front| front.include?(candidate) }
+          candidate_fronts.all? do |front|
+            remaining = front.reject { |idx| idx == candidate || dominated.include?(idx) }
+            remaining.any? { |other| program_set.include?(other) }
+          end
+        end
+      end
+    end
+  end
+end

data/lib/gepa.rb

@@ -0,0 +1,21 @@
+# frozen_string_literal: true
+
+require_relative 'gepa/telemetry'
+require_relative 'gepa/logging'
+require_relative 'gepa/utils/pareto'
+require_relative 'gepa/strategies/batch_sampler'
+require_relative 'gepa/strategies/candidate_selector'
+require_relative 'gepa/strategies/component_selector'
+require_relative 'gepa/strategies/instruction_proposal'
+require_relative 'gepa/core/evaluation_batch'
+require_relative 'gepa/core/result'
+require_relative 'gepa/core/state'
+require_relative 'gepa/core/engine'
+require_relative 'gepa/proposer/base'
+require_relative 'gepa/proposer/reflective_mutation/base'
+require_relative 'gepa/proposer/reflective_mutation/reflective_mutation'
+require_relative 'gepa/proposer/merge_proposer'
+require_relative 'gepa/api'
+
+module GEPA
+end