Combinatorial black box optimization with expert advice

    公开(公告)号:US12124965B2

    公开(公告)日:2024-10-22

    申请号:US17114408

    申请日:2020-12-07

    CPC classification number: G06N5/01 G06N3/126

    Abstract: Aspects of the present invention disclose a method, computer program product, and system for optimizing a result for a combinatorial optimization problem. The method includes one or more processors receiving a black-box model. The method further includes one or more processors learning a multilinear polynomial surrogate model employing an exponential weight update rule. The method further includes one or more processors optimizing the learnt multilinear polynomial surrogate model. The method further includes one or more processors applying the black-box model to the optimized solution found by the multilinear polynomial surrogate model. In an additional aspect, the method of learning an optimized multilinear polynomial surrogate model employing an exponential weight update rule further includes one or more processors calculating utilizing data from the black-box model, an update of the coefficients of the multilinear polynomial surrogate model.

    Method and apparatus for flow line parameter interpretation with diverse flow models

    公开(公告)号:US12105243B2

    公开(公告)日:2024-10-01

    申请号:US17723920

    申请日:2022-04-19

    CPC classification number: G01V20/00 E21B49/087 G06N3/126 G06N20/00

    Abstract: Improved systematic inversion methodology applied to formation testing data interpretation with spherical, radial and/or cylindrical flow models is disclosed. A method of determining a flow line parameter includes determining a diverse set of flow models and selecting at least one flow model from the diverse set of flow models representative, at least in part, of a formation tester tool, at least one formation, at least one fluid, and at least one flow of the at least one fluid. The method further includes lowering the formation testing tool into the at least one formation to intersect with the formation at least one formation and sealing a probe of the formation tester placed in fluid communication with the at least one formation. The method further includes initiating flow from the at least one formation and utilizing the at least one selected flow model to predict the flow line parameter.

    Facilitating ML algorithm contribution to use cases where data is prohibitive

    公开(公告)号:US12001963B2

    公开(公告)日:2024-06-04

    申请号:US17207340

    申请日:2021-03-19

    CPC classification number: G06N3/126 G06F18/214 G06N20/00 G08B13/2474

    Abstract: Example aspects include techniques for building a ML model in a use case with prohibitive training data and employing the ML model within the use case. These techniques may include determining training information including a plurality of stray training reads and a plurality of valid training reads, determining modified training information based at least in part on modifying the plurality of valid training reads, and generating a model for distinguishing a valid read from a stray read based on the modified training information and an evolutionary algorithm. In addition, the techniques may include detecting, by a monitoring device, a plurality of tag reads in response to a plurality of interactions between a tag and the monitoring device, and determining, by the monitoring device, a plurality of valid tag reads based on the model and plurality of tag reads.

    PACKING METHOD AND ELECTRONIC DEVICE
    7.
    发明公开

    公开(公告)号:US20240070472A1

    公开(公告)日:2024-02-29

    申请号:US17932290

    申请日:2022-09-14

    CPC classification number: G06N3/126 B65B57/00

    Abstract: The present disclosure provides a packing method including following steps. Genetic algorithm is utilized to calculate multiple packing programs. Multiple candidate packing programs including all items are selected from the packing programs. Among each of the candidate packing programs, at least one of the items to be placed earlier is classified into a first subset, and at least another one of the items to be placed later is classified into a second subset. Among each of the candidate packing programs, a first packing for the first subset is maintained, and a second packing for the second subset is recalculated by using a greedy algorithm to generate an updated second packing.

    OPTIMIZATION ALGORITHM FOR AUTOMATICALLY DETERMINING VARIATIONAL MODE DECOMPOSITION PARAMETERS BASED ON BEARING VIBRATION SIGNALS

    公开(公告)号:US20240068907A1

    公开(公告)日:2024-02-29

    申请号:US18021493

    申请日:2022-05-11

    CPC classification number: G01M13/045 G06N3/126

    Abstract: The present invention provides an optimization algorithm for automatically determining variational mode decomposition parameters based on bearing vibration signals. First, mode energy is used to reflect bandwidth, a bandwidth optimization sub-model is established to automatically obtain optimal bandwidth parameter αopt. Secondly, energy loss optimization sub-model is established to avoid under-decomposition. Thirdly, a mode mean position distance optimization sub-model is established to prevent the generation of too much K and avoid the phenomenon of over-decomposition. Finally, considering the interaction between the bandwidth parameter α and the total number of modes K, the interaction between mode components and the integrity of reconstruction information, nonlinear transformation is performed by a logarithmic function, so as to make the values of three optimization sub-models form similar scales, obtain an optimization model that can automatically determine optimal VMD parameters αopt and Kopt, and establish a quantitative evaluation index for the decomposition performance of a VMD algorithm.

    GEOGRAPHIC DISTRIBUTION OF RESOURCES USING GENETIC ALGORITHMS

    公开(公告)号:US20240054368A1

    公开(公告)日:2024-02-15

    申请号:US17818472

    申请日:2022-08-09

    Applicant: WORKDAY, INC.

    CPC classification number: G06N5/041 G06N3/126

    Abstract: In some aspects, the techniques described herein relate to a method including: initializing a population of hypotheses; computing misfit values for each of the hypotheses, the misfit values computed using a fitness function including a weighted summation, wherein terms of weighted summation include metric functions; generating a plurality of offspring hypotheses based on the population of hypotheses and a crossover bitmask; generating a new population using the plurality of offspring and a subset of the population of hypotheses; mutating at least one hypothesis in the new population; selecting a hypothesis from the new population based on a corresponding misfit value of the hypothesis; and allocating at least one resource based on the hypothesis.

Patent Agency Ranking