New BDEs reveal singular surfaces from line congruences.
problem Understanding binary differential equations associated with line congruences.
method Applied pointwise to quadratic differential forms, studying quotients of quadratic forms and associated polar lines.
result Introduced a new singular surface in Euclidean 3-space.
We determine local topological types of binary differential equations of asymptotic curves at parabolic and flat umbilical points for generic 2-parameter families of surfaces in P3 by comparing our projective classification of Monge forms and classification of general BDE obtained by Tari and Oliver. In pa…
Study Blaschke's asymptotic lines on surfaces in 3D space.
problem Characterize Blaschke's asymptotic lines on surfaces in 3D.
method Analyze binary differential equations near cusp and umbilic points.
result Describe Blaschke's asymptotic lines near Euclidean parabolic set.
Lectures explore how differential methods improve understanding of algebraic group orbit spaces.
problem Understanding structure of invariants and orbit spaces of algebraic Lie groups.
method Combines algebraic and differential viewpoints to study orbit spaces.
result Differential approach provides deeper insights into invariants and orbit spaces.
Proposes a differentiable structure learning framework for general binary data.
problem Limitations of existing methods in discrete data structure learning.
method Formulates a differentiable optimization task for arbitrary dependencies in general discrete models.
result Establishes identifiability of complete set of compatible parameters and structures under mild assumptions.
Proposes a new binary classification model inspired by fluid phase separation.
problem Binary classification challenges.
method Discretization of nonlinear reaction-diffusion equation coupled with ODE, inspired by fluid dynamics.
result PSBC model achieves comparable performance to traditional methods on MNIST.
This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial processes, i.e., by processes with fixed size binary increments at sampling points. …
New integrable matrix PDEs derived from Frölicher-Nijenhuis brackets.
problem Developing integrable systems from tensor field properties.
method Using Frölicher-Nijenhuis brackets to generate bi-differential graded algebras and PDE systems.
result New integrable nonlinear matrix PDEs and systems are derived.
We study the pricing problem for corporate defaultable bond from the viewpoint of the investors outside the firm that could not exactly know about the information of the firm. We consider the problem for pricing of corporate defaultable bond in the case when the firm value is only declared in some fixed discrete time a…
The Bouncy Particle Sampler is a novel rejection-free non-reversible sampler for differentiable probability distributions over continuous variables. We generalize the algorithm to piecewise differentiable distributions and apply it to generic binary distributions using a piecewise differentiable augmentation. We illust…
The study classifies points on ruled surfaces in 4-space based on geometric properties.
problem Characterizing points on smooth ruled surfaces in 4-space.
method Contact with transverse planes, binary differential equations, and projective transformations.
result Parabolic points on ruled surfaces in 4-space can be classified as butterfly hyperbolic, parabolic, or elliptic based on the discriminant of a binary differential equation.
We introduce (binary) Darboux transformation for general differential equation of the second order in two independent variables. We present a discrete version of the transformation for a 6-point difference scheme. The scheme is appropriate to solving a hyperbolic type initial-boundary value problem. We discuss several …
Study identifies conditions for proxy adjustment in confounded binary treatment outcomes.
problem Average causal effect estimation with a non-differentially mismeasured binary confounder.
method Identifies conditions for proxy adjustment in the presence of a non-differentially mismeasured binary confounder.
result Adjusting for a non-differentially mismeasured binary proxy can improve estimation of the average causal effect.
Differentially private fair binary classification algorithm developed.
problem Balancing privacy and fairness in binary classification.
method Decoupling technique for fairness, refinement for differential privacy.
result Algorithm maintains fairness, privacy, and utility guarantees.
In this work we study the affine principal lines of surfaces in 3-space. We consider the binary differential equation of the affine curvature lines and obtain the topological models of these curves near the affine umbilic points (elliptic and hyperbolic). We also describe the generic behavior of affine curvature lines …
Efficiently estimates binary product distributions with privacy.
problem Estimating means of binary product distributions privately and accurately.
method Polynomial time, pure differential privacy approach.
result Optimal sample complexity with polylogarithmic factors.
Geometric theory connects machine learning classifiers to differential geometry.
problem Classifying data points in machine learning.
method Mapping binary classification to vector bundles and differential geometry.
result Harmonic interpolation solves RKHS interpolation problems.
Efficiently private regression for unbounded data.
problem Privacy constraints in regression settings with unbounded covariates.
method Differential privacy techniques on mean and covariance estimation extended to sub-gaussian regime.
result Unbiased estimate of true regression vector learned up to a scaling factor.
We consider the aff(n∣1)−module structure on the spaces of differential bilinear operators acting on the superspaces of weighted densities. We classify aff(n∣1)−invariant binary differential operators acting on the spaces of weighted densities. This result allows us to compute the first $\math…
Introduces a differentiable approximation to the zero-one loss.
problem Incompatibility of zero-one loss with gradient-based optimization.
method Smooth projection onto hypersimplex through constrained optimization.
result Achieves significant improvements in generalization under large-batch training.
Over the (1,n)-dimensional real superspace, n>1, we classify K(n)-invariant binary differential operators acting on the superspaces of weighted densities, where K(n) is the Lie superalgebra of contact vector fields. This result allows us to compute the first differential cohomology of %the L…
Study binary hypothesis testing with privacy and communication constraints.
problem Binary hypothesis testing under local differential privacy and communication constraints.
method Qualifies results as minimax or instance optimal, develops instance-optimal algorithms.
result Achieves minimum possible sample complexity under both privacy and communication constraints.
New method learns binary decision trees efficiently.
problem Learning binary decision trees for data partitioning.
method Argmin differentiation for discrete and continuous parameters.
result Produces competitive binary trees with fast training.
We discuss the problem of R-separability (separability of variables with a factor R) in the stationary Schrödinger equation on n-dimensional Riemann space. We follow the approach of Gaston Darboux who was the first to give the first general treatment of R-separability in PDE (Laplace equation on E3…
BinaryDuo improves BNNs by coupling binary activations, outperforming state-of-the-art models.
problem Gradient mismatch in BNNs due to binarizing activations.
method Using gradient of smoothed loss function to estimate gradient mismatch, proposing BinaryDuo scheme with coupled ternary activations.
result BinaryDuo outperforms state-of-the-art BNNs on various benchmarks.
We present a comprehensive study of multilayer neural networks with binary activation, relying on the PAC-Bayesian theory. Our contributions are twofold: (i) we develop an end-to-end framework to train a binary activated deep neural network, (ii) we provide nonvacuous PAC-Bayesian generalization bounds for binary activ…
The paper proves statistical consistency and fairness guarantees for a plug-in algorithm.
problem Establishing statistical guarantees for fairness-aware binary classification.
method Proves statistical consistency and derives finite sample guarantees for the plug-in algorithm.
result The plug-in algorithm is statistically consistent and guarantees fairness and differential privacy.
Linear stochastic models and discretized kinetic theory are two complementary analytical techniques used for the investigation of complex systems of economic interactions. The former employ Langevin equations, with an emphasis on stock trade; the latter is based on systems of ordinary differential equations and is bett…
A novel method for feature selection using a reparameterized logitNormal distribution.
problem Feature selection for reconstruction in high-dimensional data.
method Introducing a reparameterization of the logitNormal distribution to address differentiability and covariance issues.
result The method provides an effective exploration scheme and efficient feature selection for reconstruction.
Differentially-private Bayes consistency rule for binary classification and density estimation.
problem Privacy constraints limit private learning in the distribution-free PAC model.
method Constructs a universally Bayes consistent learning rule that satisfies differential privacy.
result Private learning is possible for arbitrary distributions, even with a single algorithm.
Study proposes a differentiable surrogate loss function for optimizing Fβ score in binary classification with imbalanced data.
problem Non-differentiability of Fβ score makes it unsuitable for optimization by gradient-based learning. method Investigated relationship between Fβ score and loss functions, proposed a differentiable surrogate loss function. result Gradient paths of the proposed surrogate Fβ loss function approximate the gradient paths of the Fβ score. Studies projective geometry and partial differential equations prolongation.
problem Understanding the prolongation of overdetermined geometric partial differential equations.
method Introduction to differential geometry and tractor calculus, study of prolongation of equations.
result Recovery of projective tractor and cotractor connections via partial differential equations prolongation.
The moduli space of smooth real binary octics has five connected components. They parametrize the real binary octics whose defining equations have 0, 1, ..., 4 complex-conjugate pairs of roots respectively. We show that the GIT-stable completion of each of these five components admits the structure of an arithmetic rea…
Paper solves a class of differential equations with specific solutions.
problem Identifying solutions to a class of nonlinear ODEs.
method Solves using a proposed side condition involving a third-order linear ODE.
result New closed and integral-form solutions for the Tzitzeica curve equation.
Stochastic mirror descent improves performance on ensemble models.
problem Improving performance of ensemble models using stochastic mirror descent.
method Utilizes mirror potential to influence training algorithm's implicit bias, mapping evolution to continuous time process.
result Converges to a nonlinear PDE in asymptotic regime of large networks, with mirror potential affecting gradient flow.
The training of stochastic neural network models with binary (±1) weights and activations via continuous surrogate networks is investigated. We derive new surrogates using a novel derivation based on writing the stochastic neural network as a Markov chain. This derivation also encompasses existing variants of the s…
Paper improves DP-ERM for binary linear classification with large-margin subsets.
problem Differentially private binary linear classification with large-margin subsets.
method Efficient (ε,δ)-DP algorithm with empirical zero-one risk bound. result Improved empirical zero-one risk bound for binary linear classification.
The paper generalizes Monge-Ampère equations and their solutions in differential geometry.
problem Understanding the structure of Monge-Ampère equations and their solutions.
method Generalizing Monge-Ampère equations to higher-order systems and proving their solutions correspond to integral manifolds of exterior differential systems.
result The Korteweg-de Vries (KdV) equation and Cauchy-Riemann equations are examples of generalized Monge-Ampère equations.
DiffEqFlux.jl is a library for fusing neural networks and differential equations. In this work we describe differential equations from the viewpoint of data science and discuss the complementary nature between machine learning models and differential equations. We demonstrate the ability to incorporate DifferentialEqua…
The paper examines the stability of binary choice models using Gini index and scoring indicators.
problem Stability and discriminatory power of binary choice models.
method Derives the real Gini index and incorporates PSI and KS statistics into the model.
result The real Gini index should be less than the calculated Gini index when the population distribution changes.
Classifies scalar second-order PDEs with low-dimensional symmetry groups.
problem Classifying differential equations with specific symmetry groups.
method Algebraic technique based on covariant form for constructing equations.
result Complete classification of quasi-linear scalar second-order PDEs with free symmetry groups of dimension ≤3.
Machine learning helps create accurate models of neutron star postmerger signals.
problem Creating accurate postmerger waveforms for binary neutron stars is challenging due to theoretical uncertainties and limited numerical simulations.
method Used a conditional variational autoencoder (CVAE) to construct postmerger models based on numerical-relativity simulations.
result The CVAE can accurately generate postmerger waveforms and encode the neutron star equation of state.
New algorithm corrects bias in LDP-released data for better analysis.
problem Bias in data released under Local Differential Privacy (LDP).
method Inverse Weierstrass Private Stochastic Gradient Descent (IWP-SGD).
result Converges to true population risk minimizer at O(1/n) rate. We investigate the effect of tax evasion on the income distribution and the inequality index of a society through a kinetic model described by a set of nonlinear ordinary differential equations. The model allows to compute the global outcome of binary and multiple microscopic interactions between individuals. When evas…
Neural differential equations combine deep learning and differential equations for modeling complex systems.
problem Modeling complex systems with high capacity and efficiency.
method Combining neural networks and differential equations, focusing on neural ordinary, controlled, and stochastic differential equations.
result NDEs offer high-capacity function approximation, strong priors, and handle irregular data efficiently.
Neural networks can approximate complex stochastic equations well.
problem Approximating general stochastic differential equations.
method Identified neural network classes approximating continuous functions.
result Neural stochastic differential equations can approximate general stochastic differential equations arbitrarily well.
A new deep learning model for tabular data improves accuracy over GBDT.
problem Improving accuracy in tabular data classification.
method Differentiable forest with sparse attention mechanism.
result The differentiable forest achieves higher accuracy than GBDT on tabular datasets.
New method solves PDEs for any initial condition without retraining.
problem Solving PDEs for different initial conditions requires retraining neural solvers.
method Formulate solution as conditional probability distribution.
result Approximates PDE solution for arbitrary initial conditions.