Adversarial vulnerabilities of human decision-making.

Adversarial examples are carefully crafted input patterns that are surprisingly poorly classified by artificial and/or natural neural networks. Here we examine adversarial vulnerabilities in the processes responsible for learning and choice in humans. Building upon recent recurrent neural network models of choice processes, we propose a general framework for generating adversarial opponents that can shape the choices of individuals in particular decision-making tasks toward the behavioral patterns desired by the adversary.

A Geometric Clustering Tool (AGCT) to robustly unravel the inner cluster structures of time-series gene expressions.

Systems biology aims at holistically understanding the complexity of biological systems. In particular, nowadays with the broad availability of gene expression measurements, systems biology challenges the deciphering of the genetic cell machinery from them. In order to help researchers, reverse engineer the genetic cell machinery from these noisy datasets, interactive exploratory clustering methods, pipelines and gene clustering tools have to be specifically developed.

Optimal response vigor and choice under non-stationary outcome values.

Within a rational framework, a decision-maker selects actions based on the reward-maximization principle, which stipulates that they acquire outcomes with the highest value at the lowest cost. Action selection can be divided into two dimensions: selecting an action from various alternatives, and choosing its vigor, i.e.

An Advanced Omic Approach to Identify Co-Regulated Clusters and Transcription Regulation Network with AGCT and SHOE Methods.

To obtain the global picture of genetic machinery for massive high-throughput gene expression data, novel data-driven unsupervised learning approaches are becoming essentially important. For this purpose, basic analytic workflow has been established and should include two steps: first, unsupervised clustering to identify genes with similar behavior upon exposure to a signal, and second, identification of transcription factors regulating those genes. In this chapter, we will describe an advanced tool that can be used for analyzing and characterizing large-scale time-series gene expression composed of a two-step approach.

Gentle Nearest Neighbors Boosting over Proper Scoring Rules.

Tailoring nearest neighbors algorithms to boosting is an important problem. Recent papers study an approach, UNN, which provably minimizes particular convex surrogates under weak assumptions. However, numerical issues make it necessary to experimentally tweak parts of the UNN algorithm, at the possible expense of the algorithm's convergence and performance.

High-resolution random-modulation cw lidar.

A high-resolution random-modulation continuous wave lidar for surface detection using a semiconductor laser diode is presented. The laser diode is intensity modulated with the pseudorandom binary sequence. Its enhanced resolution is achieved via interpolation and a novel front-end analog technique, lowering the requirement of the analog-to-digital converter sampling rate and the associated circuitry.

Bregman divergences and surrogates for learning.

Bartlett et al. (2006) recently proved that a ground condition for surrogates, classification calibration, ties up their consistent minimization to that of the classification risk, and left as an important problem the algorithmic questions about their minimization. In this paper, we address this problem for a wide set which lies at the intersection of classification calibrated surrogates and those of Murata et al.

G-protein coupled receptor signaling architecture of mammalian immune cells.

A series of recent studies on large-scale networks of signaling and metabolic systems revealed that a certain network structure often called "bow-tie network" are observed. In signaling systems, bow-tie network takes a form with diverse and redundant inputs and outputs connected via a small numbers of core molecules. While arguments have been made that such network architecture enhances robustness and evolvability of biological systems, its functional role at a cellular level remains obscure.

On weighting clustering.

Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance points, somehow making clustering move toward the hardest points to cluster. The motivations come principally from an analogy with powerful supervised classification methods known as boosting algorithms.

Statistical region merging.

This paper explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions. We exhibit a particular blend of algorithmics and statistics whose segmentation error is, as we show, limited from both the qualitative and quantitative standpoints. This approach can be efficiently approximated in linear time/space, leading to a fast segmentation algorithm tailored to processing images described using most common numerical pixel attribute spaces.