Arrow Research search

Author name cluster

Alexander Knop

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

8 papers
2 author rows

Possible papers

8

NeurIPS Conference 2025 Conference Paper

Private Hyperparameter Tuning with Ex-Post Guarantee

  • Badih Ghazi
  • Pritish Kamath
  • Alexander Knop
  • Ravi Kumar
  • Pasin Manurangsi
  • Chiyuan Zhang

The conventional approach in differential privacy (DP) literature formulates the privacy-utility tradeoff with a "privacy-first" perspective: for a predetermined level of privacy, a certain utility is achievable. However, practitioners often operate under a "utility-first" paradigm, prioritizing a desired level of utility and then determining the corresponding privacy cost. Wu et al. [2019] initiated a formal study of this ``utility-first'' perspective by introducing ex-post DP. They demonstrated that by adding correlated Laplace noise and progressively reducing it on demand, a sequence of increasingly accurate estimates of a private parameter can be generated, with the privacy cost attributed only to the least noisy iterate released. This led to a Laplace mechanism variant that achieves a specified utility with minimal privacy loss. However, their work, and similar findings by Whitehouse et al. [2023], are primarily limited to simple mechanisms based on Laplace or Gaussian noise. In this paper, we significantly generalize these results. In particular, we extend the findings of Wu et al. [2019] and Liu and Talwar [2019] to support any sequence of private estimators, incurring at most a doubling of the original privacy budget. Furthermore, we demonstrate that hyperparameter tuning for these estimators, including the selection of an optimal privacy budget, can be performed without additional privacy cost. Finally, we extend our results to ex-post R\'{e}nyi DP, further broadening the applicability of utility-first privacy mechanisms.

NeurIPS Conference 2023 Conference Paper

Counting Distinct Elements Under Person-Level Differential Privacy

  • Thomas Steinke
  • Alexander Knop

We study the problem of counting the number of distinct elements in a dataset subject to the constraint of differential privacy. We consider the challenging setting of person-level DP (a. k. a. user-level DP) where each person may contribute an unbounded number of items and hence the sensitivity is unbounded. Our approach is to compute a bounded-sensitivity version of this query, which reduces to solving a max-flow problem. The sensitivity bound is optimized to balance the noise we must add to privatize the answer against the error of the approximation of the bounded-sensitivity query to the true number of unique elements.

STOC Conference 2021 Conference Paper

Log-rank and lifting for AND-functions

  • Alexander Knop
  • Shachar Lovett
  • Sam McGuire
  • Weiqiang Yuan 0002

Let f : {0, 1} n → {0, 1} be a boolean function, and let f ∧ ( x , y ) = f ( x ∧ y ) denote the AND-function of f , where x ∧ y denotes bit-wise AND. We study the deterministic communication complexity of f ∧ and show that, up to a log n factor, it is bounded by a polynomial in the logarithm of the real rank of the communication matrix of f ∧ . This comes within a log n factor of establishing the log-rank conjecture for AND-functions with no assumptions on f . Our result stands in contrast with previous results on special cases of the log-rank conjecture, which needed significant restrictions on f such as monotonicity or low F 2 -degree. Our techniques can also be used to prove (within a log n factor) a lifting theorem for AND-functions, stating that the deterministic communication complexity of f ∧ is polynomially related to the AND-decision tree complexity of f .

CSL Conference 2020 Conference Paper

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs

  • Sam Buss
  • Anupam Das 0002
  • Alexander Knop

This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs, deterministic or non-deterministic. Decision trees (DTs) are represented by a natural term syntax, inducing the system LDT, and non-determinism is modelled by including disjunction, ∨, as primitive (system LNDT). Branching programs generalise DTs to dag-like structures and are duly handled by extension variables in our setting, as is common in proof complexity (systems eLDT and eLNDT). Deterministic and non-deterministic branching programs are natural nonuniform analogues of log-space (L) and nondeterministic log-space (NL), respectively. Thus eLDT and eLNDT serve as natural systems of reasoning corresponding to L and NL, respectively. The main results of the paper are simulation and non-simulation results for tree-like and dag-like proofs in LDT, LNDT, eLDT and eLNDT. We also compare them with Frege systems, constant-depth Frege systems and extended Frege systems.

