Search Constraints

Start Over
Filtering by: Creator Walters, B. F. Remove constraint Creator: Walters, B. F. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    (BO) methods are often used to optimize an unknown function f(·) that is costly to evaluate. They

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    and then cube-pruning to attain linear O(n ·b log(b)) runtime complexity. Despite being an inex- act

  • Weakly Supervised Learning for Activity Recognition from Time Series Data

    Creator:
    Guan, Xinze
    Abstract:
    The thesis focuses on activity recognition from sensor data, which has spurred a great deal of interest due to its impact on health care and security. Previous work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 B Complete Data Log-likelihood and Surrogate Objective . . . . . . . . . . . 99 C Expectation

  • Planning in multi-agent partially observable domains using sparse sampling

    Creator:
    Donneau-Golencer, Thierry D.
    Abstract:
    A large number of sequential decision-making problems in uncertain environments can be modeled as Markov Decision Processes (MDPs). In such settings, an agent can observe at each time step the state of the environment and then executes an action, causing a stochastic transition to a new state of the environment...
    Resource Type:
    Masters Thesis
    Full Text:
    �������� �zx -21�7+*Y7��+g2��|^ "D�<F-2:‚&27+7c<>-�<>�^&2/GgwHw#lH]& �\-0 B&2*�'���D"-0 9Q W >&2D"&2*Y�b&2

  • Principles of Variational Databases

    Creator:
    Ataei, Parisa S.
    Abstract:
    Data variations are prevalent in real-world applications. For example, software vendors have to handle numerous variations in the business requirements, conventions, and environmental settings of a software product. In database-backed software, the database of each version may have a different schema and content. As another example, data scientists often need...
    Resource Type:
    Masters Thesis
    Full Text:
    expression syntax: b ∈ B ::= true | false Boolean Tag cl ∈ Conj ::= b | f | ¬f | cl ∧ cl Conjunction of

  • Uncertainty in Deep Learning with Implicit Neural Networks

    Creator:
    Ratzlaff, Neale
    Abstract:
    The ability to extract uncertainties from predictions is crucial for the adoption of deep learning systems to safety-critical applications. Uncertainty estimates can be used as a failure signal, which is necessary for automating complex tasks where safety is a concern. Furthermore, current deep learning systems do not provide uncertainty estimates,...
    Resource Type:
    Dissertation
    Full Text:
    . While (b) shows prediction on a semantically different input. Predicting a bird as a “7” is a silent

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    subtrace T with root as the first application of a function f , for example, the trace with root b in

  • Automatic Explanations of Computation Results with Value Decompositions and Dominating Sets

    Creator:
    Kumar, Prashant
    Abstract:
    In an increasingly computation-driven world, algorithms and mathematical models significantly impact decision making across various fields. To foster trust and understanding, it is crucial to provide users with clear and concise explanations of the reasoning behind the results produced by computational tools, especially when recommendations appear counterintuitive. Legal frameworks in...
    Resource Type:
    Dissertation
    Full Text:
    and F : φ(O) = {a 7→ 4, b 7→ 4, c 7→ 5, d 7→ 6} φ(F ) = {a 7→ 6, b 7→ 2, c 7→ 3, d 7→ 4} Using

  • Probabilities of voting paradoxes with three candidates

    Creator:
    McDonald, Leslie M.
    Abstract:
    Pardoxes in voting has been an interest of voting theorists since the 1800's when Condorcet demonstrated the key example of a voting paradox: voters with individually transitive rankings produce an election outcome which is not transitive. With Arrow's Impossibility Theorem, the hope of finding a fair voting method which accurately...
    Resource Type:
    Masters Thesis
    Full Text:
    pairwise voting, that candidates can be ranked cyclically. For example, with three candidates {A,B,C

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    X f y y X β λ− − Ψ = Ψ = ∑ ∑ where aβ and bλ are trainable weights, and ag and bf are