S-LCG: Structured Linear Congruential Generator-Based Deterministic Algorithm for Search and Optimization

• URL: http://arxiv.org/abs/2605.05198v1
• Date: Wed, 06 May 2026 17:57:41 GMT
• Title: S-LCG: Structured Linear Congruential Generator-Based Deterministic Algorithm for Search and Optimization
• Abstract summary: This study presents a novel deterministic optimization algorithm based on a special variant of the Linear Congruential Generator (LCG)<n>It is motivated by the intrinsic structure of the generator, the reason behind naming it the Structured Linear Congruential Generator (S- LCG)
• Score: 3.033196534183858
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This study presents a novel deterministic optimization algorithm based on a special variant of the Linear Congruential Generator (LCG). While conventional algorithms generally operate within the search space, the introduced technique follows a two-level architecture. In particular, an external loop that adaptively balances between exploration and exploitation, while the internal loop evaluates solutions. It is motivated by the intrinsic structure of the generator, the reason behind naming it the Structured Linear Congruential Generator (S- LCG). which enjoys a number of unique characteristics as follows: 1) a memoryless scheme, which ensures non-overlapping sequences based on distinct seeds, thus ensuring no evaluation redundancy; 2) bit splitting representation, which converts LCG states into multi-dimensional points to overcome the Marsaglia lattice effect; 3) adaptive exploration-exploitation of the generator space, which leads to implicit optimization of the surrogate smooth objective function; and 4) constant information gathering speed to avoid the problem of premature convergence. Extensive testing on 26 benchmark functions across dimensions d = 2 to 30 demonstrates that S-LCG comes within 1% of the global optimum in 83.3% of 138 cases (100% at d = 2, 81.2% at d = 30) while the nearest competitor GA achieved 75.4%. Statistical validation shows that S-LCG outperforms eight cutting-edge binary algorithms. Furthermore, its practical value is confirmed by validation on three constrained engineering design problems. In the end, S-LCG offers an optimization framework that is strictly reproducible and requires only one sensitive parameter to be tuned.

Related papers

• LLM-Driven Evolutionary Generation of Multi-Objective Bayesian Optimization Algorithms [2.012877764904354]
  We use large language models as mutation and crossover operators within evolutionary strategies to generate complete algorithm implementations.<n>Across nine evolutionary runs we generated approximately 900 algorithms and benchmarked them on twelve synthetic problems and three real-world engineering problems.
  arXiv  Detail & Related papers  (2026-07-06T08:44:13Z)
• optimize_anything: A Universal API for Optimizing any Text Parameter [98.42497715725356]
  We show a single AI-based optimization system-supporting single-task search, multi-task search with cross-problem transfer, and generalization to unseen inputs.<n>We show for the first time that text optimization with LLM-based search is a general-purpose problem-solving paradigm.
  arXiv  Detail & Related papers  (2026-05-19T10:18:12Z)
• ARES-LSHADE: Autoresearch-Enhanced LSHADE with Memetic Polish for the GNBG Benchmark [0.5186554442959231]
  We present ARES-LSHADE, a memetic differential-evolution variant submitted to the GECCO 2026 competition on LLM-designed evolutionary algorithms.<n>The algorithm builds on the LLM-LSHADE 2025 winner, contributing two new components.<n>The resulting algorithm trivially solved all 24 functions but violated the competition's blackbox rule.
  arXiv  Detail & Related papers  (2026-05-09T15:16:00Z)
• AdaExplore: Failure-Driven Adaptation and Diversity-Preserving Search for Efficient Kernel Generation [59.964989458924585]
  AdaExplore is an agent framework that enables self-improvement via accumulated execution feedback for performance-critical kernel code generation.<n>In the adaptation stage, the agent synthesizes tasks and converts recurring failures into a reusable memory of validity rules.<n>In the search stage, the agent organizes candidate kernels as a tree and alternates between small local refinements and larger structural regeneration.
  arXiv  Detail & Related papers  (2026-04-17T18:25:03Z)
