New method learns low-dimensional models for systems with non-polynomial terms.
problem Modeling systems with non-polynomial nonlinear terms that are spatially local and given in analytic form.
method Non-intrusive model reduction method that learns operators for linear and polynomially nonlinear dynamics via a least-squares problem incorporating given non-polynomial terms.
result Comparable accuracy to intrusive methods that require full knowledge of governing equations.
The paper shows neural networks can approximate functions over non-compact domains with non-polynomial activation.
problem Approximating functions over non-compact domains using neural networks.
method Using single-hidden-layer feedforward neural networks with non-polynomial activation functions over non-compact subsets of Euclidean spaces.
result Neural networks can approximate functions in weighted Ck-spaces and weighted Sobolev spaces over unbounded domains. Quantum K-theory of quintic 3-fold conjectured with non-polynomial coefficients.
problem Reconstructing quantum K-theory for quintic 3-fold.
method Formulated explicit conjecture for small J-function and its q-difference equation.
result Coefficients of q-difference equations are non-polynomial functions of Gopakumar-Vafa invariants.
Non-polynomial growth harmonic maps from the complex plane to the hyperbolic space are studied. Some non-surjectivity results are obtained. Moreover, images of such harmonic maps are investigated with reference to their Hopf differentials.
New bounds show complex neural networks need many queries to learn.
problem Learning non-polynomial activation functions with Gaussian marginals.
method Gradient boosting procedure to amplify lower bounds on SQ dimension of neural networks.
result Statistical-query lower bounds for ReLU regression with 2ncε queries. The action of the mapping class group of the thrice-punctured projective plane on its GL(2,C) character variety produces an algorithm for generating the simple length spectra of quasi-Fuchsian thrice-punctured projective planes. We apply this algorithm to quasi-Fuchsian representations of the corres…
We study the uniqueness of a vortex equation involving an entire function on the complex plane. As geometric applications, we show that there is a unique harmonic map u:C→H2 satisfying ∂u=0 with prescribed polynomial Hopf differential; there is a unique affine spherical imm…
Study examines null vector fields on Lorentzian manifolds.
problem Understanding the structure of null vector fields on Lorentzian manifolds.
method Investigates the bundle structure and ternary product of nowhere vanishing null vector fields.
result Null tangent bundle is a non-polynomial graded bundle with a para-associative ternary product.
Neural networks can approximate functions uniformly across various measures.
problem Universal approximation of functions across different probability measures.
method Proving neural networks are dense in Orlicz spaces, extending classical theorems.
result Neural networks uniformly approximate functions for weakly compact families of measures.
FNOs learn solution operators of dissipative equations efficiently via spectral methods.
problem Learning and approximation of solution operators for dissipative equations.
method Introducing spectral methods and deriving FNO approximation bounds and sample complexity guarantees.
result Polynomial sample complexity guarantees for FNOs learning solution operators of dissipative equations.
Data symmetries in neural networks can generate conserved quantities.
problem Conservation laws in neural networks
method Using tensorizable networks
result Data augmentation can induce conserved quantities
Wide neural networks can be closely approximated by Gaussian processes, with rates depending on the activation function's properties.
problem Approximating the behavior of wide neural networks using Gaussian processes.
method Established convergence rates for the central limit theorem in an infinite-dimensional functional space, using a transportation distance metric.
result Explicit convergence rates for neural networks approximated by Gaussian processes, varying based on the activation function's properties.
Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding the shortest route between two nodes on a graph. Meta-heuristic algorithms such as A∗ along with mixed-integer programming (MIP) methods …
The paper proves deep neural networks with analytic activation can approximate any function.
problem Approximating functions with neural networks using analytic activation functions.
method Elementary proofs for real and complex networks, Stone-Weierstrass theorem, Mergelyan's theorem.
result Closure of neural network classes equals space of polynomials for analytic activation.
Ehlers-Kundt conjecture is a physical assertion about the fundamental role of plane waves for the description of gravitational waves. Mathematically, it becomes equivalent to a problem on the Euclidean plane R2 with a very simple formulation in Classical Mechanics: given a non-necessarily autonomous potent…
New framework establishes positivity of DNTK for PINNs.
problem Establishing positivity of NTK for PINNs with multiple differential operators.
method Proposed Differential Neural Tangent Kernel (DNTK) for PINNs.
result Positivity of infinite width DNTK for various activation functions and differential operators.
UDENet and ResNet can approximate any function, with ODENet showing UAP for continuous functions.
problem Approximating any function using ODENet and ResNet.
method Proved UAP for ODENet and ResNet, derived gradient, and applied to various problems.
result UDENet and ResNet can approximate any function, with ODENet showing UAP for continuous functions.
Detecting correlated trees helps align sparse graphs.
problem Detecting correlation between trees for sparse random graphs.
method MPAlign message-passing algorithm for graph alignment.
result MPAlign succeeds in polynomial time for partial alignment.
Cryptotree enables accurate predictions on encrypted data using Random Forests.
problem Applying machine learning to private data while preserving confidentiality.
method Adapting Neural RF to CKKS scheme for HE operations on encrypted data.
result Cryptotree achieves better prediction results on encrypted data than regular RF.
In order to identify important variables that are involved in making optimal treatment decision, Lu et al. (2013) proposed a penalized least squared regression framework for a fixed number of predictors, which is robust against the misspecification of the conditional mean model. Two problems arise: (i) in a world of ex…
New method for MAP inference using Benders' decomposition.
problem Finite-time convergence guarantee for MAP inference.
method Sequentially adding constraints using Benders' decomposition.
result Higher optimal posterior value compared to other methods.
Quantum computing optimizes ESG portfolios efficiently.
problem Optimizing investment portfolios with risk, return, and ESG considerations.
method Formulated discrete Markowitz portfolio theory (DMPT) for quantum annealers, incorporating ESG ratings.
result Discrete portfolios converge to continuous solutions as budgets increase, outperforming traditional methods.
Improved MoE performance through perturbing cosine router.
problem Representation collapse and parameter redundancy in MoE models.
method Least square estimation of cosine router in MoE, followed by noise addition to improve convergence rates.
result Perturbed cosine router leads to polynomial convergence rates for MoE models.
CVNNs improve performance in tasks with complex-valued inputs.
problem Improving performance in tasks with complex-valued inputs.
method Analyze the approximation properties of complex-valued neural networks (CVNNs).
result Quantitative approximation bounds for CVNNs, showing error scales as m−k/(2n). At initialization, artificial neural networks (ANNs) are equivalent to Gaussian processes in the infinite-width limit, thus connecting them to kernel methods. We prove that the evolution of an ANN during training can also be described by a kernel: during gradient descent on the parameters of an ANN, the network functio…
We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems, and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of a…
Neural networks can approximate any continuous function with a single hidden layer.
problem Approximating any continuous function using neural networks.
method Direct algebraic proof and explicit quantification of hidden units required.
result Explicit bounds on the number of hidden units needed for approximation.
Model combines long-term and short-term memory using conceptors.
problem Transfer between long-term and short-term memory.
method Recurrent neural network with gated reservoir for short-term memory and conceptors for long-term memory.
result Standard operations on conceptors allow combining long-term memories and describing their effect on short-term memory.
Kernel method estimates long-term effects from short-term data.
problem Estimating long-term effects from short-term data in continuous actions.
method Kernel ridge regression to embed and extrapolate long-term effects.
result Uniform consistency and nonasymptotic error bounds for the estimator.
New framework estimates long-term outcomes from short-term data.
problem Estimating long-term outcomes from short-term data.
method Reward function decomposition-based framework (LOPE).
result LOPE outperforms existing methods, especially when surrogacy is violated.
The paper presents the comparative study of the nature of stock markets in short-term and long-term time scales with and without structural break in the stock data. Structural break point has been identified by applying Zivot and Andrews structural trend break model to break the original time series (TSO) into time ser…
TimeBridge addresses non-stationarity in long-term time series forecasting.
problem Non-stationarity in multivariate time series leads to spurious regressions and obscures long-term relationships.
method TimeBridge segments series into patches, applying Integrated Attention for short-term non-stationarity and Cointegrated Attention for long-term cointegration.
result TimeBridge achieves state-of-the-art performance in both short-term and long-term forecasting.
This paper balances short-term and long-term rewards in policy learning.
problem Balancing short-term and long-term rewards in policy learning.
method Formalizes a new framework to balance rewards, identifies rewards under mild assumptions, deduces efficiency bounds, and develops a policy learning approach.
result The proposed method improves the estimator of long-term reward and reduces regret.
This paper proposes a framework to predict long-term trends and short-term fluctuations in multivariate time series.
problem Existing prediction methods often ignore the distinction between long-term trends and short-term fluctuations.
method The paper introduces a MTS forecasting framework that uses both original time series and its first difference to capture long-term trends and short-term fluctuations.
result The proposed method improves forecasting performance by using more supervision information.
MTAdam optimizes multiple loss terms in neural models, balancing gradients dynamically.
problem Balancing multiple loss terms in neural model training is challenging and computationally demanding.
method Generalized Adam algorithm that computes separate derivatives and balances gradients across layers dynamically.
result Training with MTAdam leads to faster recovery from suboptimal initial loss weighting and matches conventional training outcomes.
We introduce here for the first time the long-term swap rate, characterised as the fair rate of an overnight indexed swap with infinitely many exchanges. Furthermore we analyse the relationship between the long-term swap rate, the long-term yield, see Biagini et al. [2018], Biagini and Härtel [2014], and El Karoui et a…
Enhanced word embedding creates new consumer-friendly health terms.
problem Laymen's health terms are often jargon and hard to understand.
method Developed an enhanced GloVe word embedding technique to generate new consumer-friendly terms.
result New CHV terms generated from consumer-generated text.
This paper uses Bayesian models to analyze CTA returns across short and long-term trends.
problem The relative merits and interactions of short- and long-term trend systems in CTA replication remain controversial.
method Dynamic decomposition of CTA returns into short-term trend, long-term trend, and market beta factors using a Bayesian graphical model.
result The blend of horizons shapes the strategy's risk-adjusted performance.
The paper tackles long-term treatment effects with persistent confounders using sequential short-term outcomes.
problem Estimating long-term treatment effects with persistent unmeasured confounders.
method Exploiting the sequential structure of short-term outcomes, the paper develops three novel identification strategies and corresponding estimators.
result The proposed methods outperform existing approaches in handling persistent confounders.
TimeMixer predicts global financial asset volatility, excelling in short-term forecasts.
problem Predicting volatility in global financial markets is challenging due to complexity and non-linear dynamics.
method Uses TimeMixer, a multiscale-mixing model for forecasting across different scales.
result TimeMixer performs exceptionally well in short-term volatility forecasting but less so in longer-term predictions.
We study the mean curvature flow with given non-smooth transport term and forcing term, in suitable Sobolev spaces. We prove the global existence of the weak solutions for the mean curvature flow with the terms, by using the modified Allen-Cahn equation that holds useful properties such as the monotonicity formula.
In this paper, we proposed a deep learning-based end-to-end method on the domain specified automatic term extraction (ATE), it considers possible term spans within a fixed length in the sentence and predicts them whether they can be conceptual terms. In comparison with current ATE methods, the model supports nested ter…
The study finds solar terms significantly impact China's stock market returns and volatility.
problem Investigating the effect of solar terms on China's stock market.
method Regression framework, analyzing multiple solar terms and their impact on return and volatility.
result Solar terms 1, 3, and 4 cause significant positive returns, while 8, 11, and 14 bring high volatility.
We derive a closed formula for the Heegaard Floer correction terms of lens spaces in terms of the classical Dedekind sum and its generalization, the Dedekind-Rademacher sum. Our proof relies on a reciprocity formula for the correction terms established by Ozsvath and Szabo. A consequence of our result is that the Casso…
Estimates long-term effects from short-term experiments and observational data with unobserved confounders.
problem Estimating long-term causal effects from short-term experiments and long-term observational data with unobserved confounding.
method Combining regression residuals with short-term experimental outcomes to create an instrumental variable for estimating long-term causal effects.
result The estimator is unbiased and its variance is analytically studied.
A new term weighting scheme TF-IDFC-RF outperforms others in sentiment analysis.
problem Improving text classification in sentiment analysis.
method Proposes a novel supervised term weighting scheme TF-IDFC-RF and compares it with other schemes.
result TF-IDFC-RF outperforms all other schemes on two sentiment analysis datasets.
In information retrieval (IR) and related tasks, term weighting approaches typically consider the frequency of the term in the document and in the collection in order to compute a score reflecting the importance of the term for the document. In tasks characterized by the presence of training data (such as text classifi…
Combines CNN and Transformer for financial time series forecasting.
problem Forecasting financial time series, especially stock prices, is challenging due to short-term and long-term dependencies.
method Uses CNN for short-term dependencies and Transformer for long-term dependencies.
result Demonstrated superior performance in forecasting stock price changes compared to traditional methods.