File size: 14,330 Bytes
6c5f29f | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 | """Second-generation exact-small OracleMem stress distributions.
These generators are hand-shaped review fixtures. They keep the instances
small enough for exact search while making the heuristic failure semantic:
dense but incomplete notes compete with fuller representations, and scoped
corrections require update-aware candidates rather than stale broad memories.
"""
from __future__ import annotations
from typing import Callable, Dict, List, Mapping
import random
from .evaluate import CandidateMemory, OracleMemInstance
DistributionGeneratorV2 = Callable[..., OracleMemInstance]
MIN_QUERY_COUNT = 2
MAX_QUERY_COUNT = 4
MIN_UNITS_PER_QUERY = 2
MAX_UNITS_PER_QUERY = 4
def _bounded_count(value: int, *, minimum: int, maximum: int) -> int:
return max(minimum, min(int(value), maximum))
def _rng(seed: int, salt: int) -> random.Random:
return random.Random((int(seed) + 1) * 1_000_003 + salt)
def _candidate(
prefix: str,
exp: str,
variant: str,
representation_type: str,
cost: int,
coverage: Mapping[str, float],
time_index: int,
serialized: str,
*,
confidence: float = 1.0,
) -> CandidateMemory:
return CandidateMemory(
candidate_id=f"{prefix}:{exp}:{variant}",
experience_id=f"{prefix}:{exp}",
representation_type=representation_type,
serialized=serialized,
cost=cost,
coverage=coverage,
time_index=time_index,
generator="oraclemem.distributions_v2",
confidence=confidence,
)
def density_trap_v2(
seed: int,
*,
normal_count: int = 3,
update_count: int = 2,
) -> OracleMemInstance:
"""Dense hint memories lose to complete future-query evidence bundles.
Each experience is a future query with 2-4 semantic units. The cheap hint
is intentionally high-density because it records a query anchor, but it
omits the constraints/outcome needed to answer the query. Complete and
compound representations are larger, lower-density, and higher raw value
because they cover all evidence units.
"""
rng = _rng(seed, 101)
query_count = _bounded_count(normal_count + 1, minimum=MIN_QUERY_COUNT, maximum=MAX_QUERY_COUNT)
units_per_query = _bounded_count(
update_count + 1,
minimum=MIN_UNITS_PER_QUERY,
maximum=MAX_UNITS_PER_QUERY,
)
prefix = f"density_trap_v2_s{seed}"
roles = ("intent", "constraint", "outcome", "exception")
topics = ["meal", "hotel", "flight", "calendar", "budget", "client"]
rng.shuffle(topics)
candidates: List[CandidateMemory] = []
unit_weights: Dict[str, float] = {}
current_units: List[str] = []
for query_index in range(query_count):
topic = topics[query_index % len(topics)]
exp = f"future_query_{query_index}"
required_units = [
f"{prefix}:q{query_index}:{role}"
for role in roles[:units_per_query]
]
bridge_unit = f"{prefix}:q{query_index}:compound_bridge"
provenance_unit = f"{prefix}:q{query_index}:source_detail"
for role_index, unit in enumerate(required_units):
unit_weights[unit] = 1.05 - 0.05 * min(role_index, 3)
unit_weights[bridge_unit] = 0.65
unit_weights[provenance_unit] = 0.45
current_units.extend(required_units)
hint_coverage: Dict[str, float] = {required_units[0]: 1.0}
if len(required_units) > 1:
hint_coverage[required_units[1]] = 0.12
complete_coverage = {unit: 1.0 for unit in required_units}
compound_coverage = dict(complete_coverage)
compound_coverage[bridge_unit] = 1.0
raw_coverage = dict(compound_coverage)
raw_coverage[provenance_unit] = 1.0
candidates.extend(
[
_candidate(
prefix,
exp,
"cheap_hint",
"atomic_fact",
1,
hint_coverage,
query_index,
(
f"HINT {topic}: salient keyword for future query "
f"{query_index}, without the full constraint/outcome."
),
confidence=0.74,
),
_candidate(
prefix,
exp,
"complete_summary",
"summary",
max(3, units_per_query),
complete_coverage,
query_index,
(
f"COMPLETE {topic}: intent, constraints, and outcome "
f"needed by future query {query_index}."
),
),
_candidate(
prefix,
exp,
"compound_case",
"compound_evidence",
max(4, units_per_query + 1),
compound_coverage,
query_index,
(
f"COMPOUND {topic}: complete evidence plus the link "
"between the separate facts."
),
),
_candidate(
prefix,
exp,
"raw_complete",
"raw_span",
max(5, units_per_query + 2),
raw_coverage,
query_index,
(
f"RAW {topic}: full exchange preserving complete "
"evidence and source detail."
),
),
]
)
return OracleMemInstance(
instance_id=prefix,
candidates=candidates,
unit_weights=unit_weights,
seed=seed,
current_units=current_units,
)
def scope_shift_v2(
seed: int,
*,
normal_count: int = 3,
update_count: int = 2,
) -> OracleMemInstance:
"""Broad-vs-narrow scope conflicts with a current scoped correction.
The fixed core models five related memories: a general preference,
travel-only preference, conference-only exception, historical preference,
and current scoped correction. The exact no-tombstone optimum drops because
the only complete correction is tombstone-like, while density-only is lured
by broad or partial high-density memories and then keeps only the
invalidation half of the correction.
"""
rng = _rng(seed, 211)
prefix = f"scope_shift_v2_s{seed}"
subjects = ("lodging", "meals", "seating", "transport")
subject = subjects[rng.randrange(len(subjects))]
candidates: List[CandidateMemory] = []
general = f"{prefix}:{subject}:pref:general"
travel = f"{prefix}:{subject}:pref:travel_only"
conference = f"{prefix}:{subject}:pref:conference_exception"
stale = f"{prefix}:{subject}:stale:historical"
current = f"{prefix}:{subject}:current:conference_correction"
invalid = f"{prefix}:{subject}:invalid:historical_after_correction"
travel_scope = f"{prefix}:{subject}:scope:travel"
conference_scope = f"{prefix}:{subject}:scope:conference"
historical_scope = f"{prefix}:{subject}:scope:historical"
unit_weights: Dict[str, float] = {
general: 1.10,
travel: 1.20,
conference: 1.50,
stale: 0.20,
current: 2.00,
invalid: 3.00,
travel_scope: 0.60,
conference_scope: 0.80,
historical_scope: 0.30,
}
candidates.extend(
[
_candidate(
prefix,
"general_preference",
"broad_fact",
"atomic_fact",
1,
{general: 1.0},
0,
f"GENERAL {subject}: default preference outside special scopes.",
),
_candidate(
prefix,
"general_preference",
"scoped_general_summary",
"summary",
3,
{general: 1.0, travel_scope: 0.35, conference_scope: 0.35},
0,
f"GENERAL {subject}: default preference with scope boundaries.",
),
_candidate(
prefix,
"travel_only_preference",
"travel_hint",
"atomic_fact",
1,
{travel: 0.88},
1,
f"TRAVEL HINT {subject}: says there is a travel-specific preference.",
confidence=0.76,
),
_candidate(
prefix,
"travel_only_preference",
"travel_scoped_fact",
"summary",
2,
{travel: 1.0, travel_scope: 1.0},
1,
f"TRAVEL ONLY {subject}: narrow preference and explicit travel scope.",
),
_candidate(
prefix,
"conference_exception",
"conference_hint",
"atomic_fact",
1,
{conference: 0.85},
2,
f"CONFERENCE HINT {subject}: exception exists but scope is incomplete.",
confidence=0.72,
),
_candidate(
prefix,
"conference_exception",
"conference_scoped_exception",
"summary",
3,
{conference: 1.0, conference_scope: 1.0},
2,
f"CONFERENCE ONLY {subject}: exception with explicit conference scope.",
),
_candidate(
prefix,
"historical_preference",
"historical_broad_summary",
"summary",
1,
{general: 0.55, stale: 0.50, historical_scope: 0.25},
3,
f"HISTORICAL {subject}: old broad preference, not marked obsolete.",
confidence=0.68,
),
_candidate(
prefix,
"historical_preference",
"historical_raw",
"raw_span",
3,
{stale: 1.0, historical_scope: 1.0},
3,
f"RAW HISTORICAL {subject}: older preference before later correction.",
),
_candidate(
prefix,
"current_scoped_correction",
"current_fact_only",
"atomic_fact",
2,
{current: 1.0},
4,
f"CURRENT {subject}: corrected conference-scoped preference.",
),
_candidate(
prefix,
"current_scoped_correction",
"invalidate_historical",
"tombstone",
1,
{invalid: 1.0},
4,
f"TOMBSTONE {subject}: historical preference no longer applies.",
),
_candidate(
prefix,
"current_scoped_correction",
"compound_scoped_update",
"compound_update",
3,
{current: 1.0, invalid: 1.0, conference_scope: 1.0},
4,
(
f"UPDATE {subject}: historical preference is invalidated "
"and replaced only in conference scope."
),
),
_candidate(
prefix,
"current_scoped_correction",
"ambiguous_current_summary",
"summary",
3,
{current: 0.72, conference_scope: 0.70},
4,
(
f"SUMMARY {subject}: current correction but does not carry "
"the invalidation evidence."
),
),
]
)
# Keep the signature meaningful without changing the exact-small character:
# extra requested updates add low-weight scoped context, not new conflicts.
extra_context_count = max(0, _bounded_count(normal_count + update_count, minimum=3, maximum=5) - 4)
for offset in range(extra_context_count):
unit = f"{prefix}:{subject}:context:routine_{offset}"
unit_weights[unit] = 0.25
candidates.append(
_candidate(
prefix,
f"routine_context_{offset}",
"context_note",
"summary",
2,
{unit: 1.0, general: 0.20},
5 + offset,
f"ROUTINE CONTEXT {subject}: ancillary scope detail {offset}.",
)
)
return OracleMemInstance(
instance_id=prefix,
candidates=candidates,
unit_weights=unit_weights,
seed=seed,
current_units=(travel, conference, current),
invalidation_units=(invalid,),
stale_units=(stale,),
)
DISTRIBUTIONS_V2: Dict[str, DistributionGeneratorV2] = {
"density_trap_v2": density_trap_v2,
"scope_shift_v2": scope_shift_v2,
}
def generate_distribution_v2(
name: str,
seed: int,
normal_count: int = 3,
update_count: int = 2,
) -> OracleMemInstance:
"""Generate a named deterministic v2 exact-small distribution instance."""
normalized = name.strip().lower()
try:
generator = DISTRIBUTIONS_V2[normalized]
except KeyError as exc:
available = ", ".join(sorted(DISTRIBUTIONS_V2))
raise ValueError(f"unknown v2 distribution {name!r}; available: {available}") from exc
return generator(seed, normal_count=normal_count, update_count=update_count)
__all__ = [
"DISTRIBUTIONS_V2",
"density_trap_v2",
"generate_distribution_v2",
"scope_shift_v2",
]
|