• Lens-descriptor guided evolutionary algorithm for optimization of complex optical systems with glass choice [0.8737619431048763]
  We propose the Lens Descriptor-Guided Evolutionary Algorithm (LDG-EA), a two-stage framework for multimodal lens optimization.<n>On a 24-variable topology, LDG-EA generates on average around 14500 candidate minima spanning 636 unique descriptors.<n>Although the best LDG-EA design is slightly worse than a fine-tuned reference lens, it remains in the same performance range.
  arXiv  Detail & Related papers  (2026-01-29T18:13:24Z)
• Efficient Differentiable Causal Discovery via Reliable Super-Structure Learning [51.20606796019663]
  We propose ALVGL, a novel and general enhancement to the differentiable causal discovery pipeline.<n>ALVGL employs a sparse and low-rank decomposition to learn the precision matrix of the data.<n>We show that ALVGL not only achieves state-of-the-art accuracy but also significantly improves optimization efficiency.
  arXiv  Detail & Related papers  (2026-01-09T02:18:59Z)
• Simultaneous Genetic Evolution of Neural Networks for Optimal SFC Embedding [0.0]
  Service Function Chains virtualise network functions and embed them on networking infrastructure.<n>Existing approaches either do not optimise all three sub-problems or do not optimise all three subproblems simultaneously.<n>We propose a Genetic Algorithm-based approach called GENESIS, which evolves three sine-function Neural Networks, and funnels their output to a Gaussian distribution and an A* algorithm to optimise all three subproblems simultaneously.
  arXiv  Detail & Related papers  (2025-12-10T05:06:13Z)
• QUASAR: An Evolutionary Algorithm to Accelerate High-Dimensional Optimization [0.0]
  This paper introduces Quasi-Adaptive Search with Asymptotic Reinitialization (QUASAR)<n>QUASAR is an evolutionary algorithm to accelerate convergence in complex, non-differentiable problems afflicted by the curse of dimensionality.
  arXiv  Detail & Related papers  (2025-11-17T19:02:31Z)
• A Gradient Meta-Learning Joint Optimization for Beamforming and Antenna Position in Pinching-Antenna Systems [63.213207442368294]
  We consider a novel optimization design for multi-waveguide pinching-antenna systems.<n>The proposed GML-JO algorithm is robust to different choices and better performance compared with the existing optimization methods.
  arXiv  Detail & Related papers  (2025-06-14T17:35:27Z)
• Optimized Clifford Noise Reduction: Theory, Simulations and Experiments [2.685668802278156]
  We propose several optimizations of the CliNR partial error correction scheme.<n>Errors are corrected by measuring a sequence of Pauli operators.<n>We show that our algorithms improve the performance of CliNR by 25%.
  arXiv  Detail & Related papers  (2025-04-17T21:47:38Z)
• Efficient Convex Algorithms for Universal Kernel Learning [46.573275307034336]
  An ideal set of kernels should: admit a linear parameterization (for tractability); dense in the set of all kernels (for accuracy) Previous algorithms for optimization of kernels were limited to classification and relied on computationally complex Semidefinite Programming (SDP) algorithms. We propose a SVD-QCQPQP algorithm which dramatically reduces the computational complexity as compared with previous SDP-based approaches.
  arXiv  Detail & Related papers  (2023-04-15T04:57:37Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis [71.05708939639537]
  We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of emphconcave unconstrained problems.<n>Our method improves the existing line-search-based min-max optimization by shaving off an $O(loglog(1/eps)$ factor in the required number of Schur decompositions.
  arXiv  Detail & Related papers  (2022-10-23T21:24:37Z)
• Sequential Subspace Search for Functional Bayesian Optimization Incorporating Experimenter Intuition [63.011641517977644]
  Our algorithm generates a sequence of finite-dimensional random subspaces of functional space spanned by a set of draws from the experimenter's Gaussian Process. Standard Bayesian optimisation is applied on each subspace, and the best solution found used as a starting point (origin) for the next subspace. We test our algorithm in simulated and real-world experiments, namely blind function matching, finding the optimal precipitation-strengthening function for an aluminium alloy, and learning rate schedule optimisation for deep networks.
  arXiv  Detail & Related papers  (2020-09-08T06:54:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.