English
Related papers

Related papers: Linear Rescaling to Accurately Interpret Logarithm…

200 papers

The purpose of this paper is to present a fresh idea on how symbolic learning might be realized via analogical reasoning. For this, we introduce directed analogical proportions between logic programs of the form "$P$ transforms into $Q$ as…

Logic in Computer Science · Computer Science 2023-10-12 Christian Antić

An algorithm is given for determining an optimal $b$-step approximation of weighted data, where the error is measured with respect to the $L_\infty$ norm. For data presorted by the independent variable the algorithm takes $\Theta(n + \log n…

Data Structures and Algorithms · Computer Science 2015-05-05 Quentin F. Stout

Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at…

Optimization and Control · Mathematics 2026-01-27 Jan Schröder , Yair Censor , Philipp Süss , Karl-Heinz Küfer

In this article, we try to give an answer to the simple question: ``\textit{What is the critical growth rate of the dimension $p$ as a function of the sample size $n$ for which the Central Limit Theorem holds uniformly over the collection…

Probability · Mathematics 2020-08-12 Debraj Das , Soumendra Lahiri

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

High Energy Physics - Theory · Physics 2008-11-26 Pierre Mathieu , David Ridout

Change point estimation is often formulated as a search for the maximum of a gain function describing improved fits when segmenting the data. Searching through all candidates requires $O(n)$ evaluations of the gain function for an interval…

Methodology · Statistics 2024-11-22 Solt Kovács , Housen Li , Lorenz Haubner , Axel Munk , Peter Bühlmann

We consider the sparsification of sums $F : \mathbb{R}^n \to \mathbb{R}$ where $F(x) = f_1(\langle a_1,x\rangle) + \cdots + f_m(\langle a_m,x\rangle)$ for vectors $a_1,\ldots,a_m \in \mathbb{R}^n$ and functions $f_1,\ldots,f_m : \mathbb{R}…

Data Structures and Algorithms · Computer Science 2023-12-01 Arun Jambulapati , James R. Lee , Yang P. Liu , Aaron Sidford

We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to…

Logic in Computer Science · Computer Science 2007-08-17 Dale Miller

We obtain Lipschitz estimates for bounded minimizers of functionals with nonstandard $(p,q)$-growth satisfying the dimension-independent restriction $q<p+2$ with $p \geq 2$. This relation improves existing restrictions when $p \leq N-1$,…

Analysis of PDEs · Mathematics 2021-08-16 Karthik Adimurthi , Vivek Tewary

The estimation of normalizing constants is a fundamental step in probabilistic model comparison. Sequential Monte Carlo methods may be used for this task and have the advantage of being inherently parallelizable. However, the standard…

Machine Learning · Statistics 2016-08-16 Marco Fraccaro , Ulrich Paquet , Ole Winther

Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}\Delta^r \log \p(n)$, by…

Number Theory · Mathematics 2022-04-04 Gargi Mukherjee

We consider the variable selection problem in linear regression. Suppose that we have a set of random variables $X_1,...,X_m,Y,\epsilon$ such that $Y=\sum_{k\in \pi}\alpha_kX_k+\epsilon$ with $\pi\subseteq \{1,...,m\}$ and $\alpha_k\in…

Statistics Theory · Mathematics 2010-12-21 Joe Suzuki

A set of piecewise linear functions, called polylines, $P_1,\ldots,P_L$ each with at most $n$ vertices can be simplified into a polyline $M$ with $k$ vertices, such that the Fr\'echet distances $\epsilon_1,\ldots,\epsilon_L$ to each of…

Computational Geometry · Computer Science 2021-08-30 Sepideh Aghamolaei , Mohammad Ghodsi

A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…

Mathematical Physics · Physics 2025-04-02 Alexander P. Zubarev

Many learning algorithms such as kernel machines, nearest neighbors, clustering, or anomaly detection, are based on the concept of 'distance' or 'similarity'. Before similarities are used for training an actual machine learning model, we…

Though Large Language Models (LLMs) have shown remarkable abilities in mathematics reasoning, they are still struggling with performing numeric operations accurately, such as addition and multiplication. Numbers can be tokenized into tokens…

Computation and Language · Computer Science 2024-09-30 Zhejian Zhou , Jiayu Wang , Dahua Lin , Kai Chen

Normalization is a vital process for any machine learning task as it controls the properties of data and affects model performance at large. The impact of particular forms of normalization, however, has so far been investigated in limited…

Machine Learning · Computer Science 2022-06-22 Chintan Trivedi , Konstantinos Makantasis , Antonios Liapis , Georgios N. Yannakakis

We consider the estimation of the value of a linear functional of the slope parameter in functional linear regression, where scalar responses are modeled in dependence of random functions. In Johannes and Schenk [2010] it has been shown…

Statistics Theory · Mathematics 2011-12-14 Jan Johannes , Rudolf Schenk

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Symbolic Computation · Computer Science 2007-05-23 Martin Ziegler

The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that…

Logic · Mathematics 2019-12-17 Norihiro Yamada
‹ Prev 1 4 5 6 7 8 10 Next ›