No articles match
BinFHE: Boolean Circuits and Arbitrary Functions on Encrypted Bits4 days ago
Context and key setup | Two-input boolean gates | Negation | Multi-input gates | Arbitrary function evaluation | The sign function | Floor: bit-level rounding | When to use BinFHE vs CKKS | Further reading
CKKS Bootstrapping: Refreshing Deep Circuits4 days ago
The depth budget problem | Non-interactive bootstrap | Setup | Bootstrap key generation | Run a refresh | Iterative bootstrap | Interactive multi-party bootstrap | Refresh a ciphertext through the multi-party protocol | Aggregate and finalize | Comparison | Further reading
BinFHE: Boolean Circuits and Arbitrary Functions on Encrypted Bits4 days ago
Context and key setup | Two-input boolean gates | Negation | Multi-input gates | Arbitrary function evaluation | The sign function | Floor: bit-level rounding | When to use BinFHE vs CKKS | Further reading
CKKS Bootstrapping: Refreshing Deep Circuits4 days ago
The depth budget problem | Non-interactive bootstrap | Setup | Bootstrap key generation | Run a refresh | Iterative bootstrap | Interactive multi-party bootstrap | Refresh a ciphertext through the multi-party protocol | Aggregate and finalize | Comparison | Further reading
Solving nonlinear programs with Uno21 days ago
ECOSolveR Examples1 months ago
L1 minimization (Linear Programming) | Parametric Optimization with the Update-Solve Loop
Solving Optimization Problems with SCIP1 months ago
Introduction | Example 1: A Production Planning LP | Example 2: The Knapsack Problem | Example 3: N-Queens Problem | Example 4: Circle Packing (Quadratic Constraints) | Example 5: Facility Location (Mixed-Integer) | Example 6: Indicator Constraints | Solver Controls | References
Federated Cox-Lasso via Consensus ADMM on DLBCL2 months ago
Introduction | The global problem and its consensus split | The federated fit in the clear | The same fit under threshold FHE | Comparison with the centralized fit | What the protocol hides and reveals | Discussion | Limitations
Distributed Maximum Likelihood Estimation2 months ago
The statistical problem | The privacy constraint | The protocol | Implementation | 1. Generate a CKKS key pair | 2. Build workers and master | 3. Run mle() through the encrypted channel | Beyond MLE | CAVEAT
Distributed Stratified Cox Regression2 months ago
The statistical problem | DLBCL lymphoma cohort | The aggregated fit | The protocol | Wiring up the protocol | Iterative MLE through the encrypted protocol | Comparison with the cleartext fit | What just happened | What this demonstrates | Caveats and extensions
Federated Cosine Similarity with Site-Private Fine-Tuned Models2 months ago
Introduction | The setup | Threat model | The protocol | Synthetic data | Threshold key generation | Joint rotation keys | Per-site adapter fit and database setup | Diagonal-encoded matrix-vector multiply | Inner product against the local database | What is in the slots we do not read | Site contribution_fn: full per-site protocol step | Master orchestration and threshold-decrypted top-k | Reference-truth comparison | What the adapter buys: fidelity, posture, and a sweet spot | Discussion | Limitations | Related work | References
Consensus ADMM with Gaussian Noise (Demonstration)2 months ago
Introduction | The problem and its consensus split | Adding noise | A brief output-DP primer | The protocol modification | The stopping rule changes | Setup | Simulated cohort | Choosing $\rho$ and $T$ without touching the cohort | Threshold-FHE setup | The DP-ADMM loop | Centralized CVXR fit | The $\sigma$ sweep | Privacy budget | References
Introduction to homomorpheR2 months ago
The problem this package addresses | Terms you will meet | How the pieces fit together | Sites that are not in this R session | What "the right answer" means | Which vignette to read | A note on Paillier | References
Threshold Cox with Gaussian Noise (Demonstration)2 months ago
Introduction | A brief output-DP primer | The protocol | The Cox setup (same DLBCL data as the other Cox vignettes) | Threshold setup and DP-noised workers | Mechanical correctness: $\sigma = 0$ reproduces cox-threshold | Increasing noise: where does it break? | Nelder–Mead at the same noise scales | Privacy budget | References
Distributed Cox Regression with Threshold Key Generation2 months ago
Introduction | Threat model | The Cox setup (same DLBCL data as cox.Rmd) | The protocol | Implementation | Iterative MLE through the threshold protocol | Comparison with the cleartext fit | Discussion | Limitations
Distributed Query Count with Threshold Keys2 months ago
The problem | The target answer | Why the classic solution needed two non-cooperating parties | Threshold encryption removes the need for masking | The threshold-BFV implementation | The encrypted answer is exact | Summary
Precision2 months ago
Introduction | Exact, for integer schemes | Approximate, for CKKS
Secure Model Inference on Encrypted Data2 months ago
The use case | Scenario: weighted biomarker score | Setup: hospital's context and patient data | Lab side: apply the model to encrypted data | Hospital side: decrypt the results | Verification | Transport guarantees | Threat model: model extraction from the hospital side | Layered defenses | Network protocol: serialization
Encrypted Logistic Regression Prediction2 months ago
Overview | The setting | Step 1: train in the clear | Step 2: encrypt patient data | Step 3: evaluate the linear predictor (encrypted) | Step 4: apply the sigmoid (encrypted) | Step 5: decrypt predictions | Summary | Limitations
Privacy-Preserving Count Aggregation2 months ago
The problem | Setup | The aggregator sets up encryption | Each site computes locally and encrypts | The aggregator aggregates | Verification | The details of what happened | Serializing for a real distributed protocol
Introduction to openfhe.R: Fully Homomorphic Encryption in R2 months ago
A few terms from the cryptography side | Five Short Demonstrations | Encrypted integer arithmetic | Encrypted real arithmetic | Boolean operations on encrypted bits | Serialization | Threshold decryption | Further Exploration
Introduction to openfhe.R: Fully Homomorphic Encryption in R2 months ago
A few terms from the cryptography side | Five Short Demonstrations | Encrypted integer arithmetic | Encrypted real arithmetic | Boolean operations on encrypted bits | Serialization | Threshold decryption | Further Exploration
Clarabel Solver Examples3 months ago
Introduction | 1. Basic Quadratic Program Example | 1.1. Objective function | 1.2. Constraints | 1.3. Solution | 2. Basic Second-order Cone Programming Example | 2.1. Objective function | 2.2. Constraints | 2.3. Solution | 3. Semidefinite Cone Programming | 3.1. Example | 3.2. Chordal Decomposition of Sparse Semidefinite Programs | 4. Updating Problem Data (Warm Starts) | 4.1. Example: SDP with a changed constraint | 5. Cone Specifications | 6. Control parameters | 7. A Note on BLAS and LAPACK
Clarabel Solver Examples3 months ago
Introduction | 1. Basic Quadratic Program Example | 1.1. Objective function | 1.2. Constraints | 1.3. Solution | 2. Basic Second-order Cone Programming Example | 2.1. Objective function | 2.2. Constraints | 2.3. Solution | 3. Semidefinite Cone Programming | 3.1. Example | 3.2. Chordal Decomposition of Sparse Semidefinite Programs | 4. Updating Problem Data (Warm Starts) | 4.1. Example: SDP with a changed constraint | 5. Cone Specifications | 6. Control parameters | 7. A Note on BLAS and LAPACK
Differentiating Through a Cone Program with diffcp6 months ago
Introduction | The mathematical setup | What the package computes | Example 1: a linear program | Example 2: a second-order-cone program | Example 3: a small semidefinite program | A practical sensitivity-analysis example | Forward versus adjoint: when to use each | Choosing dense versus lsqr | Conventions | Connection to CVXR | Citation
Sparse derivatives with sparsediff6 months ago
What sparsediff is | Building an expression graph | Assembling a problem and its derivative oracle | Evaluating value and derivatives | Parameters and fast re-evaluation | Where to go next
Get started with cubature7 months ago
Introduction | Your first integral | The unified cubintegrate() interface | Choosing a method | Vector-valued integrands | Robustness: when hcubature and pcubature can silently fail | The opt-in robust path | When robust is not enough: the sampling-density cliff | The NOT_CONVERGED return code | Where to go next | Implementation notes | Session info
Vectorization benchmarks7 months ago
When to read this | A timing harness | Example 1 | Multivariate normal | Product of cosines | Gaussian function | Discontinuous function | A simple polynomial (product of coordinates) | Gaussian centered at $\frac{1}{2}$ | Double Gaussian | Tsuda's example | Morokoff & Caflisch example | Wang-Landau sampling 1d, 2d examples | Summary | Session info
Local FDR7 months ago
Description and Usage | Arguments | zz | bre | df | pct | pct0 | nulltype | type | plot | mult | mlests | main | sw | Value | fdr | fp0 | Efdr | cdf1 | mat | z.2 | call | pds | x | f | pds. | stdev | Simulation Example | References
Automatic Construction of Bootstrap Confidence Intervals7 months ago
Introduction | A Nonparametric Example | Tidy output | Visualization | Acceleration methods | A Parametric Example | A Logistic Model | A Penalized Logistic Model | Ratio of Independent Variance Estimates | Migration from pre-1.0 API | Function mapping | Parameter mapping | Return structure | Deprecation timeline | References
PIQP Solver Interface9 months ago
1. Introduction | 2. The Problem Solver Interface | 3. The Solver Model Object | Updating problem data and re-solving | 4. Dense and Sparse Interfaces | 5. Another Example | 6. Solver parameters
PIQP Solver Interface9 months ago
1. Introduction | 2. The Problem Solver Interface | 3. The Solver Model Object | Updating problem data and re-solving | 4. Dense and Sparse Interfaces | 5. Another Example | 6. Solver parameters
Solving Quadratic Programs with OSQP9 months ago
Introduction | Migrating from osqp < 1.0 | Setup and Solve | Convenience Function | Updating Problem Data | Updating Vectors | Updating Matrices | Warm Starting | Solver Settings | Key Settings | Updating Settings | Retrieving Problem Dimensions | Result Object | Status Values | Example: Lasso Regression | Example: Portfolio Optimization | Sparse Matrix Input | References
Solving Quadratic Programs with OSQP9 months ago
Introduction | Migrating from osqp < 1.0 | Setup and Solve | Convenience Function | Updating Problem Data | Updating Vectors | Updating Matrices | Warm Starting | Solver Settings | Key Settings | Updating Settings | Retrieving Problem Dimensions | Result Object | Status Values | Example: Lasso Regression | Example: Portfolio Optimization | Sparse Matrix Input | References
Almost Linear-Time k-Medoids Clustering3 years ago
Introduction | References
Contrast and Boosted Trees3 years ago
A Tutorial
Adaptive Subgroup Selection in Sequential Trials7 years ago
Introduction | Table 1 Results | Scenario S0 | Alternative Scenario S1 | Alternative Scenario S2 | Alternative Scenario S3 | Alternative Scenario S4 | Alternative Scenario S5 | Alternative Scenario S6 | Alternative Scenario S7 | Alternative Scenario S8 | Alternative Scenario S9 | Alternative Scenario S10 | Table 2 Results | References
Design of the DEFUSE3 Trial7 years ago
Continuous Rankin Simulations | The NULL Scenario | The ALT1 Scenario | The ALT2 Scenario | Discrete Rankin Simulations | The Discretized Scenarios | References
Using Discrete Rankin Scores7 years ago
Introduction | Scenario S0
Prototyping Distributed Computations7 years ago
Introduction | An Example | Stratified Cox Model | Session Info
Empirical Bayes Deconvolution8 years ago
A simulation example | The Shakespeare data | Bootstrap Comparison | Predict ratio of new distinct words | Normal Example | Another Normal example (Twin Towers) | Binomial Example | Posterior Estimates