Hyperparameter optimizationIn machine learning, hyperparameter optimization or tuning is the problem of choosing a set of optimal hyperparameters for a learning algorithm. A hyperparameter is a parameter whose value is used to control the learning process. By contrast, the values of other parameters (typically node weights) are learned. The same kind of machine learning model can require different constraints, weights or learning rates to generalize different data patterns.
Optimization problemIn mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.
Problème de décisionEn informatique théorique, un problème de décision est une question mathématique dont la réponse est soit « oui », soit « non ». Les logiciens s'y sont intéressés à cause de l'existence ou de la non-existence d'un algorithme répondant à la question posée. Les problèmes de décision interviennent dans deux domaines de la logique : la théorie de la calculabilité et la théorie de la complexité. Parmi les problèmes de décision citons par exemple le problème de l'arrêt, le problème de correspondance de Post ou le dernier théorème de Fermat.
Model selectionModel selection is the task of selecting a model from among various candidates on the basis of performance criterion to choose the best one. In the context of learning, this may be the selection of a statistical model from a set of candidate models, given data. In the simplest cases, a pre-existing set of data is considered. However, the task can also involve the design of experiments such that the data collected is well-suited to the problem of model selection.
Hamiltonian path problemIn the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
Boat racingBoat racing is a sport in which boats, or other types of watercraft, race on water. Boat racing powered by oars is recorded as having occurred in ancient Egypt, and it is likely that people have engaged in races involving boats and other water-borne craft for as long as such watercraft have existed. A regatta is a series of boat races. The term comes from the Venetian language, with regata meaning "contest, contention for mastery"(from regatare ("compete, haggle, sell at retail"), possibly from ''recatare') and typically describes racing events of rowed or sailed water craft, although some powerboat race series are also called regattas.
Navigation à voileLa navigation à voile est l'activité, pour un voilier, de se déplacer grâce à l’énergie fournie par le vent. Les voiliers ont, durant de nombreux siècles, joué un rôle majeur dans le transport, le commerce et la conduite des guerres. À la fin du ils ont été progressivement remplacés par des navires à moteur, qui étaient moins dépendants des conditions météorologiques, ce qui réduisait les temps de transport, et nécessitait moins de personnel permettant ainsi une diminution des coûts de transport.
Dinghy sailingDinghy sailing is the activity of sailing small boats by using five essential controls: the sails the foils (i.e. the daggerboard or centreboard and rudder and sometimes lifting foils as found on the Moth) the trim (forward/rear angle of the boat in the water) side-to-side balance of the dinghy by hiking or movement of the crew, particularly in windy weather ("move fast or swim") the choice of route (in terms of existing and anticipated wind shifts, possible obstacles, other water traffic, currents, tides etc.
