Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 44 for “"Solution path"”.
-
Variable Ranking by Solution-path Algorithms
… of this kind of methods is that they can give a solution path which describes the order that variables enter the model. This provides an intuitive way to rank variables based on the path. However, Lasso can sometimes be difficult to apply to variable ranking directly. This is because that in a …
-
Solution Path Algorithms for Distributionally Robust Regression and Classification
… for large-scale data and high-dimensional data. Solution path algorithms provide a new approach to speed up the hyperparameter tuning. It can be proven that the optimal solutions of some machine learning models change piecewise linearly with respect to hyperparameters. Hence, we can obtain the …
-
High-Dimensional Inference Based on the Leave-One-Covariate-Out Regularization Path
… the information contained in the entire solution path of the LASSO. This dissertation consists of three research projects that propose and extend the Leave-One-Covariate-Out(LOCO) solution path statistic to regression and graphical models. In the first chapter, we propose a new measure of …
-
Controllable Tile-Based Level Generation for Vertical Platformers
… and gameplay properties associated with the solution path. To do this, we fine-tune a GPT-2 Medium LLM on a set of six annotated Kid Icarus levels from the Video Game Level Corpus (VGLC). Our per-tile encoding system allows us to get consistent level tile density which is in line with user …
-
Adaptive regularization using the entire solution surface
… data analysis, efficient computation of the solutions for all values of tuning parameters is critical for adaptive tuning. In the literature, there exist several algorithms computing an entire solution path for one single tuning parameter. All use the Kuhn-Tucker conditions for constructing …
-
Optimal structural design for maximum buckling load
… to the optimal design so that we can trace a path of optimum solutions. The solution path has several branches due to changes in the active constraint set and transitions from unimodal to bimodal solutions. The Lagrange multipliers and second-order optimality conditions are used to detect …
-
Feature Selection and Model Selection for Supervised Learning Algorithms
… The proposed method highly relies on the solution path of SVM over a range of the regularization parameter. When the solution path is available, the computation needed is minimal.
-
Change Point Analysis in Piecewise Polynomial Signals Using Trend Filtering
… filtering algorithm in order to construct a dual solution path that allows us to detect change points. We demonstrate that the dual solution path constitutes a Gaussian bridge process, which enables us to derive an exact and efficient stopping rule to terminate the search algorithm. Finally, we …
-
Numerical Methods for Thin Structure Design and Simulation: Yarns, Hair, and Multi-Scale Cloth
… accuracy and the ability to trace a full solution path are paramount, such as in textile design exploration, the thesis first presents a robust physics-based framework for static yarn-level simulation using numerical continuation. We formulate yarn relaxation and parameter exploration as …
-
Problem generator system in Engineering Design Tutor
… a problem tree is generated. All the possible solution paths in the tree are searched and the most complete and correct path is automatically selected as the shortest path. Using the values obtained from a constraint satisfaction solution for the variables in the shortest path, and the …
-
Sampling-Based Motion Planning With Differential Constraints
… accelerations of robotic systems are ignored in path planning, solutions for kinodynamic and non-holonomic planning problems from classical methods could be either inexecutable or inefficient. Motion planning with differential constraints (MPD), which directly considers differential constraints, …
-
Path planning with medial axis hints
We focus on planning paths for rigid objects moving in a static and known three dimensional workspace, as in applications such as virtual prototyping and maintenance studies of CAD models. Several planners have been proposed for solving this version of the path planning problem, including …
-
Topics on regression percentiles
… selection strategies for ER and provide the solution path. Finally, irregular problems of M-estimation is studied in this thesis. We discuss its connections to extreme values and some recent algorithms for solving QR.
-
Epidemic Change Detection via Shifted Maximum Subarrays
… the scan statistic can be derived from the SMS solution path, thereby transforming a quadratic-time optimization into an empirically near-linear-time procedure. This result provides an exact and scalable algorithm for computing scan statistics without approximation. We further develop …
-
A Unified Algorithm for Fitting Penalized Models with High Dimensional Data
… efficient unified algorithms for computing the solution path for a collection of penalized models. In particular, we study the algorithm for solving l1 penalized learning problems and the algorithm for solving group-lasso learning problems. These algorithm take advantage of a …
-
An examination of fixation in brainstorming
… due to prior experience or an inappropriate solution path. Brainstorming is the process of generating as many possible ideas on a topic as possible. From this synthesis, it was hypothesized that fixation occurs in brainstorming. Three experiments tested the predictions of this theory. It was …
-
Expressive corpus search in a modern framework - Developing expressiveness for Korpsearch, a more efficient tool by which to query a corpus
… shows that one can depart from the disjunction solution path, the path that is to find all matching words and then form a disjuntive query between them, in special cases. Special solutions have been made for prefix and suffix which have managed to have shorter execution time for those kinds of …
-
Nested Monte Carlo Tree Search as Applied to Samurai Sudoku
… essentially the same since they follow the same solution path. Many Sudoku generating or solving programs rely on brute-force methods to avoid this pitfall, but this is inefficient since there is no heuristic to navigate the huge search space. A nested Monte Carlo tree search has some basis in …
-
Variations of A* for searching in abstraction hierarchies.
… in order to find an optimal or near optimal solution to the original problem. One of our objectives is to preserve optimal paths while speeding up search. We have developed new approaches to speed-up A$\sp{*}$ in an abstraction hierarchy: abstract solutions, minimum edge weight, P-G to …
-
Deformable Voronoi diagrams for robot path planning in dynamic environments
Path planning for mobile robots is a complex problem. However, it becomes more challenging when it comes to planning paths in dynamic environments. This is because the robot needs to reach an agreement between the need of having efficient and optimal paths and the need to deal with unexpected …
Page 1 of 3