SODA Conference 2019 Conference Paper

Strategies for Stable Merge Sorting

  • Sam Buss
  • Alexander Knop

We introduce new stable natural merge sort algorithms, called 2-merge sort and α -merge sort. We prove upper and lower bounds for several merge sort algorithms, including Timsort, Shiver's sort, α -stack sorts, and our new 2-merge and α -merge sorts. The upper and lower bounds have the forms c · n log m and c · n log n for inputs of length n comprising m runs. For Timsort, we prove a lower bound of (1. 5 – o (1)) n log n. For 2-merge sort, we prove optimal upper and lower bounds of approximately (1. 089 ± o (1)) n log m. We state similar asymptotically matching upper and lower bounds for α -merge sort, when ϕ < α < 2, where ϕ is the golden ratio. Our bounds are in terms of merge cost; this upper bounds the number of comparisons and accurately models runtime. The merge strategies can be used for any stable merge sort, not just natural merge sorts. The new 2-merge and α -merge sorts have better worst-case merge cost upper bounds and are slightly simpler to implement than the widely-used Timsort; they also perform better in experiments.

SAT Conference 2017 Conference Paper

Hard Satisfiable Formulas for Splittings by Linear Combinations

  • Dmitry Itsykson
  • Alexander Knop

Abstract Itsykson and Sokolov in 2014 introduced the class of \(\mathrm {DPLL}(\oplus )\) algorithms that solve Boolean satisfiability problem using the splitting by linear combinations of variables modulo 2. This class extends the class of \(\mathrm {DPLL}\) algorithms that split by variables. \(\mathrm {DPLL}(\oplus )\) algorithms solve in polynomial time systems of linear equations modulo 2 that are hard for \(\mathrm {DPLL}\), \(\mathrm {PPSZ}\) and \(\mathrm {CDCL}\) algorithms. Itsykson and Sokolov have proved first exponential lower bounds for \(\mathrm {DPLL}(\oplus )\) algorithms on unsatisfiable formulas. In this paper we consider a subclass of \(\mathrm {DPLL}(\oplus )\) algorithms that arbitrary choose a linear form for splitting and randomly (with equal probabilities) choose a value to investigate first; we call such algorithms drunken \(\mathrm {DPLL}(\oplus )\). We give a construction of a family of satisfiable CNF formulas \(\varPsi _n\) of size \(\mathrm {poly}(n)\) such that any drunken \(\mathrm {DPLL}(\oplus )\) algorithm with probability at least \(1 - 2^{-\varOmega (n)}\) runs at least \(2^{\varOmega (n)}\) steps on \(\varPsi _n\); thus we solve an open question stated in the paper [ 12 ]. This lower bound extends the result of Alekhnovich, Hirsch and Itsykson [ 1 ] from drunken \(\mathrm {DPLL}\) to drunken \(\mathrm {DPLL}(\oplus )\).

MFCS Conference 2016 Conference Paper

On the Limits of Gate Elimination

  • Alexander Golovnev
  • Edward A. Hirsch
  • Alexander Knop
  • Alexander S. Kulikov

Although a simple counting argument shows the existence of Boolean functions of exponential circuit complexity, proving superlinear circuit lower bounds for explicit functions seems to be out of reach of the current techniques. There has been a (very slow) progress in proving linear lower bounds with the latest record of 3 1/86*n-o(n). All known lower bounds are based on the so-called gate elimination technique. A typical gate elimination argument shows that it is possible to eliminate several gates from an optimal circuit by making one or several substitutions to the input variables and repeats this inductively. In this note we prove that this method cannot achieve linear bounds of cn beyond a certain constant c, where c depends only on the number of substitutions made at a single step of the induction.

v2026.09.13