Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

85169254338 · Jun 202019922001200920172026
48 results for differential constraint

Stabilized neural differential equations enforce constraints on dynamical systems.

problem Ensuring dynamical systems preserve known constraints like conservation laws.
method SNDEs with a stabilization term to enforce manifold constraints.
result SNDEs outperform existing methods and broaden constraint types.

Differentially private algorithms for submodular maximization under various constraints.

problem Maximizing decomposable submodular functions under constraints while preserving privacy.
method Designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints.
result Improved utility guarantees and competitive performance compared to non-private algorithms.

Algorithm ensures privacy while strictly adhering to constraints.

problem Differential privacy with linear constraints that must be strictly followed.
method Developed an algorithm that releases a nearly-optimal solution satisfying constraints with probability 1.
result Achieved nearly optimal performance while preserving privacy and strictly adhering to constraints.

New DAG constraints improve differentiable DAG learning.

problem Recovering DAG structures from observational data is hard due to combinatorial optimization.
method Developed analytic functions to formulate DAG constraints, closed under differentiation, summation, and multiplication.
result Analytic DAG constraints outperform previous methods in various settings.

PNDEs project neural dynamics onto constraint manifolds, improving accuracy and stability.

problem Learning dynamics from data without violating known constraints.
method Projecting the learned vector field onto the tangent space of the constraint manifold.
result PNDEs outperform existing methods in learning constrained dynamical systems.

HardCoRe-NAS finds fitting neural networks adhering to hard resource constraints.

problem Finding fitting neural networks that adhere to hard resource constraints.
method Accurate formulation of resource requirement and scalable search method.
result HardCoRe-NAS generates state-of-the-art architectures strictly satisfying hard resource constraints.

Paper tackles nonparametric classification with privacy constraints, achieving optimal accuracy.

problem Nonparametric classification under distributed differential privacy constraints.
method Minimax and adaptive transfer learning, considering privacy, sample sizes, and heterogeneity.
result Developed an adaptive classifier achieving optimal misclassification rate with privacy constraints.

Improved sampling from Gaussian distributions with privacy constraints.

problem Sampling from unbounded Gaussian distributions with differential privacy.
method First $\widetilde{\mathcal{O}}\left(d ight)$-sample algorithm for unbounded Gaussians under $\left(\varepsilon, δ ight)$-differential privacy.
result A quadratic improvement over previous results, settling an open question.

New principle for optimal control with higher order differential constraints.

problem Optimal control problems with higher order differential constraints.
method Derivation of the Principle of Minimal Labour and generalization of Pontryagin Maximum Principle.
result Generalized Pontryagin Maximum Principle for higher order constraints.

Geometric theory explains substitutability in market outcomes based on production constraints.

problem Understanding substitutability in markets with structured feasible products.
method Modeling the set of feasible products as a compact Riemannian manifold to study intrinsic geometry and its effects on substitutability.
result Intrinsic geometry of the feasible set governs substitutability and market outcomes, with curvature controlling technological substitution elasticity.

DiffSlack learns neural networks with nonlinear constraints via learnable slack variables.

problem Enforcing nonlinear inequality constraints in neural networks.
method DiffSlack reformulates inequalities as equalities with learnable slack variables, predicting them as part of the network output.
result DiffSlack achieves higher planning success rates and stronger geometric constraint satisfaction compared to existing methods.

Framework for robust decision making in changing environments with privacy constraints.

problem Interactive decision making in changing environments with constraints.
method Hybrid Decision Making with Structured Observations (hybrid DMSO) framework, local differentially private decision making, query-based learning, robust and smooth decision making.
result Strong connections and bounds derived for DEC, SQ dimension, local minimax complexity, learnability, and joint differential privacy.

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.

Paper studies optimal federated learning for nonparametric regression with privacy constraints.

problem Federated learning for nonparametric regression with heterogeneous differential privacy constraints.
method Proposes distributed privacy-preserving estimators and investigates their risk properties.
result Establishes matching minimax lower bounds for global and pointwise estimation.

HardNet adds hard constraints to neural networks without sacrificing performance.

problem Ensuring adherence to input-dependent constraints in neural networks.
method Appends a differentiable enforcement layer to neural networks for end-to-end training with hard constraint guarantees.
result HardNet retains neural networks' universal approximation capabilities and enables efficient optimization.

The paper solves a consumption-investment problem with state-dependent lower bounds.

problem A life-time consumption-investment problem with a state-dependent lower bound on consumption.
method Transformed the problem into a state-independent control problem to apply standard theory.
result Explicit optimal strategies provided for both homogeneous and non-homogeneous constraints.

Solves second-order PDEs using quotients and differential invariants.

problem Solving second-order PDEs with first-order quotients.
method Solve the quotient PDE using differential invariants, then add new constraints to solve the original PDE.
result New method for solving second-order scalar PDEs with infinite-dimensional symmetry algebras.

SnareNet adds repair layers to neural networks to ensure outputs meet physical constraints.

