Advanced search

Showing result 1 - 5 of 17 essays matching the above criteria.

1. 1. A type-driven approach for sensitivity checking with branching

   University essay from Göteborgs universitet/Institutionen för data- och informationsteknik

   Author : Daniel Freiermuth; [2023-10-24]
   Keywords : Computer; science; computer science; thesis; differential privacy; type system; sensitivity; branching;

   Abstract : Differential Privacy (DP) is a promising approach to allow privacy preserving statistics over large datasets of sensitive data. It works by adding random noise to the result of the analytics. Understanding the sensitivity of a query is key to add the right amount of noise capable of protecting privacy of individuals in the dataset. READ MORE

3. 2. Active Learning for Solving Expensive Optimization Problems

   University essay from Uppsala universitet/Institutionen för informationsteknologi

   Author : Siwei Fu; [2022]
   Keywords : ;

   Abstract : Many practical engineering and computer science problems can be translated into a global otimization problem where the task is to find the best (optimal) vector 𝒙𝒙∗ that gives the smallest possible function value 𝑓𝑓 = 𝑓𝑓(𝒙𝒙∗) for some function 𝑓𝑓() of interest. Often the function 𝑓𝑓() is expensive in the sense that it cannot be easily evaluated computationally or experimentally in terms of time and/or resources required. READ MORE

4. 3. A study of the s-step biconjugate gradient method

   University essay from Lunds universitet/Matematik (naturvetenskapliga fakulteten); Lunds universitet/Matematikcentrum

   Author : Carlotta Boi; [2022]
   Keywords : biconjugate gradient methods; s-step biconjugate gradient methods; nonsymmetric linear systems; sparse matrices.; Mathematics and Statistics;

   Abstract : In this thesis we will examine how to solve linear systems using the s-step biconjugate gradient algorithm, which is an iterative method based on the Krylov subspaces. It is useful especially when we have a large and sparse matrix. READ MORE

5. 4. Modelling Customer Lifetime Value in the Retail Banking Industry

   University essay from KTH/Matematisk statistik

   Author : Max Völcker; Carl Stenfelt; [2021]
   Keywords : CLV; Statistics; applied mathematics; marketing; machine learning; markov chains; CART; random forest; retail banking; CLV; Statistik; tillämpad matematik; marknadsföring; maskininlärning; markovkedjor; CART; random forest; banksektorn;

   Abstract : This thesis was conducted in cooperation with the Swedish bank SEB, who expressed interest in getting an increased understanding of how the marketing measure Customer Lifetime Value could be implemented and used in the retail banking industry. Accordingly, the purpose of this thesis was to provide insight into how Customer Lifetime Value could be modelled in an appropriate way in the retail banking industry and provide an increased understanding of necessary considerations for the modelling process. READ MORE

6. 5. Risk-aware Autonomous Driving Using POMDPs and Responsibility-Sensitive Safety

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Caroline Skoglund; [2021]
   Keywords : Computer Science - Robotics; Autonomous driving; partially observable Markov decision process; motion planning under uncertainty; risk estimation;

   Abstract : Autonomous vehicles promise to play an important role aiming at increased efficiency and safety in road transportation. Although we have seen several examples of autonomous vehicles out on the road over the past years, how to ensure the safety of autonomous vehicle in the uncertain and dynamic environment is still a challenging problem. READ MORE