There are 2 repositories under random-sampling topic.
RAFT contains fundamental widely-used algorithms and primitives for machine learning and information retrieval. The algorithms are CUDA-accelerated and form building blocks for more easily writing high performance applications.
Hyperparameter optimization in Julia.
[ICLR 2020] NAS evaluation is frustratingly hard
PROSAC algorithm in python
NAS Benchmark in "Prioritized Architecture Sampling with Monto-Carlo Tree Search", CVPR2021
A collection of algorithms in Java 8 for the problem of random sampling with a reservoir
Optimal approximate sampling from discrete probability distributions
numpy practice exercise with solution
Efficient random sampling via linear interpolation.
Ray Tracer implementation in C++, Random Sample AA, multi-threading, bvh acceleration, temporal denoising, soft shadows, and runtime comparisons on different CPUs
A nodejs module for randomly select elements.
sub-package of spatstat containing core functionality for data analysis and modelling
Alpha stable and sub-Gaussian distributions in Julia
Reference implementation of the Affirmative Sampling algorithm by Jérémie Lumbroso and Conrado Martínez (2022). 🍀
Make Julia code probabilistic-programming-ready by allowing calls to `rand` to be annotated with traced addresses.
Credit card fraud detection, gender classification from name etc.
⚡ Validation method of cognitive diagnosis models (CDMs)
In this project, I used a dataset containing the historical lending activity from a peer-to-peer lending services company to build a model that can identify the creditworthiness of borrowers.
Sampling procedures for some common random variables based on splitmix
A comprehensive tutorial on Monte Carlo Simulation using Python, demonstrating how random sampling and probabilistic models can be used for various real-world applications, including finance, physics, and engineering.
This paper proposes an alternative data-driven hap- tic modeling method of homogeneous deformable objects based on a CatBoost approach – a variant of gradient boosting machine learning approach. In this approach, decision trees are trained sequentially to learn the required mapping function for modeling the objects.
The P-Median Problem project uses metaheuristic optimization to solve the p-median location problem, with Jupyter notebooks implementing random sampling and local search algorithms to minimize service distances.
R package for statistical modeling with the Skellam distribution, supporting inference, random sampling, and regression for differences of independent Poisson counts.
Builds N-gram language modes and applies text generation.
Monte Carlo Dice Simulator - Statistical Analysis Tool
Fast Generation of von Mises-Fisher Distributed Pseudo-Random Vectors
This project uses two Turtlebot3 robots. One maps the environment with SLAM, and the other navigates a maze using an RRT algorithm. Shared data enables autonomous navigation without object detection. Developed using ROS tools, Gazebo, and Python scripts..
A machine learning project to predict Customers/Clients into correct segment to provide promotional information or for product advertising.
Collection of common datastructures and utility functions