arXiv research

New algorithm optimizes unimodal bandits using empirical divergence.

New strategies avoid forced exploration for unimodal bandits.

Proposes EDESH-SA for better inventory management under uncertainty.

Let $(X,o)$ be a complex normal surface singularity with rational homology sphere link and let $\widetilde{X}$ be one of its good resolutions. Fix an effective cycle $Z$ supported on the exceptional curve and also a possible Chern class $l'\in H^2(\widetilde{X},\mathbb{Z})$. Define ${\rm Eca}^{l'}(Z)$ as the space of e…

Influence maximization (IM) is one of the most important problems in social network analysis. Its objective is to find a given number of seed nodes that maximize the spread of information through a social network. Since it is an NP-hard problem, many approximate/heuristic methods have been developed, and a number of th…

Optimized strategies for graph-structured bandits reduce regret efficiently.

A new framework maximizes influence spread in social networks by accounting for inter-community diffusion.

Algorithm ensures fair information spread in social networks with community structure.

The IM effect helps detect anomalies by memorizing inliers early.

Humans are capable of building holistic representations for images at various levels, from local objects, to pairwise relations, to global structures. The interpretation of structures involves reasoning over repetition and symmetry of the objects in the image. In this paper, we present the Program-Guided Image Manipula…

Optimizes treatment allocation in networks considering indirect effects.

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]

Discussion of ``2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization'' by V. Koltchinskii [arXiv:0708.0083]

Discussion of "2004 IMS Medallion Lecture: Local Rademacher complexities and oracle inequalities in risk minimization" by V. Koltchinskii [arXiv:0708.0083]

ALTBI enhances outlier detection by maximizing the inlier-memorization effect.

In this paper, a new algorithm based on differential geometry viewpoint to solve the 3D rotating Navier-Stokes equations with complex Boundary is proposed, which is called Bi-parallel algorithm. For xample, it can be applied to passage flow between two blades in impeller and circulation flow through aircrafts with comp…

Let $-\im\Lie_\T$ (essentially Lie derivative with respect to $\T$, a smooth nowhere zero real vector field) and $P$ be commuting differential operators, respectively of orders 1 and $m\geq 1$, the latter formally normal, both acting on sections of a vector bundle over a closed manifold. It is shown that if $P+(-i\Lie_…

The rise of Online Social Networks (OSNs) has caused an insurmountable amount of interest from advertisers and researchers seeking to monopolize on its features. Researchers aim to develop strategies for determining how information is propagated among users within an OSN that is captured by diffusion or influence model…

Language models perform worse with implicit reward models than explicit ones.

New method recovers relative rates in spatial compositional data from IMS.

DQ4FairIM uses RL to maximize influence while ensuring fairness across all groups.

Prove existence of $SO(3) imes SO(8)$-invariant Einstein metric on $S^3 imes S^7$

Trinary decision tree improves handling of missing data in machine learning.

The well-known Influence Maximization (IM) problem has been actively studied by researchers over the past decade, with emphasis on marketing and social networks. Existing research have obtained solutions to the IM problem by obtaining the influence spread and utilizing the property of submodularity. This paper is based…

Proposes a new sampling method for online learning with cumulative oversampling.

There has been an increased interest in discovering heuristics for combinatorial problems on graphs through machine learning. While existing techniques have primarily focused on obtaining high-quality solutions, scalability to billion-sized graphs has not been adequately addressed. In addition, the impact of budget-con…

Research shows collective learning across diverse environments is hard due to privacy and security concerns.

New method accelerates energetic variational inference using particle dynamics.

In this work, we study Lie groupoids equipped with multiplicative foliations and the corresponding infinitesimal data. We determine the infinitesimal counterpart of a multiplicative foliation in terms of its core and sides together with a partial connection satisfying special properties, giving rise to the concept of I…

This article prices OTC derivatives with either an exogenously determined initial margin profile or endogenously approximated initial margin. In the former case, margin valuation adjustment (MVA) is defined as the liability-side discounted expected margin profile, while in the latter, an extended partial differential e…

A novel framework IMBoost improves outlier detection by leveraging the inlier memorization effect.

We propose an autoencoding sequence-based transceiver for communication over dispersive channels with intensity modulation and direct detection (IM/DD), designed as a bidirectional deep recurrent neural network (BRNN). The receiver uses a sliding window technique to allow for efficient data stream estimation. We find t…

We consider the problem of selecting a seed set to maximize the expected number of influenced nodes in the social network, referred to as the \textit{influence maximization} (IM) problem. We assume that the topology of the social network is prescribed while the influence probabilities among edges are unknown. In order …

Motivation: Tumor classification using Imaging Mass Spectrometry (IMS) data has a high potential for future applications in pathology. Due to the complexity and size of the data, automated feature extraction and classification steps are required to fully process the data. Deep learning offers an approach to learn featu…

We introduce a dynamic model of the default waterfall of derivatives CCPs and propose a risk sensitive method for sizing the initial margin (IM), and the default fund (DF) and its allocation among clearing members. Using a Markovian structure model of joint credit migrations, our evaluation of DF takes into account the…

Kernel TCK_IM tackles missing data in EHR time series, improving analysis.

In this paper, by using the $G_2$-structure on Im$(\mathbb O)\cong\mathbb R^7$ from the octonions $\mathbb O$, the $G_2$-binormal motion of curves $γ(t,s)$ in $\mathbb R^7$ associated to the almost complex structure on $\mathbb S^6$ is studied. The motion is proved to be equivalent to Schrödinger flows from $\mathbb R^…

In an earlier paper, we studied manifolds $M$ endowed with a generalized F structure $Φ\in End(TM\oplus T^*M)$, skew-symmetric with respect to the pairing metric, such that $Φ^3+Φ=0$. Furthermore, if $Φ$ is integrable (in some well-defined sense), $Φ$ is a generalized CRF structure. In the present paper we study quasi-…

Special orthogonal representations from octonions have geometric properties linked to binary cubics.

We consider a joint processing of $n$ independent sparse regression problems. Each is based on a sample $(y_{i1},x_{i1})...,(y_{im},x_{im})$ of $m$ \iid observations from $y_{i1}=x_{i1}\tβ_i+\eps_{i1}$, $y_{i1}\in \R$, $x_{i 1}\in\R^p$, $i=1,...,n$, and $\eps_{i1}\dist N(0,\sig^2)$, say. $p$ is large enough so that the…

Improved regret bounds for DP-KLUCB and DP-IMED in Bernoulli bandits.

In this paper we address some problems concerning an approximate Dirichlet domain. We show that under some assumptions the approximate Dirichlet domain can work equally well as an exact Dirichlet domain. In particular, we consider a problem of tiling a hyperbolic ball with copies of the Dirichlet domain. This problem a…

These notes have been prepared as reading material for the mini-course that the author gave at IMS, National University of Singapore, as part of the "Summer school on the moduli space of Higgs bundles".

Study of multiplicative connections in Lie groupoids.

This short note gives an overview of how a few conjectures and theorems of the author and collaborators fit together. It was prepared for Oberwolfach's workshop Differentialgeometrie im Großen, 28 June - 4 July 2015, and contains no new results.

Let $P$ be a polynomial of degree $d$ with a Cremer point $p$ and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets $J_P$. The \emph{red dwarf} $J_P$ are nowhere connected im kleinen and such that the intersection of all impressions of external angles is a cont…