arXiv research

Study geometry of tetrahedra in complex hyperbolic space and Hilbert spaces.

Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in its…

Kernel interpolation improved with continuous volume sampling.

Classifies Calabi hypersurfaces with parallel Fubini-Pick form.

Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.

Transformed geometry into algebra to prove Pick's theorem efficiently.

The paper introduces new KMEs to capture stochastic process filtrations.

This paper classifies hypersurfaces in n+1 with parallel Fubini-Pick form.

In a pathbreaking paper, Cover and Ordentlich (1998) solved a max-min portfolio game between a trader (who picks an entire trading algorithm, $θ(\cdot)$) and "nature," who picks the matrix $X$ of gross-returns of all stocks in all periods. Their (zero-sum) game has the payoff kernel $W_θ(X)/D(X)$, where $W_θ(X)$ is the…

We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.

The paper studies third-order PDEs invariant under affine transformations and connects them to the Fubini-Pick invariant.

The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.

Optimal trend-following strategy uses simple EMA, avoiding complex cherry-picked signals.

Many kinds of data are naturally amenable to being treated as sequences. An example is text data, where a text may be seen as a sequence of words. Another example is clickstream data, where a data instance is a sequence of clicks made by a visitor to a website. This is also common for data originating in the domains of…

Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.

We present an intriguing question about lattice points in triangles where Pick's formula is "almost correct". The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological question was recently solved, but the lattice point problem is still open.

Cryo-electron microscopy (cryo-EM) studies using single particle reconstruction are extensively used to reveal structural information on macromolecular complexes. Aiming at the highest achievable resolution, state of the art electron microscopes automatically acquire thousands of high-quality micrographs. Particles are…

Particle picking is currently a critical step in the cryo-EM single particle reconstruction pipeline. Despite extensive work on this problem, for many data sets it is still challenging, especially for low SNR micrographs. We present the KLT (Karhunen Loeve Transform) picker, which is fully automatic and requires as an …

In this note, we prove a Schwarz-Pick type lemma for minimal maps between negatively curved Riemannian surfaces. More precisely, we prove that if $f:M \to N$ is a minimal map with bounded Jacobian between two complete negatively curved Riemann surfaces M and N whose sectional curvatures $σ_M$ and $σ_N$ satisfy $infσ_M …

Sharp estimate on harmonic maps at conformal points in balls.

Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…

We show that the Cappell-Shaneson version of Pick's theorem for simple lattice polytopes is a consequence of a general relation between characteristic numbers of virtual submanifolds dual to the characteristic classes of a stably almost complex manifold. This relation is analogous to the miraculous cancellation formula…

In this paper, we discuss the general existence theory of Dirac-harmonic maps from closed surfaces via the heat flow for $α$-Dirac-harmonic maps and blow-up analysis. More precisely, given any initial map along which the Dirac operator has nontrivial minimal kernel, we first prove the short time existence of the heat f…

DM uses semigroup property to tune diffusion time for better data analysis.

If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to connect every point to $c_{d,1} \log{\log{n}}$ points chosen randomly among its $…

Study analyzes 3,171 stocks to pick efficient portfolios using quantum and classical solvers.

Mass spectrometry (MS) is an important technique for chemical profiling which calculates for a sample a high dimensional histogram-like spectrum. A crucial step of MS data processing is the peak picking which selects peaks containing information about molecules with high concentrations which are of interest in an MS in…

Detecting a specific horizon in seismic images is a valuable tool for geological interpretation. Because hand-picking the locations of the horizon is a time-consuming process, automated computational methods were developed starting three decades ago. Older techniques for such picking include interpolation of control po…

Selection of appropriate collective variables for enhancing sampling of molecular simulations remains an unsolved problem in computational biophysics. In particular, picking initial collective variables (CVs) is particularly challenging in higher dimensions. Which atomic coordinates or transforms there of from a list o…

We analyze the spectral clustering procedure for identifying coarse structure in a data set $x_1, \dots, x_n$, and in particular study the geometry of graph Laplacian embeddings which form the basis for spectral clustering algorithms. More precisely, we assume that the data is sampled from a mixture model supported on …

We consider the problem of evaluating the quality of startup companies. This can be quite challenging due to the rarity of successful startup companies and the complexity of factors which impact such success. In this work we collect data on tens of thousands of startup companies, their performance, the backgrounds of t…

We investigate whether a robot arm can learn to pick and throw arbitrary objects into selected boxes quickly and accurately. Throwing has the potential to increase the physical reachability and picking speed of a robot arm. However, precisely throwing arbitrary objects in unstructured settings presents many challenges:…

CAP algorithm controls FCR in online selective prediction.

We derive asset pricing formula for markets with incomplete information and subjective views.

This work improves sampling efficiency on complex spaces using determinantal processes.

If an artificial intelligence aims to maximise risk-adjusted return, then under mild conditions it is disproportionately likely to pick an unethical strategy unless the objective function allows sufficiently for this risk. Even if the proportion $η$ of available unethical strategies is small, the probability ${p_U}$ of…

We show that the volume entropy of the Hilbert metric on a closed convex projective surface tends to zero as the corresponding Pick differential tends to infinity. The proof is based on the theorem, due to Benoist and Hulin, that the Hilbert metric and Blaschke metric are comparable.

Binarized Neural Network (BNN) removes bitwidth redundancy in classical CNN by using a single bit (-1/+1) for network parameters and intermediate representations, which has greatly reduced the off-chip data transfer and storage overhead. However, a large amount of computation redundancy still exists in BNN inference. B…

In this article, we advocate the ensemble approach for variable selection. We point out that the stochastic mechanism used to generate the variable-selection ensemble (VSE) must be picked with care. We construct a VSE using a stochastic stepwise algorithm, and compare its performance with numerous state-of-the-art algo…

A variety of methods have been proposed for interpreting nodes in deep neural networks, which typically involve scoring nodes at lower layers with respect to their effects on the output of higher-layer nodes (where lower and higher layers are closer to the input and output layers, respectively). However, we may be inte…

New method finds significant high-order interactions efficiently.

The paper solves circle packings on surfaces with boundaries.

Two new tests assess how well conditional models fit data.

Dialogue research tends to distinguish between chit-chat and goal-oriented tasks. While the former is arguably more naturalistic and has a wider use of language, the latter has clearer metrics and a straightforward learning signal. Humans effortlessly combine the two, for example engaging in chit-chat with the goal of …

This paper introduces a novel, well-founded, betweenness measure, called the Bag-of-Paths (BoP) betweenness, as well as its extension, the BoP group betweenness, to tackle semisupervised classification problems on weighted directed graphs. The objective of semi-supervised classification is to assign a label to unlabele…

Cryo-electron microscopy (cryoEM) is an increasingly popular method for protein structure determination. However, identifying a sufficient number of particles for analysis (often >100,000) can take months of manual effort. Current computational approaches are limited by high false positive rates and require significant…

We consider a two-person trading game in continuous time whereby each player chooses a constant rebalancing rule $b$ that he must adhere to over $[0,t]$. If $V_t(b)$ denotes the final wealth of the rebalancing rule $b$, then Player 1 (the `numerator player') picks $b$ so as to maximize $\mathbb{E}[V_t(b)/V_t(c)]$, whil…

We study fibrations $\cV$ of toric varieties over the flag variety $G/T$, where $G$ is a compact semisimple Lie group and $T$ is a maximal torus. From symplectic data, we construct test configurations of $\cV$ and compute their Futaki invariants by employing a generalization of Pick's Theorem. We also give a simple for…