
Data Cleansing for Models Trained with SGD
Data cleansing is a typical approach used to improve the accuracy of mac...
read it

On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm
Tensor train (TT) decomposition provides a spaceefficient representatio...
read it

Finding Alternate Features in Lasso
We propose a method for finding alternate features missing in the Lasso ...
read it

Joint Word Representation Learning using a Corpus and a Semantic Lexicon
Methods for learning word representations using large text corpora have ...
read it

Embedding Semantic Relations into Word Representations
Learning representations for semantic relations is important for various...
read it

Learning Word Representations from Relational Graphs
Attributes of words and relations between two words are central to numer...
read it

ClassiNet  Predicting Missing Features for ShortText Classification
The fundamental problem in shorttext classification is feature sparsene...
read it

Neural Photometric Stereo Reconstruction for General Reflectance Surfaces
We present a novel convolutional neural network architecture for photome...
read it

Maximally Invariant Data Perturbation as Explanation
While several feature scoring methods are proposed to explain the output...
read it

Subspace Selection via DRSubmodular Maximization on Lattices
The subspace selection problem seeks a subspace that maximizes an object...
read it

Algorithmic MetaTheorems for Monotone Submodular Maximization
We consider a monotone submodular maximization problem whose constraint ...
read it

Linear PseudoPolynomial Factor Algorithm for Automaton Constrained Tree Knapsack Problem
The automaton constrained tree knapsack problem is a variant of the knap...
read it

Submodular Stochastic Probing with Prices
We introduce Stochastic Probing with Prices (SPP), a variant of the Stoc...
read it

Convex Hull Approximation of Nearly Optimal Lasso Solutions
In an ordinary feature selection procedure, a set of important features ...
read it

A Simple Way to Deal with Cherrypicking
Statistical hypothesis testing serves as statistical evidence for scient...
read it

Pretending Fair Decisions via Stealthily Biased Sampling
Fairness by decisionmakers is believed to be auditable by third parties...
read it

Optimal Algorithm to Reconstruct a Tree from a Subtree Distance
This paper addresses the problem of finding a representation of a subtre...
read it

Incorrect implementations of the FloydWarshall algorithm give correct solutions after three repeats
The FloydWarshall algorithm is a wellknown algorithm for the allpair...
read it

Revisiting Graph Neural Networks: All We Have is LowPass Filters
Graph neural networks have become one of the most important techniques t...
read it

rGather Clustering and rGathering on Spider: FPT Algorithms and Hardness
We consider minmax rgather clustering problem and minmax rgathering ...
read it

PTAS and Exact Algorithms for rGathering Problems on Tree
rgathering problem is a variant of facility location problems. In this ...
read it

Stochastic Monotone Submodular Maximization with Queries
We study a stochastic variant of monotone submodular maximization proble...
read it

Multiple KnapsackConstrained Monotone DRSubmodular Maximization on Distributive Lattice  Continuous Greedy Algorithm on Median Complex 
We consider a problem of maximizing a monotone DRsubmodular function un...
read it

Empirical Hypothesis Space Reduction
Selecting appropriate regularization coefficients is critical to perform...
read it

A Simple Proof of the Universality of Invariant/Equivariant Graph Neural Networks
We present a simple proof for the universality of invariant and equivari...
read it
Takanori Maehara
is this you? claim profile