The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.
problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.
New algorithm recovers sparse binary vectors from generalized linear measurements efficiently.
problem Recovering sparse binary vectors from generalized linear measurements.
method Linear estimation algorithm and information theoretic lower bounds.
result Optimal sample complexity of O((k+σ2)logn) for noisy one bit quantized linear measurements. Study on recovering supports of multiple sparse vectors from mixed linear measurements.
problem Recovering supports of multiple sparse vectors from a mixture of linear measurements.
method Developed algorithms to identify the support of all component vectors using polynomial and quasi-polynomial number of measurements.
result Polynomial and quasi-polynomial number of measurements sufficient for recovering the supports of all component vectors.
A new complexity measure for neural networks improves upon classical methods.
problem Lack of a refined complexity measure for comparing different neural network architectures, especially permutation-invariant ones.
method Introduced an equivalence relation among linear functions and counted them relative to this relation.
result The new complexity measure clearly distinguishes between different models and increases exponentially with depth.
Paper addresses group synchronization with incomplete measurements and proves linear convergence of GPM.
problem Orthogonal group synchronization with incomplete measurements and additive noise.
method Generalized power method (GPM) with local error bound analysis.
result Linear convergence of GPM to a global maximizer under general additive noise model.
New tools study curvature measures of convex bodies, revealing structured spaces.
problem Investigate translation invariant curvature measures of convex bodies.
method Introduce new tools to study curvature measures, proving conjectures about their structure.
result Space of curvature measures has length at most 2 as a representation of the general linear group in degrees 0 and n-2.
We study phase retrieval from magnitude measurements of an unknown signal as an algebraic estimation problem. Indeed, phase retrieval from rank-one and more general linear measurements can be treated in an algebraic way. It is verified that a certain number of generic rank-one or generic linear measurements are suffici…
We analyzed optimism in linear and kernel regression models.
problem Understanding predictive complexity in regression models.
method Derived closed-form asymptotic optimism for linear and kernel regression models.
result Scaled optimism is a useful measure for model complexity.
We generalize Quasi-Linear Means by restricting to the tail of the risk distribution and show that this can be a useful quantity in risk management since it comprises in its general form the Value at Risk, the Tail Value at Risk and the Entropic Risk Measure in a unified way. We then investigate the fundamental propert…
Simplified proof for dimension reduction of polygonal curves.
problem Preserving the continuous Fréchet distance of polygonal curves.
method Sparse oblivious subspace embeddings for generalized dissimilarity measures.
result Generalized dimension reduction technique works for various distance measures.
The paper studies robust risk measures with linear penalties under uncertain distributions.
problem Risk measurement under distributional uncertainty.
method Robust distortion risk measures with linear penalty function under distributional constraints.
result Explicit characterization of optimal quantile distribution and value function.
Optimal sampling strategy improves prediction accuracy with surrogate variables under measurement constraints.
problem Measurement-constrained datasets and lack of labeled data.
method A-optimality criterion for optimal sampling, leveraging surrogate variables.
result Achieves lower asymptotic variance and reduced empirical mean squared error.
New method detects causal relationships from noisy measurements.
problem Discover causal relationships from noisy, imperfect measurements.
method Transformed Independent Noise (TIN) condition and ordered group decomposition.
result Identifies causal graph structure without over-complete ICA.
Proposes a new dependency function for measuring non-linear relationships.
problem Need for a general-purpose measure of dependency between random variables.
method Revision of ideal properties and proposal of a new dependency function.
result Proposes a new dependency function that meets all desired properties.
We consider various notions of strains; quantitative measures for the deviation of a linear transformation from an isometry. The main approach, which is motivated by physical applications and follows the work of Patrizio Neff and co-workers , is to select a Riemannian metric on GLn, and use its induced geodes…
The paper establishes new inequalities for Finsler measure spaces.
problem Developing inequalities for Finsler measure spaces.
method Study of linearized heat semigroup and application of Li-Yau's inequalities.
result Established new Li-Yau's type inequalities for Finsler measure spaces.
Signal retrieval from a series of indirect measurements is a common task in many imaging, metrology and characterization platforms in science and engineering. Because most of the indirect measurement processes are well-described by physical models, signal retrieval can be solved with an iterative optimization that enfo…
New measures detect asymmetries, non-linearity in stock returns.
problem Detecting asymmetries and non-linearity in stock returns.
method Proposed non-linear, local, invariant dependence measures; nonparametric estimator proven.
result Measures show tail asymmetry, non-linearity, risk buildup during market distress.
Paper proposes LANN to measure model complexity of neural networks with curve activation functions.
problem Measuring model complexity of neural networks with curve activation functions.
method Proposes LANN, a piecewise linear framework to approximate curve activation functions, and derives complexity measure based on the number of linear regions.
result Demonstrates positive correlation between overfitting and model complexity during training.
The paper extends optimal transport for linear separability of sheared distributions in supervised learning.
problem Learning on the space of probability measures using shifts and scalings.
method Embedding probability measures into L2 spaces using optimal transport, then applying regular machine learning techniques. result Sheared distributions can be linearly separated under certain conditions, with bounds on transformations.
SKOLR uses linear RNNs to approximate Koopman operators for time-series forecasting.
problem Nonlinear dynamical system analysis and time-series forecasting with infinite-dimensional Koopman operators.
method Established a connection between Koopman operator approximation and linear RNNs, integrating learnable spectral decomposition and MLP.
result SKOLR delivers exceptional performance in various forecasting benchmarks and dynamical systems.
The paper develops a robust signal estimation method for noisy measurements from generative models.
problem Signal estimation from noisy non-linear measurements with adversarial corruptions.
method Generalized Lasso approach with sub-Gaussian measurements and adversarial noise consideration.
result The method requires $O\left(\frac{k}{ε^2}\log L
ight)$ samples for ε-error recovery, robust to adversarial noise. Information transfer between time series is calculated by using the asymmetric information-theoretic measure known as transfer entropy. Geweke's autoregressive formulation of Granger causality is used to find linear transfer entropy, and Schreiber's general, non-parametric, information-theoretic formulation is used to …
Study on risk contributions of portfolios using lambda quantile risk measures.
problem No known allocation rule for non-positively homogeneous risk measures.
method Defined lambda quantiles on portfolio compositions, derived derivatives, and introduced generalized Euler contributions.
result Explicit formulae for the derivatives of lambda quantiles, showing their homogeneity properties.
Agents learn state ambiguity from non-linear sensor data using Gaussian approximations.
problem Learning state representation from non-linear sensor data.
method Second-order Taylor approximation of Gaussian distribution for non-linear measurement functions.
result Induces a preference for states based on inferability from observations.
We consider a class of linear-programming based estimators in reconstructing a sparse signal from linear measurements. Specific formulations of the reconstruction problem considered here include Dantzig selector, basis pursuit (for the case in which the measurements contain no errors), and the fused Dantzig selector (f…
Generative models use latent abstractions to create images.
problem Understanding how generative models create high-dimensional data like images.
method Developed a theoretical framework using SDE and information theory.
result Diffusion models can be seen as a non-linear filter driven by latent abstractions.
We determine the minimal entropy martingale measure for a general class of stochastic volatility models where both price process and volatility process contain jump terms which are correlated. This generalizes previous studies which have treated either the geometric Lévy case or continuous price processes with an ortho…
Develops high-dimensional measurement error models for non-linear loss functions.
problem Measurement errors in ultrahigh-dimensional biomedical data.
method Lipschitz loss functions, L1 norm minimization, Lasso analog.
result Improved accuracy in classification and quantile regression problems.
Refined theorem on linear perturbations with applications in singularity theory and optimization.
problem Linear perturbations and their implications in singularity theory and optimization.
method New perspective of Hausdorff measures for refined transversality theorem.
result Applications in singularity theory and optimization.
We introduce a new distance metric for non-linear embeddings of Tempered Exponential Measures.
problem Non-linear embeddings of Tempered Exponential Measures (TEMs).
method Parameterization of finite discrete TEMs via Legendre functions, introducing tempered Hilbert co-simplex distance.
result Established a generalization of the Hilbert log cross-ratio simplex distance to a tempered Hilbert co-simplex distance.
We propose three measures of mutual dependence between multiple random vectors. All the measures are zero if and only if the random vectors are mutually independent. The first measure generalizes distance covariance from pairwise dependence to mutual dependence, while the other two measures are sums of squared distance…
A new method to measure neural network expressiveness using tighter upper bounds.
problem Measuring the expressiveness of deep neural networks (DNNs).
method Proposes a new tighter upper bound for the number of linear regions in rectifier networks, using matrix computation.
result The proposed upper bound is tighter than existing ones and explains the performance improvements of skip connections and residual structures.
In previous work, theoretical analysis based on the tensor Restricted Isometry Property (t-RIP) established the robust recovery guarantees of a low-tubal-rank tensor. The obtained sufficient conditions depend strongly on the assumption that the linear measurement maps satisfy the t-RIP. In this paper, by exploiting the…
Develops a new model for synthesizing and analyzing probability measures.
problem Synthesis and analysis of probability measures.
method Linear barycentric coding model (LBCM) using linear optimal transport (LOT) metric.
result Closed-form solution to 2-Wasserstein barycenters for compatible measures.
Risk-aware linear bandits optimize against adverse outcomes.
problem Optimizing decisions under risk in sequential decision-making problems.
method Proposed an optimistic UCB algorithm for contextual bandits with convex loss minimization.
result Regret guarantees similar to generalized linear bandits with convex optimization at each round.
We study coherent risk measures which are time-consistent for multiple filtrations. We show that a coherent risk measure is time-consistent for every filtration if and only if it is one of four main types. Furthermore, if the risk measure is strictly monotone it is linear, and if the reference probability space is not …
New algorithm learns linear dynamical systems from measurements.
problem Learning system dynamics from linear measurements efficiently and accurately.
method Method of moments estimator to directly estimate Markov parameters.
result First polynomial time algorithm for learning linear dynamical systems.
Complex problems may require sophisticated, non-linear learning methods such as kernel machines or deep neural networks to achieve state of the art prediction accuracies. However, high prediction accuracies are not the only objective to consider when solving problems using machine learning. Instead, particular scientif…
Non linear sigma models are quantum field theories describing, in the large deviations sense, random fluctuations of harmonic maps between a Riemann surface and a Riemannian manifold. Via their formal renormalization group analysis, they provide a framework for possible generalizations of the Hamilton-Perelman Ricci fl…
This paper improves support recovery in universal one-bit compressed sensing with fewer measurements.
problem Support recovery in universal one-bit compressed sensing.
method Developed algorithms to recover the support of sparse signals with a small number of false positives.
result Support recovery with ildeO(k3/2) measurements, improving to ildeO(k) with known dynamic range. Phase retrieval refers to the problem of recovering real- or complex-valued vectors from magnitude measurements. The best-known algorithms for this problem are iterative in nature and rely on so-called spectral initializers that provide accurate initialization vectors. We propose a novel class of estimators suitable fo…
Improved neural network reconstruction from sparse measurements with theoretical guarantees.
problem Improving neural network performance in sparse signal reconstruction from few measurements.
method Combining iterative reconstruction algorithms with neural networks, analyzing generalization properties, and deriving a generalization bound.
result Theoretical guarantees for neural network reconstruction from compressive linear measurements, with generalization error scaling logarithmically in the number of layers and linearly in the number of measurements.
Bounds on factual and counterfactual distributions under measurement error in discrete models.
problem Measurement errors in discrete data and their impact on inference.
method Expressing modeling assumptions as linear constraints and using linear programming to derive bounds.
result Sharp bounds on factual and counterfactual distributions for various models, including instrumental variable scenarios.
We generalize the notion of cusp excursion of geodesic rays by introducing for any k≥1 the kth excursion in the cusps of a hyperbolic N-manifold of finite volume. We show that on one hand, this excursion is at most linear for geodesics that are generic with respect to the hitting measure of a random walk.…
A Generative Adversarial Network (GAN) with generator G trained to model the prior of images has been shown to perform better than sparsity-based regularizers in ill-posed inverse problems. Here, we propose a new method of deploying a GAN-based prior to solve linear inverse problems using projected gradient descent (…
Paper solves tracking control for (x,u)-flat systems using classical states.
problem Tracking control for (x,u)-flat systems. method Quasi-static feedback of classical states.
result Achieves linear, decoupled and asymptotically stable tracking error dynamics.
Measurement noise limits the advantage of nonlinear models over linear models in biomedical prediction
problem Nonlinear models vs. linear models in biomedical prediction
method Measurement reliability
result Measurement noise blurs the population-optimal predictor