Characterizes problems solvable via linear convergence algorithms.
problem Optimization problems solvable with linear convergence.
method Riemannian gradient descent.
result Characterized problems solvable via linear convergence.
Paper solves stochastic contextual linear bandits using linear bandit algorithms.
problem Stochastic contextual linear bandits with unknown context distribution.
method Establishes a reduction framework to convert to linear bandit problems.
result Achieves nearly optimal regret bound of O ( d T log T ) O(d\sqrt{T\log T}) O ( d T log T ) . New method solves linear inverse problems using diffusion models.
problem Linear inverse problems in various domains.
method Posterior sampling with latent diffusion models.
result Provable sample recovery in linear models, outperforming previous methods.
The classical multi-set split feasibility problem seeks a point in the intersection of finitely many closed convex domain constraints, whose image under a linear mapping also lies in the intersection of finitely many closed convex range constraints. Split feasibility generalizes important inverse problems including con…
Solves a challenging case of Nijenhuis operator linearization in 2D.
problem Linearization of Nijenhuis operators around a point of scalar type in 2D.
method Analyzes left-symmetric algebra \(\mathfrak{b}_{1, \alpha}\) and relates it to vector field linearization.
result Completes the solution of the linearization problem for Nijenhuis operators in 2D.
Paper proposes a new activation function to reduce overfitting and large weight update issues.
problem Overfitting and large weight update problems in neural networks.
method Introduces a new activation function called Thresholded Exponential Rectified Linear Units (TERELU).
result TERELU shows better performance in reducing overfitting and large weight update issues compared to other activation functions.
Optimal algorithm for identifying best arm in stochastic linear bandits with fixed confidence.
problem Identifying the best arm in stochastic linear bandits with fixed confidence.
method Extending an algorithm designed for Best Arm Identification to the ε ε ε -Thresholding Bandit Problem (TBP). result Asymptotically optimal algorithm for TBP.
New classifier combines locally linear kernels for fast and accurate non-linear classification.
problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a ℓ 1 \ell_1 ℓ 1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels. result The resulting classifier achieves high accuracy with fast inference time.
MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.
problem Solving ill-posed linear inverse problems in Bayesian settings.
method Exploiting SGM structure, defining a sequence of intermediate problems, and using SMC methods.
result MCGDiff outperforms competing methods in Bayesian ill-posed inverse problems.
Real-world problems of operations research are typically high-dimensional and combinatorial. Linear programs are generally used to formulate and efficiently solve these large decision problems. However, in multi-period decision problems, we must often compute expected downstream values corresponding to current decision…
Efficient algorithms speed up adversarial training for linear models.
problem Adversarial training for linear models is computationally expensive.
method Tailored optimization algorithms for regression and classification.
result Significantly faster convergence rates for large-scale problems.
Study Loday algebroids, prove splitting theorem, and linearize problems.
problem Splitting and linearization of Loday algebroids.
method Local splitting-type results, Euler-like derivations.
result Established a general linearization principle.
Graph neural networks improve solving linear optimization problems.
problem Improving the efficiency of solving linear optimization problems.
method Using graph neural networks to simulate standard interior-point methods for linear optimization problems.
result Graph neural networks can solve linear optimization problems close to optimality, often outperforming conventional solvers.
Unified approach for optimizing predictions in linear programming and inverse problems.
problem Optimizing predictions in linear programming and inverse problems.
method Maximum optimality margin approach.
result Unified approach that balances computational efficiency and theoretical properties.
We reformulate LIPs as min-max problems for easier solution.
problem Recovering signals from few linear measurements.
method Proposed a min-max reformulation of LIPs.
result Saddle points characterize solutions to LIPs.
We consider the problem of solving mixed random linear equations with k k k components. This is the noiseless setting of mixed linear regression. The goal is to estimate multiple linear models from mixed samples in the case where the labels (which sample corresponds to which model) are not observed. We give a tractable a…
Paper uses SGD for solving linear inverse problems, improving empirical performance.
problem Solving statistical inverse problems in science and engineering.
method Stochastic Gradient Descent (SGD) for linear inverse problems, with smoothing techniques.
result Consistency and finite sample bounds for excess risk demonstrated.
Efficiently solves inverse PDE problems with Gaussian processes.
problem Solving inverse problems in linear PDEs with noisy data.
method Gaussian process regression with algebraic priors.
result High accuracy and computational efficiency achieved.
A new algorithm improves stochastic linear bandit performance using residual bootstrap.
problem Improving performance in stochastic linear bandit problems.
method Residual bootstrap exploration to estimate mean reward and pull the arm with the highest estimate.
result Proposed algorithm exttt{LinReBoot} achieves high-probability sub-linear regret under mild conditions.
AM converges super-linearly for solving mixed linear regression problems.
problem Learning linear regressors from unlabeled observations in multiple linear regression models.
method Alternating Minimization (AM) algorithm, which alternates between label estimation and regression solving.
result AM converges super-linearly in certain parameter regimes, requiring only O(log log(1/ε)) iterations to achieve an error of ε.
New method for estimating parameters in inverse problems using double robustness.
problem Estimating parameters defined as linear functionals of solutions to linear inverse problems.
method Source condition double robust inference method that uses iterated Tikhonov regularized adversarial estimators.
result Asymptotic normality of the parameter of interest as long as either the primal or dual inverse problem is sufficiently well-posed.
The paper tightens the regret rate for linear bandit problems.
problem Bayesian regret in linear bandit problems.
method Information-theoretic framework and chaining argument.
result Established a new bound with a tight rate of O ( d T ) O(d\sqrt{T}) O ( d T ) . New method distinguishes feature relevance in non-linear contexts.
problem Finding relevant features with preserved redundancies.
method Random forest models and statistical methods.
result Distinguishes strong from weak feature relevance in non-linear problems.
In this article we dwell into the class of so called ill posed Linear Inverse Problems (LIP) in machine learning, which has become almost a classic in recent times. The fundamental task in an LIP is to recover the entire signal / data from its relatively few random linear measurements. Such problems arise in variety of…
Physics-informed GP regression solves eigenvalue problems by identifying non-trivial eigenspaces.
problem Solving eigenvalue problems of linear operators with trivial solutions.
method Constructing a transfer function-type indicator using physics-informed Gaussian Process posterior.
result The posterior covariance is non-trivial only for eigenvalues of the operator, indicating non-trivial eigenspaces.
Two algorithms solve nonconvex minimax problems with linear constraints, achieving complexity guarantees.
problem Nonconvex minimax problems with coupled linear constraints.
method Zeroth-order primal-dual alternating projected gradient (ZO-PDAPG) and zeroth-order regularized momentum primal-dual projected gradient (ZO-RMPDPG) algorithms.
result Iteration complexity guarantees for solving nonconvex-(strongly) concave minimax problems with coupled linear constraints.
We consider optimal investment problems for a diffusion market model with non-observable random drifts that evolve as an Ito's process. Admissible strategies do not use direct observations of the market parameters, but rather use historical stock prices. For a non-linear problem with a general performance criterion, th…
We show that fundamental learning tasks, such as finding an approximate linear separator or linear regression, require memory at least \emph{quadratic} in the dimension, in a natural streaming setting. This implies that such problems cannot be solved (at least in this setting) by scalable memory-efficient streaming alg…
Characterizes kernel of linearization for minimal surfaces problem
problem Characterizing kernel of linearization for minimal surfaces problem
method Show kernel consists of potential fields and TT fields
result In whole-space Euclidean decomposition, kernel consists of potential fields and TT fields
Algorithm solves word problem in mapping class group quickly.
problem Word problem in mapping class group of a surface.
method Quasi-linear time algorithm (O(n log^3(n))).
result Solves word problem efficiently.
Study solves inverse problems for equations with fractional nonlinearities.
problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.
New algorithms tackle RKHS bandits with reduced complexity and improved performance.
problem Adversarial and stochastic RKHS bandit problems with high computational complexity.
method Combining approximation theory with misspecified linear bandit methods.
result First general algorithm for adversarial RKHS bandit problem.
Proves linear extension of isometries in smooth 2D Banach spaces.
problem Linear extension of isometries in absolutely smooth 2D Banach spaces.
method Analyzes isometries between unit spheres of smooth Banach spaces.
result Any isometry extends to a linear isometry of Banach spaces.
The paper analyzes the sample complexities for policy evaluation with linear function approximation.
problem Policy evaluation with linear function approximation in discounted infinite horizon Markov decision processes.
method Investigates sample complexities for two policy evaluation algorithms: TD and TDC.
result Establishes high-probability sample complexity bounds for policy evaluation algorithms.
The paper improves SVR with linear constraints for better model properties.
problem Improving Support Vector Regression with linear constraints.
method Generalized SMO algorithm for solving optimization with linear constraints.
result The proposed method shows better practical performance on various datasets.
DART optimizes subset selection in non-linear bandit problems.
problem Optimizing subset selection in non-linear bandit problems with correlated rewards.
method DART algorithm for combinatorial bandits without individual arm feedback or linearity assumption.
result DART achieves a regret bound of i l d e O ( K K N T ) ilde{\mathcal{O}}(K\sqrt{KNT}) i l d e O ( K K N T ) . GD outperforms ridge regression and SGD in linear regression problems.
problem Comparing the risks of GD, ridge regression, and SGD in linear regression problems.
method Instance-wise finite-sample risk analysis of GD, ridge regression, and SGD.
result GD outperforms ridge regression and is incomparable with SGD in some cases.
Financial portfolios are often optimized for maximum profit while subject to a constraint formulated in terms of the Conditional Value-at-Risk (CVaR). This amounts to solving a linear problem. However, in its original formulation this linear problem has a very large number of linear constraints, too many to be enforced…
Jump Markov linear models consists of a finite number of linear state space models and a discrete variable encoding the jumps (or switches) between the different linear models. Identifying jump Markov linear models makes for a challenging problem lacking an analytical solution. We derive a new expectation maximization …
Study non-linear combinatorial bandits with polynomial rewards, finding significant differences from linear cases.
problem Adversarial combinatorial bandits with general non-linear reward functions.
method Extending existing work on adversarial linear combinatorial bandits, analyzing minimax optimal regret for polynomial and non-polynomial reward functions.
result Minimax optimal regret bounds for adversarial combinatorial bandits with general non-linear reward functions.
Paper models non-linear dynamics from time series data.
problem Modeling non-linear dynamical systems from time series data.
method Introduces latent state modeling and a novel alternating minimization algorithm.
result LaNoLem achieves competitive performance in dynamics estimation and prediction.
The paper examines scalar fourth-order linear differential operators and their invariants.
problem Equivalence problem of scalar fourth-order linear differential operators.
method Investigation of differential invariants.
result Application of differential invariants to the equivalence problem.
New algorithms improve linear bandit performance with low computation.
problem Optimizing reward in linear stochastic bandits.
method Reward-biased maximum likelihood method modified for linear and generalized linear bandits.
result New policies achieve order-optimality and competitive empirical performance.
We develop a theory for solving continuous time optimal stopping problems for non-linear expectations. Our motivation is to consider problems in which the stopper uses risk measures to evaluate future rewards.
Efficiently extracts linear dynamics from complex observations.
problem Learning policies directly from rich, high-dimensional observations.
method Modeling linear dynamics in a hidden subspace and developing an efficient algorithm.
result Successfully extracts linear dynamics from rich observations.
In this article we study the linearized anisotropic Calderon problem. In a compact manifold with boundary, this problem amounts to showing that products of harmonic functions form a complete set. Assuming that the manifold is transversally anisotropic, we show that the boundary measurements determine an FBI type transf…
Solves Dirichlet problem for elliptic equations on Hermitian manifolds.
problem Solving Dirichlet problem for fully non-linear elliptic equations on Hermitian manifolds.
method Establishing a quantitative boundary estimate under a subsolution assumption.
result Derives solvability and regularity of the Dirichlet problem.
Paper studies Gaussian approximation in linear regression with rates derived.
problem Gaussian approximation in online linear regression.
method Derives rates for constant learning rate settings, analyzes dependence on d d d and design matrix. result Rate of normal approximation is log n / n \sqrt{\log{n}/n} log n / n for large n n n .