problem Unconstrained neural network predictions violate physical or safety requirements.
method SnareNet appends a differentiable repair layer that navigates constraints to produce feasible outputs.
result SnareNet consistently improves objective quality while satisfying constraints more reliably.

Study on surfaces in Heisenberg group with constant mean curvature.

problem Constant mean curvature surfaces in the Heisenberg group.
method Proves surfaces in a neighborhood of non-umbilic points are solutions to a sinh-Gordon equation with a differential constraint.
result Surfaces in Heisenberg group with constant mean curvature described by solutions to sinh-Gordon equation.

New methods reduce computational cost for Gaussian Markov Random Fields with sparse constraints.

problem Inference and simulation of GMRFs are computationally prohibitive with many constraints.
method Proposes a basis transformation into blocks of constrained and non-constrained subspaces.
result Significantly outperforms existing alternatives in computational cost.

We consider the problem of learning Markov Random Fields (including the prototypical example, the Ising model) under the constraint of differential privacy. Our learning goals include both structure learning, where we try to estimate the underlying graph structure of the model, as well as the harder goal of parameter l…

2020-02-21abs ↗pdf ↗

New method combines gradient optimization with constraint-based techniques for causal discovery.

problem Causal discovery from observational data, especially with small sample sizes.
method Differentiable dd-separation scores using percolation theory and soft logic for gradient-based optimization of conditional independence constraints.
result Empirical evaluations show robust performance in low-sample regimes, surpassing traditional methods.

Reduces Lie (bi-)algebroids and Dirac manifolds using constraint vector bundles.

problem Reduction of Lie (bi-)algebroids and Dirac manifolds.
method Introduces constraint manifolds and constraint vector bundles; proves constraint Serre-Swan theorem; introduces Cartan calculus for constraint forms and multivector fields; shows compatibility with reduction.
result Reduction procedure for Lie (bi-)algebroids and Dirac manifolds.

Extends compactness theory to variable-coefficient pseudo-differential operators on manifolds.

problem Compensated compactness for pseudodifferential operators on vector bundles.
method Establishes a theorem for weakly convergent sequences of sections under a pseudo-differential operator.
result Quadratic form converges in distributional sense under certain conditions.

Solves optimal stopping problem with Poisson constraints using jumps.

problem Optimal stopping with Poisson constraints and jumps.
method Penalized backward stochastic differential equation (PBSDE) with jumps, decomposition method based on Jacod-Pham, comparison theorem of BSDEs with jumps.
result Solves American option pricing in nonlinear markets with Poisson constraints.

Data processing inequalities link Fisher information to local differential privacy constraints.

problem Understanding how Fisher information scales with local differential privacy constraints.
method Developed data processing inequalities for Fisher information under local differential privacy.
result Implications for private estimation with optimal bounds and error rates.

A novel controller for wheeled robots handles joystick inputs for smooth steering.

problem Steering control for differential-drive wheeled robots from indirect joystick inputs.
method Developed a geometric controller based on Darboux frame kinematics.
result Smooth trajectories achieved with safety constraints and no desired states.

New method estimates discrete distributions while protecting privacy.

problem Estimating discrete distributions with local differential privacy.
method Combining robust learning and local differential privacy.
result Minimax estimation rate of εd/α2k+d2/α2knε\sqrt{d/α^2 k}+\sqrt{d^2/α^2 kn} under privacy constraint.

Paper addresses FL over MAC with DP constraints, proposing a novel consensus scheme.

problem Federated learning over a multiple access channel with differential privacy constraints.
method Proposes a novel consensus scheme using digital distributed stochastic gradient descent (D-DSGD) with artificial noise to preserve DP.
result Demonstrates improved convergence rate and DP level for a given MAC capacity.

The concept of $\Zn$-supermanifold has been recently proposed as a natural generalization of classical ($\Zs$-graded) supergeometry, allowing for more complicated commutativity constraints. Here we continue the study of $\Zn$-supergeometry by developing the foundations of differential calculus on $\Zn$-supermanifolds.

2016-08-02abs ↗pdf ↗

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.

The ``classical BRST construction'' as developed by Batalin-Fradkin-Vilkovisky is a homological construction for the reduction of the Poisson algebra P=C(W)P = C^\infty (W) of smooth functions on a Poisson manifold WW by the ideal II of functions which vanish on a constraint locus. This ideal is called first class if II

1996-03-24abs ↗pdf ↗

Paper studies federated nonparametric testing with privacy constraints, achieving optimal rates and adaptive testing.

problem Federated nonparametric goodness-of-fit testing under distributed differential privacy constraints.
method Establishes matching lower and upper bounds on minimax separation rate, constructs adaptive testing procedure.
result Achieves optimal rates and demonstrates phase transition phenomena in federated testing.

Study discretizes Dirac and port-Hamiltonian systems using manifolds.

problem Discretization of Dirac and port-Hamiltonian systems.
method Retraction and discretization maps on manifolds for Dirac structures, applied to port-Hamiltonian systems.
result Numerical integrators for port-Hamiltonian systems derived from discretization techniques.